Good Dynamics versus Bad Kinematics: Is Entanglement Needed for Quantum Computation?
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We study the role of entanglement in quantum computation. We consider the case of a pure state contaminated by "white noise." This framework arises, for example, in pseudopure state implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with polynomial resources and ask whether or not entanglement of the pseudopure states is needed to achieve this aim. We show that, for a large class of such protocols, including Shor's factorization, entanglement is necessary. We also show that achieving entanglement is not sufficient: If the state is sufficiently noisy, exponential resources are needed even if entanglement is present.
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
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Ensemble quantum computing by NMR spectroscopy
Cory, D. G., Fahmy, A. F., & Havel, T. F. (1997) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.94.5.1634 · Cited by 964
Separability of Very Noisy Mixed States and Implications for NMR Quantum Computing
Braunstein, S. L., Caves, C. M., Jozsa, R., Linden, N., Popescu, S., & Schack, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1054 · Cited by 566
Self-citationBulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316
Classical model for bulk-ensemble NMR quantum computation
Schack, R., & Caves, C. M. (1999) · Physical Review A · doi:10.1103/physreva.60.4354 · Cited by 76
Cited by
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
“Unfortunately, the state of the quantum register (molecules) can only be poorly initialized (except in special cases (Jones, 2000)), making the scaling properties of NMR quantum computation not very promising (Warren, 1997; Jones, 2000; Linden and Popescu, 2001).”
BackgroundOn the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839
Self-citation
Metadata
- Authors
- Linden, N., & Popescu, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-10
- Volume
- 87
- Issue
- 4
- Pages
- 047901-047901
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2092698230
- Cited by
- 113
- References
- 6
- FWCI
- 8.26
- 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: Good Dynamics versus Bad Kinematics: Is Entanglement Needed for Quantum Computation? https://app.cochat.ai/papers/10.1103/physrevlett.87.047901
- The paper
- Linden, N., & Popescu, S. (2001). Good Dynamics versus Bad Kinematics: Is Entanglement Needed for Quantum Computation? Physical Review Letters. https://doi.org/10.1103/physrevlett.87.047901
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.