Catalytic Quantum Randomness

Randomness is a defining element of mixing processes in nature and an essential ingredient to many protocols in quantum information. In this work, we investigate how much randomness is required to transform a given quantum state into another one. Specifically, we ask whether there is a gap between the power of a classical source of randomness compared to that of a quantum one. We provide a complete answer to these questions, by identifying provably optimal protocols for both classical and quantum sources of randomness, based on a dephasing construction. We find that in order to implement any noisy transition on a $d$-dimensional quantum system it is necessary and sufficient to have a quantum source of randomness of dimension $\sqrt{d}$ or a classical one of dimension $d$. Interestingly, coherences provided by quantum states in a source of randomness offer a quadratic advantage. The process we construct has the additional features to be robust and catalytic, i.e., the source of randomness can be re-used. Building upon this formal framework, we illustrate that this dephasing construction can serve as a useful primitive in both equilibration and quantum information theory: We discuss applications describing the smallest measurement device, capturing the smallest equilibrating environment allowed by quantum mechanics, or forming the basis for a cryptographic private quantum channel. We complement the exact analysis with a discussion of approximate protocols based on quantum expanders deriving from discrete Weyl systems. This gives rise to equilibrating environments of remarkably small dimension. Our results highlight the curious feature of randomness that residual correlations and dimension can be traded against each other.

[1]  R. Werner All teleportation and dense coding schemes , 2000, quant-ph/0003070.

[2]  Andris Ambainis,et al.  Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption , 2004, APPROX-RANDOM.

[3]  Vedral,et al.  Local distinguishability of multipartite orthogonal quantum states , 2000, Physical review letters.

[4]  A. Winter,et al.  Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.

[5]  Andris Ambainis,et al.  Private quantum channels , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Aram Wettroth Harrow,et al.  Quantum expanders from any classical Cayley graph expander , 2007, Quantum Inf. Comput..

[7]  Debbie W. Leung,et al.  Quantum vernam cipher , 2000, Quantum Inf. Comput..

[8]  W. Zurek Decoherence, einselection, and the quantum origins of the classical , 2001, quant-ph/0105127.

[9]  Jens Eisert,et al.  Quantum margulis expanders , 2007, Quantum Inf. Comput..

[10]  V. Roychowdhury,et al.  Optimal encryption of quantum bits , 2000, quant-ph/0003059.

[11]  J. Schwinger UNITARY OPERATOR BASES. , 1960, Proceedings of the National Academy of Sciences of the United States of America.

[12]  M. Plenio,et al.  MINIMAL CONDITIONS FOR LOCAL PURE-STATE ENTANGLEMENT MANIPULATION , 1999, quant-ph/9903054.

[13]  Nicole Yunger Halpern,et al.  The resource theory of informational nonequilibrium in thermodynamics , 2013, 1309.6586.

[14]  Debbie W. Leung,et al.  The Universal Composable Security of Quantum Message Authentication with Key Recyling , 2016, 1610.09434.

[15]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[16]  J. Eisert,et al.  Limits to catalysis in quantum thermodynamics , 2014, 1405.3039.

[17]  A. J. Short,et al.  Quantum mechanical evolution towards thermal equilibrium. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Charles H. Bennett,et al.  Mixed-state entanglement and quantum error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[19]  Markus P. Mueller,et al.  Quantum Horn's lemma, finite heat baths, and the third law of thermodynamics , 2016, 1605.06092.

[20]  Eisert,et al.  Catalysis of entanglement manipulation for mixed states , 2000, Physical review letters.

[21]  Andris Ambainis,et al.  Nonmalleable encryption of quantum information , 2008, 0808.0353.

[22]  M. Plenio,et al.  Entanglement-Assisted Local Manipulation of Pure Quantum States , 1999, quant-ph/9905071.

[23]  Christopher Portmann,et al.  Quantum Authentication with Key Recycling , 2016, EUROCRYPT.

[24]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[25]  D. Gross Hudson's theorem for finite-dimensional quantum systems , 2006, quant-ph/0602001.

[26]  M. B. Hastings,et al.  Random unitaries give quantum expanders , 2007, 0706.0556.

[27]  Gilles Brassard,et al.  Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP , 2014, Natural Computing.

[28]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[29]  D. Gross,et al.  Evenly distributed unitaries: On the structure of unitary designs , 2006, quant-ph/0611002.

[30]  Serge Fehr,et al.  Quantum Authentication and Encryption with Key Recycling , 2016, IACR Cryptol. ePrint Arch..

[31]  A. Holevo Statistical structure of quantum theory , 2001 .

[32]  A. Horn Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix , 1954 .

[33]  Markus P. Mueller Correlating Thermal Machines and the Second Law at the Nanoscale , 2017, Physical Review X.

[34]  Michal Horodecki,et al.  How to reuse a one-time pad and other notes on authentication encryption and protection of quantum information , 2003, ArXiv.

[35]  Ivan Damgård,et al.  A Quantum Cipher with Near Optimal Key-Recycling , 2005 .

[36]  Jens Eisert,et al.  Equilibration, thermalisation, and the emergence of statistical mechanics in closed quantum systems , 2015, Reports on progress in physics. Physical Society.

[37]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.