Local two-qubit channels: probability-based comparison of constituents and entanglement-annihilating behavior Sergey Filippov¹, Tomáš Rybár², Mário Ziman².

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

BQP/qpoly EXP/poly Scott Aaronson UC Berkeley. BQP/qpoly Class of languages recognized by a bounded-error polytime quantum algorithm, with a polysize.
Quantum Computation and Quantum Information – Lecture 2
Local Hamiltonians in Quantum Computation Funding: Slovak Research and Development Agency, contract No. APVV , European Project QAP 2004-IST- FETPI-15848,
Puzzle Twin primes are two prime numbers whose difference is two.
Xkcd Xkcd.com. Section 3 Recap ► Angular momentum commutators:  [J x, J y ] = iħJ z etc ► Total ang. Mom. Operator: J 2 = J x 2 + J y 2 +J z 2 ► Ladder.
Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.
Quantum Computing MAS 725 Hartmut Klauck NTU
Entanglement in fermionic systems M.C. Bañuls, J.I. Cirac, M.M. Wolf.
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 11 (2005) Richard Cleve DC 3524
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 / RAC 2211 Lecture.
Adapting Quantum Error Correction to Specific Channels Peter Shor Massachusetts Institute of Technology Joint work with Andrew Fletcher and Ruitian Lang.
DENSITY MATRICES, traces, Operators and Measurements
QEC’07-1 ASF 6/13/2015 MIT Lincoln Laboratory Channel-Adapted Quantum Error Correction Andrew Fletcher QEC ‘07 21 December 2007.
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
CSEP 590tv: Quantum Computing
General Entanglement-Assisted Quantum Error-Correcting Codes Todd A. Brun, Igor Devetak and Min-Hsiu Hsieh Communication Sciences Institute QEC07.
Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
CLASSIFYING SIMULATORS Canada 10 iQST, Dongsheng Wang Calgary, 12/06/2015.
Standard Form for the Equation of the Circle
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
1 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Richard Cleve QNC 3129 Lecture 18 (2014)
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 14 (2009)
Lecture 9 Particle in a rectangular well (c) So Hirata, Department of Chemistry, University of Illinois at Urbana-Champaign. This material has been developed.
Alice and Bob’s Excellent Adventure
Generalized Deutsch Algorithms IPQI 5 Jan Background Basic aim : Efficient determination of properties of functions. Efficiency: No complete evaluation.
Quantum Computing Presented by: Don Davis PHYS
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
On the Dimension of Subspaces with Bounded Schmidt Rank Toby Cubitt, Ashley Montanaro, Andreas Winter and also Aram Harrow, Debbie Leung (who says there's.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Michael A. Nielsen University of Queensland Density Matrices and Quantum Noise Goals: 1.To review a tool – the density matrix – that is used to describe.
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
September 12, 2014 Martin Suchara Andrew Cross Jay Gambetta Supported by ARO W911NF S IMULATING AND C ORRECTING Q UBIT L EAKAGE.
Basic Concepts of Information Theory Entropy for Two-dimensional Discrete Finite Probability Schemes. Conditional Entropy. Communication Network. Noise.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Quantum info tools & toys for quantum gravity LOOPS `05 Daniel Terno Perimeter Institute.
DYNAMICS OF OPEN Q-SYSTES FROM A PERSPECTIVE OF QIT IMS, Imperial College, London, 18 January 2007 Vladimír Bužek Research Center for Quantum Information.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
Entanglement and Optimal Strings of Qubits for Memory Channels Laleh Memarzadeh Sharif University of Technology IICQI 7-10 Sept 2007 Kish Island.
Basic Concepts of Information Theory A measure of uncertainty. Entropy. 1.
Ruhr University Bochum Faculty of Mathematics Information-Security and Cryptology An Algorithm for Checking Normality of Boolean Functions Magnus DaumHans.
Quantum Computers The basics. Introduction 2/47 Dušan Gajević.
Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Qubits, von Neumann Measurement, Quantum.
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
Fernando G.S.L. Brandão and Martin B. Plenio
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2009) Richard.
A Quantum Local Lemma Or Sattath TAU and HUJI Andris Ambainis
Jean Christian Boileau (University of Toronto)
M. Stobińska1, F. Töppel2, P. Sekatski3,
Introduction to Quantum Computing Lecture 1 of 2
the illusion of the Heisenberg scaling
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki * *Perimeter Institute for.
تعارف. تعارف قواعد العمل ا الموبيل المشروبات الاحاديث الجانبية الاسئلة نفكر.
Mark S. Byrd Departments of Physics and Computer Science
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture 15 (2011)
Estimation from Quantized Signals
Linear Optical Quantum Computing
University of Queensland
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
Measurement Incompatibility and Semi-quantum Nonlocal Games
Science is fun. Science is fun. Science is fun. Science is fun. Science is fun. Science is fun. Science is fun. Science is fun. Science is fun. Science.
Exponential Functions and their Graphs
Presentation transcript:

Local two-qubit channels: probability-based comparison of constituents and entanglement-annihilating behavior Sergey Filippov¹, Tomáš Rybár², Mário Ziman² ¹ Moscow Institute of Physics and Technology ² Research Center for Quantum Information, Slovak Academy of Sciences CEQIP’2011

Content Local channels Comparison Entanglement-annihilating

CEQIP’2011 Local channels E1E1 E2E2

CEQIP’2011 Comparison The aim is to distinguish between  non-identical channels  twin-identical channels -distance between channels:

CEQIP’2011 Scheme

CEQIP’2011 Local two-qubit channels Matrix representation for one channel

CEQIP’2011 Example 1 Input state is POVM has two effects, corresponding to projectors on symm. and antisymm. subspaces The output mean value is – Unitary channels ‘same’ ‘different’ +1 – All channels ‘same’ ‘different’

CEQIP’2011 Example 2 Input state POVM has two effects, corresponding to projectors on symm. and antisymm. subspaces The output mean value is – All channels ‘same’ ‘different’

Entanglement-annihilating behaviour

CEQIP’2011

What does EA mean? is entanglement-annihilating if the output state is separable for all input states is entanglement-breaking if the state is disentangled with respect to partitioning ‘1+2’|‘anc' for any input state and ancillary system.

CEQIP’2011 Properties

CEQIP’2011 Two depolarizing channels Entanglement-breaking

CEQIP’2011 Two depolarizing channels Entanglement-annihilating

CEQIP’2011 Two depolarizing channels

CEQIP’2011 Pauli channels

CEQIP’2011 Lemma

CEQIP’2011 Corollary 1

CEQIP’2011 How is Corollary 1 useful?

CEQIP’2011 Corollary 2

CEQIP’2011

Summary We have considered – Probability-based comparison of qubit channels – Entanglement between qubits involved while passing through a local channel Problems to investigate – Upper-dimensional systems (qudits) – Continuous-variables – Multipartite systems Hope you have had some fun

CEQIP’2011 Conclusion Local channels ask many questions important for practical Quantum Information Are participants similar to local channels? Let us try answer them…

Thank you for listening!