Generic Entanglement Can Be Generated Efficiently
- 30 March 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 98 (13), 130502
- https://doi.org/10.1103/physrevlett.98.130502
Abstract
We find that generic entanglement is physical, in the sense that it can be generated in polynomial time from two-qubit gates picked at random. We prove as the main result that such a process generates the average entanglement of the uniform (unitarily invariant) measure in at most steps for qubits. This is despite an exponentially growing number of such gates being necessary for generating that measure fully on the state space. Numerics furthermore show a variation cutoff allowing one to associate a specific time with the achievement of the uniform measure entanglement distribution. Various extensions of this work are discussed. The results are relevant to entanglement theory and to protocols that assume generic entanglement can be achieved efficiently.
Keywords
Other Versions
This publication has 19 references indexed in Scilit:
- Typical entanglement of stabilizer statesPhysical Review A, 2006
- Security of Quantum Bit String Commitment Depends on the Information MeasurePhysical Review Letters, 2006
- Convergence conditions for random quantum circuitsPhysical Review A, 2005
- Entanglement on mixed stabilizer states: normal forms and reduction proceduresNew Journal of Physics, 2005
- Superdense Coding of Quantum StatesPhysical Review Letters, 2004
- Pseudo-Random Unitary Operators for Quantum Information ProcessingScience, 2003
- Proof of Page’s conjecture on the average entropy of a subsystemPhysical Review Letters, 1994
- Average entropy of a subsystemPhysical Review Letters, 1993
- Comparison Theorems for Reversible Markov ChainsThe Annals of Applied Probability, 1993
- Complexity as thermodynamic depthAnnals of Physics, 1988