Quantum to classical phase transition in noisy quantum computers
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
The fundamental problem of the transition from quantum to classical physics is usually explained by decoherence, and viewed as a gradual process. The study of entanglement, or quantum correlations, in noisy quantum computers implies that in some cases the transition from quantum to classical is actually a phase transition. We define the notion of entanglement length in d-dimensional noisy quantum computers, and show that a phase transition in entanglement occurs at a critical noise rate where the entanglement length transforms from infinite to finite. Above the critical noise rate, macroscopic classical behavior is expected, whereas, below the critical noise rate, subsystems that are macroscopically distant one from another can be entangled. The macroscopic classical behavior in the supercritical phase is shown to hold not only for quantum computers but for any quantum system composed of macroscopically many finite state particles, with local interactions and local decoherence, subjected to some additional conditions. This phenomenon provides a possible explanation for the emergence of classical behavior in such systems. A simple formula for an upper bound on the entanglement length of any such system in the supercritical phase is given, and in principle can be tested experimentally.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252 · cited 1×
“The remarkable phenomena which can be exhibited due to entanglement between two quantum systems were first discovered by Einstein, Podolski and Rosen[11], more than 60 years ago, and manifested in Bell’s inequality more than 30 years ago[ 4 , 5]. However, the elusive phenomena of entanglement is still far from being u…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
On the Problem of Hidden Variables in Quantum Mechanics
BELL, J. S. (1966) · Reviews of Modern Physics · doi:10.1103/revmodphys.38.447 · Cited by 2,845
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Mixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?
Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5239 · Cited by 1,208
Quantum computers and dissipation
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0029 · Cited by 899 · cited 1×
“This corresponds to the process in which the off diagonal terms in the density matrix of one particle decay by some factor between two interactions[21].”
BackgroundFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Self-citationPolynomial simulations of decohered quantum computers
Aharonov, D., & Ben-Or, M. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548463 · Cited by 41 · cited 4×
“Another motivation for this question is provided by [2], where the sizes of the clusters is analyzed relaxing the assumptions of nearest neighbor interactions.”
BackgroundMethodInfluentialSelf-citation
Cited by
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
Measurement-Induced Phase Transitions in the Dynamics of Entanglement
Skinner, B., Ruhman, J., & Nahum, A. (2019) · Physical Review X · doi:10.1103/physrevx.9.031009 · Cited by 736
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Self-citationEntanglement versus Correlations in Spin Systems
Verstraete, F., Popp, M., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.027901 · Cited by 463
Fisher, M. P. A., Khemani, V., Nahum, A., & Vijay, S. (2023) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031720-030658 · Cited by 456
Metadata
- Authors
- Aharonov, D.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-11-14
- Volume
- 62
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1973606897
- Cited by
- 109
- References
- 10
- FWCI
- 2.61
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum to classical phase transition in noisy quantum computers. https://app.cochat.ai/papers/10.1103/physreva.62.062311
- The paper
- Aharonov, D. (2000). Quantum to classical phase transition in noisy quantum computers. Physical Review A. https://doi.org/10.1103/physreva.62.062311
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.