Random Quantum Circuits are Approximate 2-designs
Top Cited Papers
- 17 July 2009
- journal article
- research article
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 291 (1) , 257-302
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Black holes as mirrors: quantum information in random subsystemsJournal of High Energy Physics, 2007
- Optimal two-qubit gate for generation of random bipartite entanglementPhysical Review A, 2007
- The emergence of typical entanglement in two-party random processesJournal of Physics A: Mathematical and Theoretical, 2007
- Evenly distributed unitaries: On the structure of unitary designsJournal of Mathematical Physics, 2007
- Generic Entanglement Can Be Generated EfficientlyPhysical Review Letters, 2007
- Mathematical Aspects of Mixing Times in Markov ChainsFoundations and Trends® in Theoretical Computer Science, 2006
- Convergence conditions for random quantum circuitsPhysical Review A, 2005
- Reexamination of optimal quantum state estimation of pure statesPhysical Review A, 2005
- Logarithmic Sobolev inequalities for finite Markov chainsThe Annals of Applied Probability, 1996
- Comparison Theorems for Reversible Markov ChainsThe Annals of Applied Probability, 1993