When Is a Measurement Reversible?
|
|
- Gervase Wilkinson
- 5 years ago
- Views:
Transcription
1 When Is a Measurement Reversible? Information Gain and Disturbance in Quantum Measurements (revisited) Physical Review A 93, (2016) Francesco Buscemi, Siddhartha Das, Mark M. Wilde contributed talk at AQIS 16 Academia Sinica, Taipei, Taiwan 1 September 2016 these slides are available for download at tinyurl.com/bdw-aqis16 Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
2 Quantum Measurement Processes an operation transforming a quantum input (the density operator representing the state of the system before the measurement, i.e., the pre-measurement state ) into a classical output (the outcome of the measurement) and a quantum output (the state of the system conditional on the observation of some outcome, i.e., the post-measurement state ) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
3 Quantum Measurement Processes an operation transforming a quantum input (the density operator representing the state of the system before the measurement, i.e., the pre-measurement state ) into a classical output (the outcome of the measurement) and a quantum output (the state of the system conditional on the observation of some outcome, i.e., the post-measurement state ) mathematically, a measurement process is represented by a completely positive instrument (Ozawa, 1984), namely, a family M = {E m : m M } of completely positive maps E m, indexed by the outcome set M = {m}, and such that m trace-preserving (completeness relation) Em is Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
4 Quantum Measurement Processes an operation transforming a quantum input (the density operator representing the state of the system before the measurement, i.e., the pre-measurement state ) into a classical output (the outcome of the measurement) and a quantum output (the state of the system conditional on the observation of some outcome, i.e., the post-measurement state ) mathematically, a measurement process is represented by a completely positive instrument (Ozawa, 1984), namely, a family M = {E m : m M } of completely positive maps E m, indexed by the outcome set M = {m}, and such that m trace-preserving (completeness relation) upon input ρ, the outcome m is obtained with probability p(m) = Tr[E m(ρ)] and the corresponding post-measurement state is σ m = E m(ρ)/p(m) Em is Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
5 Measurement Reversibility information extraction requires measurement, but measurements occur by interaction with a probe, and interactions cause disturbance = information disturbance tradeoff in quantum measurements Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
6 Measurement Reversibility information extraction requires measurement, but measurements occur by interaction with a probe, and interactions cause disturbance = information disturbance tradeoff in quantum measurements the intuition is clear, less so the mathematical formulation (state dependent/independent, figures of merit, average/single-outcome, with/without feedback, etc); in particular, are measurements always irreversible? Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
7 Measurement Reversibility information extraction requires measurement, but measurements occur by interaction with a probe, and interactions cause disturbance = information disturbance tradeoff in quantum measurements the intuition is clear, less so the mathematical formulation (state dependent/independent, figures of merit, average/single-outcome, with/without feedback, etc); in particular, are measurements always irreversible? correction scheme: where {C m : m M } is a family of error-correcting CPTP maps (independent of ρ) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
8 Measurement Reversibility information extraction requires measurement, but measurements occur by interaction with a probe, and interactions cause disturbance = information disturbance tradeoff in quantum measurements the intuition is clear, less so the mathematical formulation (state dependent/independent, figures of merit, average/single-outcome, with/without feedback, etc); in particular, are measurements always irreversible? correction scheme: where {C m : m M } is a family of error-correcting CPTP maps (independent of ρ) average disturbance: distance between ρ and ρ = m p(m) ρm = m (Cm Em)(ρ) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
9 Measurement Reversibility information extraction requires measurement, but measurements occur by interaction with a probe, and interactions cause disturbance = information disturbance tradeoff in quantum measurements the intuition is clear, less so the mathematical formulation (state dependent/independent, figures of merit, average/single-outcome, with/without feedback, etc); in particular, are measurements always irreversible? correction scheme: where {C m : m M } is a family of error-correcting CPTP maps (independent of ρ) average disturbance: distance between ρ and ρ = m p(m) ρm = m (Cm Em)(ρ) Fact. Among all measurements with the same outcome statistics, efficient measurements (i.e., E m( ) = E m E m) are the least disturbing one: we will hence focus on these only Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
10 Information Gain in Efficient Quantum Measurements let H(M) be the Shannon entropy of the outcome distribution: is this amount all information? Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
11 Information Gain in Efficient Quantum Measurements let H(M) be the Shannon entropy of the outcome distribution: is this amount all information? the Groenewold-Lindblad-Ozawa information gain is defined as the average entropy decrease due to measurement: I G(ρ, M) H(ρ) m p(m)h(σm) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
12 Information Gain in Efficient Quantum Measurements let H(M) be the Shannon entropy of the outcome distribution: is this amount all information? the Groenewold-Lindblad-Ozawa information gain is defined as the average entropy decrease due to measurement: I G(ρ, M) H(ρ) m p(m)h(σm) for efficient measurements (i.e., σ m E mρe m), I G(ρ, M) is always non-negative and equals the optimal rate of measurement compression: minimum rate at which classical information needs to be sent in order to communicate the measurement outcome to a receiver (Winter, 2004) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
13 Information Gain in Efficient Quantum Measurements let H(M) be the Shannon entropy of the outcome distribution: is this amount all information? the Groenewold-Lindblad-Ozawa information gain is defined as the average entropy decrease due to measurement: I G(ρ, M) H(ρ) m p(m)h(σm) for efficient measurements (i.e., σ m E mρe m), I G(ρ, M) is always non-negative and equals the optimal rate of measurement compression: minimum rate at which classical information needs to be sent in order to communicate the measurement outcome to a receiver (Winter, 2004) I G(ρ, M) quantifies intrinsic/useful data; the difference H(M) I G(ρ, M) quantifies extrinsic/useless data Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
14 Information Gain in Efficient Quantum Measurements let H(M) be the Shannon entropy of the outcome distribution: is this amount all information? the Groenewold-Lindblad-Ozawa information gain is defined as the average entropy decrease due to measurement: I G(ρ, M) H(ρ) m p(m)h(σm) for efficient measurements (i.e., σ m E mρe m), I G(ρ, M) is always non-negative and equals the optimal rate of measurement compression: minimum rate at which classical information needs to be sent in order to communicate the measurement outcome to a receiver (Winter, 2004) I G(ρ, M) quantifies intrinsic/useful data; the difference H(M) I G(ρ, M) quantifies extrinsic/useless data tempting analogy with work and heat in thermodynamics Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
15 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
16 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Proof. 1 Φ is CPTP subunital map Φ is CP trace-non-increasing unital map Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
17 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Proof. 1 Φ is CPTP subunital map Φ is CP trace-non-increasing unital map 2 H[Φ(ρ)] H(ρ) = Tr[ρ log ρ] Tr[Φ(ρ) log Φ(ρ)] = Tr[ρ log ρ] Tr [ ρ Φ (log Φ(ρ)) ] Tr[ρ log ρ] Tr [ ρ log{(φ Φ)(ρ)} ] = D[ρ (Φ Φ)(ρ)], where inequality follows from operator concavity of the logarithm and the operator Jensen inequality for positive unital maps Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
18 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Proof. 1 Φ is CPTP subunital map Φ is CP trace-non-increasing unital map 2 H[Φ(ρ)] H(ρ) = Tr[ρ log ρ] Tr[Φ(ρ) log Φ(ρ)] = Tr[ρ log ρ] Tr [ ρ Φ (log Φ(ρ)) ] Tr[ρ log ρ] Tr [ ρ log{(φ Φ)(ρ)} ] = D[ρ (Φ Φ)(ρ)], where inequality follows from operator concavity of the logarithm and the operator Jensen inequality for positive unital maps 3 Ψ( ) Φ ( ) + Tr [ (id Φ )( ) ] ω, where ω is arbitrary but fixed density operator Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
19 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Proof. 1 Φ is CPTP subunital map Φ is CP trace-non-increasing unital map 2 H[Φ(ρ)] H(ρ) = Tr[ρ log ρ] Tr[Φ(ρ) log Φ(ρ)] = Tr[ρ log ρ] Tr [ ρ Φ (log Φ(ρ)) ] Tr[ρ log ρ] Tr [ ρ log{(φ Φ)(ρ)} ] = D[ρ (Φ Φ)(ρ)], where inequality follows from operator concavity of the logarithm and the operator Jensen inequality for positive unital maps 3 Ψ( ) Φ ( ) + Tr [ (id Φ )( ) ] ω, where ω is arbitrary but fixed density operator 4 since Ψ( ) Φ ( ), it follows that D[ρ (Φ Φ)(ρ)] D[ρ (Ψ Φ)(ρ)] Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
20 The Technical Lemma Theorem Let Φ be a subunital (i.e., Φ(I) I) CPTP map. Then there exists a CPTP map Ψ such that, for any ρ, H[Φ(ρ)] H(ρ) D[ρ (Ψ Φ)(ρ)]. Proof. 1 Φ is CPTP subunital map Φ is CP trace-non-increasing unital map 2 H[Φ(ρ)] H(ρ) = Tr[ρ log ρ] Tr[Φ(ρ) log Φ(ρ)] = Tr[ρ log ρ] Tr [ ρ Φ (log Φ(ρ)) ] Tr[ρ log ρ] Tr [ ρ log{(φ Φ)(ρ)} ] = D[ρ (Φ Φ)(ρ)], where inequality follows from operator concavity of the logarithm and the operator Jensen inequality for positive unital maps 3 Ψ( ) Φ ( ) + Tr [ (id Φ )( ) ] ω, where ω is arbitrary but fixed density operator 4 since Ψ( ) Φ ( ), it follows that D[ρ (Φ Φ)(ρ)] D[ρ (Ψ Φ)(ρ)] Stronger than any other (currently known) recoverability results: 1 the lemma holds also for positive (not necessarily completely positive) Φ 2 the explicit form of correction Ψ is known 3 D(ρ σ) D M (ρ σ) log F (ρ, σ), where F (ρ, σ) ρ σ 2 1 Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
21 Application to Efficient Quantum Measurements given an efficient measurement process M = {E m}, construct the CPTP map M( ) = m Em E m m m Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
22 Application to Efficient Quantum Measurements given an efficient measurement process M = {E m}, construct the CPTP map M( ) = m Em E m m m then M(I) = m E 1E E me m 0 E 2E 2 0 m m = 0 0 E 3E Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
23 Application to Efficient Quantum Measurements given an efficient measurement process M = {E m}, construct the CPTP map M( ) = m Em E m m m then M(I) = m E 1E E me m 0 E 2E 2 0 m m = 0 0 E 3E m E me m = I = E me m I for all m = E me m I for all m = M(I) I I Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
24 Application to Efficient Quantum Measurements given an efficient measurement process M = {E m}, construct the CPTP map M( ) = m Em E m m m then M(I) = m E 1E E me m 0 E 2E 2 0 m m = 0 0 E 3E m E me m = I = E me m I for all m = E me m I for all m = M(I) I I in other words, the channel M is subunital and the Technical Lemma can be applied Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
25 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
26 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m the Technical Lemma implies that there exists a correction scheme {C m} such that H[M(ρ)] H(ρ) D[ρ m (Cm Em)(ρ)] for all ρ Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
27 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m the Technical Lemma implies that there exists a correction scheme {C m} such that H[M(ρ)] H(ρ) D[ρ m (Cm Em)(ρ)] for all ρ H[M(ρ)] H(ρ) = H(M) [H(ρ) m p(m)h(σm)] = H(M) IG(ρ, M) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
28 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m the Technical Lemma implies that there exists a correction scheme {C m} such that H[M(ρ)] H(ρ) D[ρ m (Cm Em)(ρ)] for all ρ H[M(ρ)] H(ρ) = H(M) [H(ρ) m p(m)h(σm)] = H(M) IG(ρ, M) Theorem (Strengthened Second Law for Efficient Quantum Measurements) Let M = {E m} be an efficient quantum measurement process. Then there exists a correction scheme {C m} such that ( ) H(M) I G(ρ, M) D ρ (C m E m)(ρ), for all ρ. m Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
29 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m the Technical Lemma implies that there exists a correction scheme {C m} such that H[M(ρ)] H(ρ) D[ρ m (Cm Em)(ρ)] for all ρ H[M(ρ)] H(ρ) = H(M) [H(ρ) m p(m)h(σm)] = H(M) IG(ρ, M) Theorem (Strengthened Second Law for Efficient Quantum Measurements) Let M = {E m} be an efficient quantum measurement process. Then there exists a correction scheme {C m} such that ( ) H(M) I G(ρ, M) D ρ (C m E m)(ρ), for all ρ. m hence, the extrinsic noise measures the irreversibility of efficient measurements (as does entropy for adiabatic processes) Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
30 Strengthened Second Law for Efficient Quantum Measurements recall the definition: M(ρ) = m EmρE m m m the Technical Lemma implies that there exists a correction scheme {C m} such that H[M(ρ)] H(ρ) D[ρ m (Cm Em)(ρ)] for all ρ H[M(ρ)] H(ρ) = H(M) [H(ρ) m p(m)h(σm)] = H(M) IG(ρ, M) Theorem (Strengthened Second Law for Efficient Quantum Measurements) Let M = {E m} be an efficient quantum measurement process. Then there exists a correction scheme {C m} such that ( ) H(M) I G(ρ, M) D ρ (C m E m)(ρ), for all ρ. m hence, the extrinsic noise measures the irreversibility of efficient measurements (as does entropy for adiabatic processes) indeed, in [K. Jacobs, PRA 80, (2009)] the inequality H(M) I G(ρ, M) 0 is interpreted as the second law for quantum measurements; the above Theorem considerably strengthens this Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
31 Thank You slides available for download at tinyurl.com/bdw-aqis16 Buscemi, Das, Wilde When Is a Measurement Reversible? 1 September / 8
Lecture 19 October 28, 2015
PHYS 7895: Quantum Information Theory Fall 2015 Prof. Mark M. Wilde Lecture 19 October 28, 2015 Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
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 informationSeparation between quantum Lovász number and entanglement-assisted zero-error classical capacity
Separation between quantum Lovász number and entanglement-assisted zero-error classical capacity Xin Wang QCIS, University of Technology Sydney (UTS) Joint work with Runyao Duan (UTS), arxiv: 1608.04508
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 informationMultivariate trace inequalities. David Sutter, Mario Berta, Marco Tomamichel
Multivariate trace inequalities David Sutter, Mario Berta, Marco Tomamichel What are trace inequalities and why we should care. Main difference between classical and quantum world are complementarity and
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 informationRecoverability in quantum information theory
Recoverability in quantum information theory Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State University,
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 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 informationStrong converse theorems using Rényi entropies
Strong converse theorems using Rényi entropies Felix Leditzky joint work with Mark M. Wilde and Nilanjana Datta arxiv:1506.02635 5 January 2016 Table of Contents 1 Weak vs. strong converse 2 Rényi entropies
More informationUniversal recoverability in quantum information theory
Universal recoverability in quantum information theory Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State
More informationF R A N C E S C O B U S C E M I ( N A G OYA U N I V E R S I T Y ) C O L L O Q U I U D E P T. A P P L I E D M AT H E M AT I C S H A N YA N G U N I
QUANTUM UNCERTAINT Y F R A N C E S C O B U S C E M I ( N A G OYA U N I V E R S I T Y ) C O L L O Q U I U M @ D E P T. A P P L I E D M AT H E M AT I C S H A N YA N G U N I V E R S I T Y ( E R I C A ) 2
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 informationMultivariate Trace Inequalities
Multivariate Trace Inequalities Mario Berta arxiv:1604.03023 with Sutter and Tomamichel (to appear in CMP) arxiv:1512.02615 with Fawzi and Tomamichel QMath13 - October 8, 2016 Mario Berta (Caltech) Multivariate
More informationStrong converse theorems using Rényi entropies
Strong converse theorems using Rényi entropies Felix Leditzky a, Mark M. Wilde b, and Nilanjana Datta a a Statistical Laboratory, Centre for Mathematical Sciences, University of Cambridge, Cambridge C3
More informationHow much entanglement is lost along a channel? TQC 2008, 30 Jan 2008
How much entanglement is lost along a channel? Francesco Buscemi, TQC 2008, 30 Jan 2008 Overview Review of some known results about approximate quantum error correction Generalization of the theory to
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 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 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 informationQuantum rate distortion, reverse Shannon theorems, and source-channel separation
Quantum rate distortion, reverse Shannon theorems, and source-channel separation ilanjana Datta, Min-Hsiu Hsieh, Mark Wilde (1) University of Cambridge,U.K. (2) McGill University, Montreal, Canada Classical
More informationOutput entropy of tensor products of random quantum channels 1
Output entropy of tensor products of random quantum channels 1 Motohisa Fukuda 1 [Collins, Fukuda and Nechita], [Collins, Fukuda and Nechita] 1 / 13 1 Introduction Aim and background Existence of one large
More informationA Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks Marco Tomamichel, Masahito Hayashi arxiv: 1208.1478 Also discussing results of: Second Order Asymptotics for Quantum
More informationTransmitting and Hiding Quantum Information
2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents
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 informationCS286.2 Lecture 13: Quantum de Finetti Theorems
CS86. Lecture 13: Quantum de Finetti Theorems Scribe: Thom Bohdanowicz Before stating a quantum de Finetti theorem for density operators, we should define permutation invariance for quantum states. Let
More informationDynamics and Quantum Channels
Dynamics and Quantum Channels Konstantin Riedl Simon Mack 1 Dynamics and evolutions Discussing dynamics, one has to talk about time. In contrast to most other quantities, time is being treated classically.
More informationEinselection without pointer states -
Einselection without pointer states Einselection without pointer states - Decoherence under weak interaction Christian Gogolin Universität Würzburg 2009-12-16 C. Gogolin Universität Würzburg 2009-12-16
More informationEntropic Formulation of Heisenberg s Measurement-Disturbance Relation
Entropic Formulation of Heisenberg s Measurement-Disturbance Relation arxiv:1311.7637 QPL 2014, Kyoto, 6. June 2014 Fabian Furrer Joint work with: Patrick Coles @ Different Uncertainty Trade-Offs Uncertainty
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 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 informationGerardo Adesso. Davide Girolami. Alessio Serafini. University of Nottingham. University of Nottingham. University College London
Gerardo Adesso University of Nottingham Davide Girolami University of Nottingham Alessio Serafini University College London arxiv:1203.5116; Phys. Rev. Lett. (in press) A family of useful additive entropies
More informationSingle-shot Quantum State Merging
ETH ZICH arxiv:0912.4495v1 [quant-ph] 22 Dec 2009 Single-shot Quantum State Merging by Mario Berta A Diploma thesis submitted to the Institute for Theorectical Physics Department of Physics Supervisor
More informationLecture 1: September 25, A quick reminder about random variables and convexity
Information and Coding Theory Autumn 207 Lecturer: Madhur Tulsiani Lecture : September 25, 207 Administrivia This course will cover some basic concepts in information and coding theory, and their applications
More informationQuantum Measurement Uncertainty
Quantum Measurement Uncertainty Reading Heisenberg s mind or invoking his spirit? Paul Busch Department of Mathematics Quantum Physics and Logic QPL 2015, Oxford, 13-17 July 2015 Paul Busch (York) Quantum
More informationA no-go theorem for theories that decohere to quantum mechanics
A no-go theorem for theories that decohere to quantum mechanics Ciarán M. Lee University College London Joint work with John H. Selby arxiv:1701.07449 Motivation The more important fundamental laws and
More informationarxiv:quant-ph/ v2 16 Jul 2006
One-mode quantum Gaussian channels arxiv:quant-ph/0607051v 16 Jul 006 A. S. Holevo July 6, 013 Abstract A classification of one-mode Gaussian channels is given up to canonical unitary equivalence. A complementary
More informationQuantum thermodynamics
Quantum thermodynamics a primer for the curious quantum mechanic Lídia del Rio, ETH Zurich QIP 2017 Seattle This talk is licensed under a Creative Commons Attribution 4.0 International License. Why quantum
More informationConcentration of Measure Effects in Quantum Information. Patrick Hayden (McGill University)
Concentration of Measure Effects in Quantum Information Patrick Hayden (McGill University) Overview Superdense coding Random states and random subspaces Superdense coding of quantum states Quantum mechanical
More informationQuantum Fisher Information. Shunlong Luo Beijing, Aug , 2006
Quantum Fisher Information Shunlong Luo luosl@amt.ac.cn Beijing, Aug. 10-12, 2006 Outline 1. Classical Fisher Information 2. Quantum Fisher Information, Logarithm 3. Quantum Fisher Information, Square
More informationarxiv: v2 [quant-ph] 17 Aug 2017
Absolutely separating quantum maps and channels arxiv:1703.00344v [quant-ph] 17 Aug 017 1. Introduction S N Filippov 1,, K Yu Magadov 1 and M A Jivulescu 3 1 Moscow Institute of Physics and Technology,
More informationMax-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig
Max-Planc-Institut für Mathemati in den Naturwissenschaften Leipzig Uncertainty Relations Based on Sew Information with Quantum Memory by Zhi-Hao Ma, Zhi-Hua Chen, and Shao-Ming Fei Preprint no.: 4 207
More informationEntanglement Measures and Monotones Pt. 2
Entanglement Measures and Monotones Pt. 2 PHYS 500 - Southern Illinois University April 8, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones Pt. 2 April 8, 2017 1 / 13 Entanglement
More informationFree probability and quantum information
Free probability and quantum information Benoît Collins WPI-AIMR, Tohoku University & University of Ottawa Tokyo, Nov 8, 2013 Overview Overview Plan: 1. Quantum Information theory: the additivity problem
More informationQuantum error correction for continuously detected errors
Quantum error correction for continuously detected errors Charlene Ahn, Toyon Research Corporation Howard Wiseman, Griffith University Gerard Milburn, University of Queensland Quantum Information and Quantum
More informationAttempting to reverse the irreversible in quantum physics
Attempting to reverse the irreversible in quantum physics Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State
More informationLecture 11: Quantum Information III - Source Coding
CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that
More informationNullity of Measurement-induced Nonlocality. Yu Guo
Jul. 18-22, 2011, at Taiyuan. Nullity of Measurement-induced Nonlocality Yu Guo (Joint work with Pro. Jinchuan Hou) 1 1 27 Department of Mathematics Shanxi Datong University Datong, China guoyu3@yahoo.com.cn
More informationResearch Statement. Dr. Anna Vershynina. August 2017
annavershynina@gmail.com August 2017 My research interests lie in functional analysis and mathematical quantum physics. In particular, quantum spin systems, open quantum systems and quantum information
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 informationFidelity and Metrics of quantum states
Fidelity and Metrics of quantum states Zhi-Hao Ma, Fu-Lin Zhang, Jing-Ling Chen arxiv:08.3453v [quant-ph] ov 008 Abstract Fidelity plays an important role in quantum information theory. In this paper,
More informationQuantum Achievability Proof via Collision Relative Entropy
Quantum Achievability Proof via Collision Relative Entropy Salman Beigi Institute for Research in Fundamental Sciences (IPM) Tehran, Iran Setemper 8, 2014 Based on a joint work with Amin Gohari arxiv:1312.3822
More informationLecture 8: Shannon s Noise Models
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 8: Shannon s Noise Models September 14, 2007 Lecturer: Atri Rudra Scribe: Sandipan Kundu& Atri Rudra Till now we have
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 informationLecture 5 - Information theory
Lecture 5 - Information theory Jan Bouda FI MU May 18, 2012 Jan Bouda (FI MU) Lecture 5 - Information theory May 18, 2012 1 / 42 Part I Uncertainty and entropy Jan Bouda (FI MU) Lecture 5 - Information
More informationLecture 6: Further remarks on measurements and channels
CS 766/QIC 820 Theory of Quantum Information Fall 2011) Lecture 6: Further remarks on measurements and channels In this lecture we will discuss a few loosely connected topics relating to measurements and
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 informationarxiv: v4 [quant-ph] 27 Dec 2015
Quantifying channels output similarity with applications to quantum control Lukasz Pawela 1 and Zbigniew Pucha la 1,2 arxiv:1412.8694v4 [quant-ph] 27 Dec 2015 1 Institute of Theoretical and Applied Informatics,
More informationThe Kelvin-Planck statement of the second law
The Kelvin-Planck statement of the second law It is impossible for any device that operates on a cycle to receive heat from a single reservoir and produce a net amount of work Q W E =ΔE net net net, mass
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 information1 Quantum states and von Neumann entropy
Lecture 9: Quantum entropy maximization CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: February 15, 2016 1 Quantum states and von Neumann entropy Recall that S sym n n
More informationSteering and Entropic Uncertainty Relations
Steering and Entropic Uncertainty Relations Ana C. S. Costa, Roope Uola, Otfried Gühne Department of Physics, University of Siegen - Germany September 5, 2017 na C. S. Costa, Roope Uola, Otfried Gühne
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 informationClassical Verification of Quantum Computations
Classical Verification of Quantum Computations Urmila Mahadev UC Berkeley September 12, 2018 Classical versus Quantum Computers Can a classical computer verify a quantum computation? Classical output (decision
More informationInformation and Physics Landauer Principle and Beyond
Information and Physics Landauer Principle and Beyond Ryoichi Kawai Department of Physics University of Alabama at Birmingham Maxwell Demon Lerner, 975 Landauer principle Ralf Landauer (929-999) Computational
More informationSome applications of matrix inequalities in Rényi entropy
Some applications of matrix inequalities in Rényi entropy arxiv:608.03362v [math-ph] Aug 206 Hadi Reisizadeh, and S. Mahmoud Manjegani 2, Department of Electrical and Computer Engineering, 2 Department
More informationOn some special cases of the Entropy Photon-Number Inequality
On some special cases of the Entropy Photon-Number Inequality Smarajit Das, Naresh Sharma and Siddharth Muthukrishnan Tata Institute of Fundamental Research December 5, 2011 One of the aims of information
More informationShort proofs of the Quantum Substate Theorem
Short proofs of the Quantum Substate Theorem Rahul Jain CQT and NUS, Singapore Ashwin Nayak University of Waterloo Classic problem Given a biased coin c Pr(c = H) = 1 - e Pr(c = T) = e Can we generate
More informationShunlong Luo. Academy of Mathematics and Systems Science Chinese Academy of Sciences
Superadditivity of Fisher Information: Classical vs. Quantum Shunlong Luo Academy of Mathematics and Systems Science Chinese Academy of Sciences luosl@amt.ac.cn Information Geometry and its Applications
More informationQuantum rate distortion, reverse Shannon theorems, and source-channel separation
Quantum rate distortion, reverse Shannon theorems, and source-channel separation ilanjana Datta, Min-Hsiu Hsieh, and Mark M. Wilde arxiv:08.4940v3 [quant-ph] 9 Aug 202 Abstract We derive quantum counterparts
More informationQuantum Measurement Uncertainty
Quantum Measurement Uncertainty New Relations for Qubits Paul Busch Department of Mathematics Siegen, 9 July 2015 Paul Busch (York) Quantum Measurement Uncertainty 1 / 40 Peter Mittelstaedt 1929-2014 Paul
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 informationDistinguishing multi-partite states by local measurements
Distinguishing multi-partite states by local measurements arxiv[quant-ph]:1206.2884 Ecole Polytechnique Paris / University of Bristol Cécilia Lancien / Andreas Winter AQIS 12 August 24 th 2012 Cécilia
More informationOn Composite Quantum Hypothesis Testing
University of York 7 November 207 On Composite Quantum Hypothesis Testing Mario Berta Department of Computing with Fernando Brandão and Christoph Hirche arxiv:709.07268 Overview Introduction 2 Composite
More informationarxiv: v2 [quant-ph] 1 Oct 2017
Stochastic thermodynamics of quantum maps with and without equilibrium Felipe Barra and Cristóbal Lledó Departamento de Física, Facultad de Ciencias Físicas y Matemáticas, Universidad de Chile, Santiago,
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 informationQuantum 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 informationEntanglement of indistinguishable particles
Entanglement of indistinguishable particles Fabio Benatti Dipartimento di Fisica, Università di Trieste QISM Innsbruck -5 September 01 Outline 1 Introduction Entanglement: distinguishable vs identical
More information2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising
More informationLecture 4: Proof of Shannon s theorem and an explicit code
CSE 533: Error-Correcting Codes (Autumn 006 Lecture 4: Proof of Shannon s theorem and an explicit code October 11, 006 Lecturer: Venkatesan Guruswami Scribe: Atri Rudra 1 Overview Last lecture we stated
More informationChapter 5. Density matrix formalism
Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature
More informationProof Calculus for Partial Correctness
Proof Calculus for Partial Correctness Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 7, 2016 Bow-Yaw Wang (Academia Sinica) Proof Calculus for Partial Correctness September
More informationConverse bounds for private communication over quantum channels
Converse bounds for private communication over quantum channels Mark M. Wilde (LSU) joint work with Mario Berta (Caltech) and Marco Tomamichel ( Univ. Sydney + Univ. of Technology, Sydney ) arxiv:1602.08898
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 informationarxiv: v2 [quant-ph] 17 Nov 2016
Improved Uncertainty Relation in the Presence of Quantum Memory Yunlong Xiao, 1, Naihuan Jing, 3,4 Shao-Ming Fei, 5, and Xianqing Li-Jost 1 School of Mathematics, South China University of Technology,
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 informationChapter 2: Source coding
Chapter 2: meghdadi@ensil.unilim.fr University of Limoges Chapter 2: Entropy of Markov Source Chapter 2: Entropy of Markov Source Markov model for information sources Given the present, the future is independent
More informationLecture 13: Lower Bounds using the Adversary Method. 2 The Super-Basic Adversary Method [Amb02]
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 13: Lower Bounds using the Adversary Method October 1, 015 Lecturer: Ryan O Donnell Scribe: Kumail Jaffer 1 Introduction There are a number of known
More informationHolographic entanglement entropy
Holographic entanglement entropy Mohsen Alishahiha School of physics, Institute for Research in Fundamental Sciences (IPM) 21th Spring Physics Conference, 1393 1 Plan of the talk Entanglement entropy Holography
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 informationThe query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector
1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input
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 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 informationECE 4400:693 - Information Theory
ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 8: Differential Entropy Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Lecture 1 / 43 Outline 1 Review: Entropy of discrete RVs 2 Differential
More informationOn positive maps in quantum information.
On positive maps in quantum information. Wladyslaw Adam Majewski Instytut Fizyki Teoretycznej i Astrofizyki, UG ul. Wita Stwosza 57, 80-952 Gdańsk, Poland e-mail: fizwam@univ.gda.pl IFTiA Gdańsk University
More informationHomework 3 - Solutions
Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator
More informationDistance between physical theories based on information theory
Distance between physical theories based on information theory Jacques Calmet 1 and Xavier Calmet 2 Institute for Cryptography and Security (IKS) Karlsruhe Institute of Technology (KIT), 76131 Karlsruhe,
More informationModeling and Analysis of Dynamic Systems
Modeling and Analysis of Dynamic Systems Dr. Guillaume Ducard Fall 2017 Institute for Dynamic Systems and Control ETH Zurich, Switzerland G. Ducard c 1 / 34 Outline 1 Lecture 7: Recall on Thermodynamics
More informationEfficient achievability for quantum protocols using decoupling theorems
Efficient achievability for quantum protocols using decoupling theorems Christoph Hirche and Ciara Morgan Institut für Theoretische Physik Leibniz Universität Hannover Appelstraße, D-3067 Hannover, Germany
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 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 information