Quantum Hadamard channels (I)
|
|
- Abner Collins
- 6 years ago
- Views:
Transcription
1 .... Quantum Hadamard channels (I) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. July 8, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
2 Outline...1 Introductory notions...2 Quantum Hadamard channels Reference: Bradler et al, PRA 81, (2010) A summary of this talk is available online at Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
3 . Introduction Introductory notions Noisy quantum channel, Kraus representation N (σ) = N i σn i, N i N i = I. i i (1) Isometric extension N A B (σ) = Tr E {U N σu N }, U N U N = I. (2) Figure: Isometric extension Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
4 Introductory notions The Kraus operators provide a straightforward method for constructing an isometric extension U A BE N = i N A B i i E, (3) where { i E } is an orthonormal set of states. Useful relation U N σu N = i,j (N i σn j )B i j E. (4) Complementary channel, unique up to isometries on the system E N c (σ) := Tr B {U N σu N }. (5) Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
5 Introductory notions Useful fact: a valid complementary channel for the channel introduced before N c (σ) = i,j Tr{N i σn j } i j E. (6) Degradable channel: if there exists a degrading channel D B E that simulates the action of the complementary channel (N c ) A E, i.e. D B E s.t. σ, D B E N A B (σ) = (N c ) A E (σ). (7) Degradable channels are nice! Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
6 Introductory notions More tips and tricks: suppose Alice possesses an ensemble {p X (x), ρ A x }, where p X (x) is the probability density function for a random variable X. She can augment this ensemble by correlating a classical variable (a label) with each ρ A x, and produce {p X (x), x x X ρ A x }, with { x X } an orthonormal set. Classical-quantum state: ρ XA = x p X (x) x x X ρ A x. (8) Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
7 Introductory notions Let ϕ x AA be the purification of ρ A x. Then the following is also a classical-quantum state ρ XAA = x p X (x) x x X ϕ x ϕ x AA. (9) Suppose now Alice transmits the A subsystem through a noisy quantum channel N A B. The output state will be ρ XAB := N A B (ρ XAA ) = x p X (x) x x X N A B ϕ x ϕ x AA = x p X (x) x x X ρ AB x. (10) Define ϕ x ABE as ϕ x ABE := U N ϕ x AA purify ρ AB x. and observe that ϕ x ABE Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
8 . Entanglement-breaking channels Entanglement-breaking channels: N is entanglement-breaking if it outputs a separable state whenever half of any entangled state is the input to the channel. Reference: Horodecki, Shor and Ruskai, Rev. Math. Phys. 15, 629 (2003). Enough to check only for MES inputs ϕ AA := 1 D 1 i A i A, (11) D i=0 i.e. N A B is entanglement-breaking if and only if N A B ( ϕ AA ) = x p X (x)ρ A x ρ B x. (12) Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
9 It turns out that the action of an entanglement-breaking channel can always be written as N EB (ρ) = x Tr{Λ x ρ}σ x, (13) where {Λ x } is a POVM and the states σ x depend on the channel. Additionally, any entanglement-breaking channel admits a Kraus representation whose Kraus operators are unit rank: N i = ξ B ζ A. The sets { ξ B } and { ζ A } are not necessarily orthonormal. The classical capacity of an entanglement-breaking channel admits a single-letter formula. It s quantum capacity is zero. Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
10 . Hadamard channels A Hadamard channel is a quantum channel whose complementary channel is entanglement breaking. Why Hadamard? Its output can always be written as the Hadamard product (elementwise multiplication) of a representation of the input density operator with another operator. How does this work? Let U N c be an isometric extension of the complementary channel (N c ) A E. The Kraus operators of the complementary channel (which is entanglement-breaking) (N c ) A E are unit rank, ξ i E ζ i A. Then U N c σu N c = i,j ξ i E ζ i A σ ζ j A ξ j E i B j B = i,j ζ i A σ ζ j A ξ j ξ i E i B j B. (14) Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
11 Now trace over E to get the original channel from A to B N A B H (σ) = i,j ζ i A σ ζ j A ξ j ξ i E i B j B. (15) Now let [Σ] i,j = ζ i A σ ζ j A, a representation of the input state σ, and let [Γ] i,j = ξ j ξ i E. Then, w.r.t. the basis { i B } N A B H (σ) = Σ Γ. (16) Hadamard channels are degradable! Why so? Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
12 Bob performs a von Neumann measurement on his state in the basis { i B } and prepares the state ξ i E conditional on the outcome i of the measurement. This procedure simulates the complementary channel (N c ) A E and also implies that the degrading map D B E is entanglement breaking. The Kraus operators of the degrading map D B E are { ξ E i B } so that [ ] D B E N A B H (σ) = ξ i E i B N A B (σ) i B ξ i E i = i i A σ i A ξ ξ E, (17) hence this degrading map effectively simulates the complementary channel (N ) A E. Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
13 The degrading map can be viewed as a composition of two maps:..1. A first map D1 B Y performs the von-neumann measurement, leading to a classical variable Y...2. A second map D2 Y E performs the state preparation, conditional on the value of the classical variable Y. Hence D B E = D Y E 2 D B Y 1. (18) Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
14 . Examples of Hadamard channels Generalized dephasing channels: model physical processes where there is no loss of energy but there is loss of quantum coherence (noise that dominates, for example, in superconducting qubits). The input A and the output B have the same dimension. Let { i A } and { i B } be orthonormal bases (the first is called the dephasing basis). The channel does not affect any state that is diagonal in the dephasing basis, but it mixes coherent superpositions of these basis states. An isometric extension U A BE N GD has the form N A B GD of a generalized dephasing channel U A BE N GD := i i B i A υ i E, (19) where the set { υ i E } is not necessarily orthonormal. Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
15 The output of a generalized dephasing channel is N GD (σ) = i,j υ j υ i E i σ j A i j B. (20) If the states { υ i E } are orthonormal, the channel is the completely dephasing channel A B A B (σ) := i i B i A σ i A i B. (21) The complementary channel of a generalized dephasing channel is Tr B {U NGD σu N GD } = i = i i A σ i A υ i υ i E Tr{ i i A σ} υ i υ i E (22) and is indeed entanglement breaking. Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
16 Simple example: qubit dephasing channel: N (σ) = (1 p)σ + p (σ), (σ) = 1 (σ + ZσZ). (23) 2 An isometric extension of it has the form U A BE N = 1 p 2 I 0 E + p 2 Z 1 E. (24) Its complementary channel is N c (σ) = p E + + ( 1 p 2 ) 1 1 E ( 1 p ) p 2 2 Tr{σZ}( 0 1 E E ), (25) and one observes that a bit flip on the input state does not change the eigenvalues of the resulting environment output state. Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, / 16
Quantum Hadamard channels (II)
Quantum Hadamard channels (II) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, USA August 5, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (II) August 5, 2010
More informationDegradable Quantum Channels
Degradable Quantum Channels Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA May 27, 2010 References The capacity of a quantum channel for simultaneous transmission of classical
More informationOperator Quantum Error Correcting Codes
Operator Quantum Error Correcting Codes Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. June 18, 2008 Vlad Gheorghiu (CMU) Operator Quantum Error Correcting
More informationSymplectic Structures in Quantum Information
Symplectic Structures in Quantum Information Vlad Gheorghiu epartment of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. June 3, 2010 Vlad Gheorghiu (CMU) Symplectic struct. in Quantum
More informationLocal cloning of entangled states
Local cloning of entangled states Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. March 16, 2010 Vlad Gheorghiu (CMU) Local cloning of entangled states March
More informationSimulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
More informationAncilla-driven universal quantum computing
Ancilla-driven universal quantum computing Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. September 30, 2010 Vlad Gheorghiu (CMU) Ancilla-driven universal
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationStructure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture. Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev
Structure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev The Superposition Principle (Physicists): If a quantum
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationOn the complementary quantum capacity of the depolarizing channel
On the complementary quantum capacity of the depolarizing channel Debbie Leung 1 and John Watrous 1 Institute for Quantum Computing and Department of Combinatorics and Optimization, University of Waterloo
More informationReport on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May
Report on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May 13 2011 Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. May 19, 2011
More informationQuantum Information Theory Tutorial
Quantum Information Theory Tutorial Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State University, Baton
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationOn the complementary quantum capacity of the depolarizing channel
On the complementary quantum capacity of the depolarizing channel Debbie Leung John Watrous 4 October, 15 Abstract The qubit depolarizing channel with noise parameter η transmits an input qubit perfectly
More informationInformation-theoretic treatment of tripartite systems and quantum channels. Patrick Coles Carnegie Mellon University Pittsburgh, PA USA
Information-theoretic treatment of tripartite systems and quantum channels Patrick Coles Carnegie Mellon University Pittsburgh, PA USA ArXiv: 1006.4859 a c b Co-authors Li Yu Vlad Gheorghiu Robert Griffiths
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationQuantum Nonlocality Pt. 4: More on the CHSH Inequality
Quantum Nonlocality Pt. 4: More on the CHSH Inequality PHYS 500 - Southern Illinois University May 4, 2017 PHYS 500 - Southern Illinois University Quantum Nonlocality Pt. 4: More on the CHSH Inequality
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationThe Minimax Fidelity for Quantum Channels: Theory and Some Applications
The Minimax Fidelity for Quantum Channels: Theory and Some Applications Maxim Raginsky University of I!inois V.P. Belavkin, G.M. D Ariano and M. Raginsky Operational distance and fidelity for quantum channels
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationOn the Relation between Quantum Discord and Purified Entanglement
On the Relation between Quantum Discord and Purified Entanglement by Eric Webster A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
More information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationIntroduction to quantum information processing
Introduction to quantum information processing Fidelity and other distance metrics Brad Lackey 3 November 2016 FIDELITY AND OTHER DISTANCE METRICS 1 of 17 OUTLINE 1 Noise channels 2 Fidelity 3 Trace distance
More informationQuantum Information Types
qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationQuantum Entanglement- Fundamental Aspects
Quantum Entanglement- Fundamental Aspects Debasis Sarkar Department of Applied Mathematics, University of Calcutta, 92, A.P.C. Road, Kolkata- 700009, India Abstract Entanglement is one of the most useful
More informationChannel Steering. Marco Piani 1, 2. University of Waterloo, N2L 3G1 Waterloo ON, Canada. compiled: December 23, 2014
Channel Steering Marco Piani 1, 2 1 SUPA and Department of Physics, University of Strathclyde, Glasgow G4 0NG, UK 2 Institute for Quantum Computing and Department of Physics and Astronomy, University of
More informationA Course in Quantum Information Theory
A Course in Quantum Information Theory Ofer Shayevitz Spring 2007 Based on lectures given at the Tel Aviv University Edited by Anatoly Khina Version compiled January 9, 2010 Contents 1 Preliminaries 3
More informationCS120, Quantum Cryptography, Fall 2016
CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions
More informationSome Bipartite States Do Not Arise from Channels
Some Bipartite States Do Not Arise from Channels arxiv:quant-ph/0303141v3 16 Apr 003 Mary Beth Ruskai Department of Mathematics, Tufts University Medford, Massachusetts 0155 USA marybeth.ruskai@tufts.edu
More informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.
More informationarxiv: v3 [quant-ph] 5 Jun 2015
Entanglement and swap of quantum states in two qubits Takaya Ikuto and Satoshi Ishizaka Graduate School of Integrated Arts and Sciences, Hiroshima University, Higashihiroshima, 739-8521, Japan (Dated:
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
More informationSchur-Weyl duality, quantum data compression, tomography
PHYSICS 491: Symmetry and Quantum Information April 25, 2017 Schur-Weyl duality, quantum data compression, tomography Lecture 7 Michael Walter, Stanford University These lecture notes are not proof-read
More informationQuantum Computer Architecture
Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
More informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More informationA Holevo-type bound for a Hilbert Schmidt distance measure
Journal of Quantum Information Science, 205, *,** Published Online **** 204 in SciRes. http://www.scirp.org/journal/**** http://dx.doi.org/0.4236/****.204.***** A Holevo-type bound for a Hilbert Schmidt
More informationQuantum Data Compression
PHYS 476Q: An Introduction to Entanglement Theory (Spring 2018) Eric Chitambar Quantum Data Compression With the basic foundation of quantum mechanics in hand, we can now explore different applications.
More informationSending Quantum Information with Zero Capacity Channels
Sending Quantum Information with Zero Capacity Channels Graeme Smith IM Research KITP Quantum Information Science Program November 5, 2009 Joint work with Jon and John Noisy Channel Capacity X N Y p(y
More informationto mere bit flips) may affect the transmission.
5 VII. QUANTUM INFORMATION THEORY to mere bit flips) may affect the transmission. A. Introduction B. A few bits of classical information theory Information theory has developed over the past five or six
More informationEntanglement and Quantum Teleportation
Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,
More informationJian-Wei Pan
Lecture Note 6 11.06.2008 open system dynamics 0 E 0 U ( t) ( t) 0 E ( t) E U 1 E ( t) 1 1 System Environment U() t ( ) 0 + 1 E 0 E ( t) + 1 E ( t) 0 1 0 0 1 1 2 * 0 01 E1 E0 q() t = TrEq+ E = * 2 1 0
More informationKapitza Fall 2017 NOISY QUANTUM MEASUREMENT
Kapitza Fall 2017 NOIY QUANTUM MEAUREMENT Ben altzman Q.I.T. TERM PAPER Professor arada Raeev December 10 th 2017 1 Introduction Not only does God play dice but... where they can t be seen. he sometimes
More informationQuantum Teleportation Pt. 1
Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the
More informationAn Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
More informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More informationHigh Fidelity to Low Weight. Daniel Gottesman Perimeter Institute
High Fidelity to Low Weight Daniel Gottesman Perimeter Institute A Word From Our Sponsor... Quant-ph/0212066, Security of quantum key distribution with imperfect devices, D.G., H.-K. Lo, N. Lutkenhaus,
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationQuantum Correlations and Bell Inequality Violation under Decoherence
Quantum Correlations and Bell Inequality Violation under Decoherence Volkan Erol Computer Engineering Department, Okan University, Istanbul, 34959, Turkey E-mail: volkan.erol@gmail.com Abstract Quantum
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationFRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY
FRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY Emina Soljanin Mathematical Sciences Research Center, Bell Labs April 16, 23 A FRAME 1 A sequence {x i } of vectors in a Hilbert space with the property
More informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More informationIntroduction To Information Theory
Introduction To Information Theory Edward Witten PiTP 2018 We will start with a very short introduction to classical information theory (Shannon theory). Suppose that you receive a message that consists
More informationarxiv: v1 [quant-ph] 3 Nov 2014
Channel Steering Marco Piani 1,2 1 SUPA and Department of Physics, University of Strathclyde, Glasgow G4 0NG, UK 2 Institute for Quantum Computing and Department of Physics and Astronomy, University of
More informationBipartite entanglement
6 Bipartite entanglement Entanglement is a fundamental concept in quantum information theory, considered by many to be a quintessential characteristic that distinguishes quantum systems from their classical
More informationDecay of the Singlet Conversion Probability in One Dimensional Quantum Networks
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks Scott Hottovy shottovy@math.arizona.edu Advised by: Dr. Janek Wehr University of Arizona Applied Mathematics December 18,
More informationLecture 8: Semidefinite programs for fidelity and optimal measurements
CS 766/QIC 80 Theory of Quantum Information (Fall 0) Lecture 8: Semidefinite programs for fidelity and optimal measurements This lecture is devoted to two examples of semidefinite programs: one is for
More informationChapter 14: Quantum Information Theory and Photonic Communications
Chapter 14: Quantum Information Theory and Photonic Communications Farhan Rana (MIT) March, 2002 Abstract The fundamental physical limits of optical communications are discussed in the light of the recent
More informationEntanglement-Assisted Capacity of a Quantum Channel and the Reverse Shannon Theorem
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 10, OCTOBER 2002 2637 Entanglement-Assisted Capacity of a Quantum Channel the Reverse Shannon Theorem Charles H. Bennett, Peter W. Shor, Member, IEEE,
More informationMultiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2
Multiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2 arxiv:quant-ph/0410063v1 8 Oct 2004 Nilanjana Datta Statistical Laboratory Centre for Mathematical Sciences University of Cambridge
More informationRemarks on the Additivity Conjectures for Quantum Channels
Contemporary Mathematics Remarks on the Additivity Conjectures for Quantum Channels Christopher King Abstract. In this article we present the statements of the additivity conjectures for quantum channels,
More informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationCoherence, Discord, and Entanglement: Activating one resource into another and beyond
586. WE-Heraeus-Seminar Quantum Correlations beyond Entanglement Coherence, Discord, and Entanglement: Activating one resource into another and beyond Gerardo School of Mathematical Sciences The University
More informationCapacity Estimates of TRO Channels
Capacity Estimates of TRO Channels arxiv: 1509.07294 and arxiv: 1609.08594 Li Gao University of Illinois at Urbana-Champaign QIP 2017, Microsoft Research, Seattle Joint work with Marius Junge and Nicholas
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationQUANTUM COMPUTING 10.
QUANTUM COMPUTING 10. Jozef Gruska Faculty of Informatics Brno Czech Republic December 20, 2011 10. QUANTUM ERROR CORRECTION CODES Quantum computing based on pure states and unitary evolutions is an idealization
More informationSecurity of quantum-key-distribution protocols using two-way classical communication or weak coherent pulses
PHYSICAL REVIEW A 75, 012316 2007 Security of quantum-key-distribution protocols using two-way classical communication or weak coherent pulses Barbara Kraus, 1 Cyril Branciard, 2 and Renato Renner 3 1
More informationarxiv: v1 [quant-ph] 29 Feb 2012
REVIEW ARTICLE Quantum channels and their entropic characteristics arxiv:1202.6480v1 [quant-ph] 29 Feb 2012 A S Holevo 1 and V Giovannetti 2 1 Steklov Mathematical Institute, Gubkina 8, 119991 Moscow,
More informationClassical and Quantum Channel Simulations
Classical and Quantum Channel Simulations Mario Berta (based on joint work with Fernando Brandão, Matthias Christandl, Renato Renner, Joseph Renes, Stephanie Wehner, Mark Wilde) Outline Classical Shannon
More informationOptimal Estimation of Single Qubit Quantum Evolution Parameters
Optimal Estimation of Single Qubit Quantum Evolution Parameters David Collins Department of Physical and Environmental Sciences, Mesa State College, Grand Junction, CO Michael Frey Department of Mathematics,
More informationPh 219/CS 219. Exercises Due: Friday 20 October 2006
1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and
More information6.1 Main properties of Shannon entropy. Let X be a random variable taking values x in some alphabet with probabilities.
Chapter 6 Quantum entropy There is a notion of entropy which quantifies the amount of uncertainty contained in an ensemble of Qbits. This is the von Neumann entropy that we introduce in this chapter. In
More informationQuantum Entanglement and Measurement
Quantum Entanglement and Measurement Haye Hinrichsen in collaboration with Theresa Christ University of Würzburg, Germany 2nd Workhop on Quantum Information and Thermodynamics Korea Institute for Advanced
More informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationQuantum correlations and decoherence in systems of interest for the quantum information processing
Universita' degli Studi di Milano Physics, Astrophysics and Applied Physics PhD School: 1 st Year-Student Mini-Workshop Quantum correlations and decoherence in systems of interest for the quantum information
More informationQuantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2
Quantum Computing 1 Multi-Qubit System Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationWhat is possible to do with noisy quantum computers?
What is possible to do with noisy quantum computers? Decoherence, inaccuracy and errors in Quantum Information Processing Sara Felloni and Giuliano Strini sara.felloni@disco.unimib.it Dipartimento di Informatica
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationEntanglement Measures and Monotones
Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying
More informationEntropy in Classical and Quantum Information Theory
Entropy in Classical and Quantum Information Theory William Fedus Physics Department, University of California, San Diego. Entropy is a central concept in both classical and quantum information theory,
More informationEntanglement: concept, measures and open problems
Entanglement: concept, measures and open problems Division of Mathematical Physics Lund University June 2013 Project in Quantum information. Supervisor: Peter Samuelsson Outline 1 Motivation for study
More informationEntropic characterization of quantum operations
Entropic characterization of quantum operations W. Roga 1, M. Fannes 2 and K. Życzkowski1,3 arxiv:1101.4105v1 [quant-ph] 21 Jan 2011 1 Instytut Fizyki im. Smoluchowskiego, Uniwersytet Jagielloński, PL-30-059
More informationMaximal vectors in Hilbert space and quantum entanglement
Maximal vectors in Hilbert space and quantum entanglement William Arveson arveson@math.berkeley.edu UC Berkeley Summer 2008 arxiv:0712.4163 arxiv:0801.2531 arxiv:0804.1140 Overview Quantum Information
More informationTrading classical communication, quantum communication, and entanglement in quantum Shannon theory
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory Min-Hsiu Hsieh and Mark M. Wilde arxiv:9.338v3 [quant-ph] 9 Apr 2 Abstract We give trade-offs between
More informationEntanglement Manipulation
Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the
More informationQuantum Teleportation Pt. 3
Quantum Teleportation Pt. 3 PHYS 500 - Southern Illinois University March 7, 2017 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 3 March 7, 2017 1 / 9 A Bit of History on Teleportation
More informationFINDING DECOMPOSITIONS OF A CLASS OF SEPARABLE STATES
FINDING DECOMPOSITIONS OF A CLASS OF SEPARABLE STATES ERIK ALFSEN AND FRED SHULTZ Abstract. We consider the class of separable states which admit a decomposition i A i B i with the B i s having independent
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More information