Pseudo-random unitary operators for quantum information processing

DOI10.1126/SCIENCE.1090790MaRDI QIDQ3101377zbMATH OpenOpenAlexWikidataFDO

Authors Joseph Emerson, Yaakov S. Weinstein, Seth Lloyd, M. Saraceno, David G. Cory

Publication date 28 November 2011

Published in Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0410087

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Abstract: Pseudo-random operators consist of sets of operators that exhibit many of the important statistical features of uniformly distributed random operators. Such pseudo-random sets of operators are most useful whey they may be parameterized and generated on a quantum processor in a way that requires exponentially fewer resources than direct implementation of the uniformly random set. Efficient pseudo-random operators can overcome the exponential cost of random operators required for quantum communication tasks such as super-dense coding of quantum states and approximately secure quantum data-hiding, and enable efficient stochastic methods for noise estimation on prototype quantum processors. This paper summarizes some recently published work demonstrating a random circuit method for the implementation of pseudo-random unitary operators on a quantum processor [Emerson et al., Science 302:2098 (Dec.~19, 2003)], and further elaborates the theory and applications of pseudo-random states and operators.

Recommendations

• Pseudorandom operators of the circular ensembles
• Entanglement generation of nearly random operators
• Direct dialling of Haar random unitary matrices
• Exploiting randomness in quantum information processing
• Quantum-cellular-automata pseudorandom maps

Cited in

(24)

• Self-protected quantum algorithms based on quantum state tomography
• Exploiting randomness in quantum information processing
• Chaos and complexity by design
• A cost-effective quantum protocol for secure multi-party multiplication
• Method for generating randomly perturbed density operators subject to different sets of constraints
• Exponential speedup in measuring out-of-time-ordered correlators and gate fidelity with a single bit of quantum information
• Transitions in entanglement complexity in random quantum circuits by measurements
• Pseudorandom operators of the circular ensembles
• Quantum-cellular-automata pseudorandom maps
• Local random quantum circuits: ensemble completely positive maps and swap algebras
• Randomized dynamical decoupling techniques for coherent quantum control
• Generic pure quantum states as steady states of quasi-local dissipative dynamics
• Probability density of quantum expectation values
• Entanglement generation of nearly random operators
• Local random quantum circuits are approximate polynomial-designs
• Generating a state t-design by diagonal quantum circuits
• Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
• Diagonal-unitary 2-design and their implementations by quantum circuits
• Complexity of chaos and quantum computation
• Mixing and localization in random time-periodic quantum circuits of Clifford unitaries
• The SWITCH test for discriminating quantum evolutions
• Quantum chaos, randomness and universal scaling of entanglement in various Krylov spaces
• Decoupling with random quantum circuits
• Aspects of generic entanglement

This page was built for publication: Pseudo-random unitary operators for quantum information processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101377)