The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Entanglement and the power of one qubit
Open accessAbstract
The ``power of one qubit'' refers to a computational model that has access to only one pure bit of quantum information, along with $n$ qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is capable of performing some computational tasks exponentially faster than any known classical algorithm. One such task is to estimate with fixed accuracy the normalized trace of a unitary operator that can be implemented efficiently in a quantum circuit. We show that circuits of this type generally lead to entangled states, and we investigate the amount of entanglement possible in such circuits, as measured by the multiplicative negativity. We show that the multiplicative negativity is bounded by a constant, independent of $n$, for all bipartite divisions of the $n+1$ qubits, and so becomes, when $n$ is large, a vanishingly small fraction of the maximum possible multiplicative negativity for roughly equal divisions. This suggests that the global nature of entanglement is a more important resource for quantum computation than the magnitude of the entanglement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Separability Criterion for Density Matrices
Peres, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.1413 · Cited by 5,191
Computable measure of entanglement
Vidal, G., & Werner, R. F. (2002) · Physical Review A · doi:10.1103/physreva.65.032314 · Cited by 4,896
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
(1996) · Cited by 2,280
A Course in Functional Analysis.
Gamelin, T. W., & Conway, J. B. (1986) · The American Mathematical Monthly · doi:10.2307/2322311 · Cited by 2,267
A Course in Functional Analysis
Conway, J. B. (1985) · Graduate texts in mathematics · doi:10.1007/978-1-4757-3828-5 · Cited by 1,910
Power of One Bit of Quantum Information
Knill, E., & Laflamme, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5672 · Cited by 884
On 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
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-citationSeparability and Distillability of Multiparticle Quantum Systems
Dür, W., Cirac, J. I., & Tarrach, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.3562 · Cited by 279
Pseudo-Random Unitary Operators for Quantum Information Processing
Emerson, J., Weinstein, Y. S., Saraceno, M., Lloyd, S., & Cory, D. G. (2003) · Science · doi:10.1126/science.1090790 · Cited by 233
Convex-roof extended negativity as an entanglement measure for bipartite quantum systems
Lee, S., Chi, D. P., Oh, S. D., & Kim, J. (2003) · Physical Review A · doi:10.1103/physreva.68.062304 · Cited by 183
Jones, J. A. (2001) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/s0079-6565(00)00033-9 · Cited by 177
Entangling power of the quantum baker s map
Scott, A. J., & Caves, C. M. (2003) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/36/36/308 · Cited by 135
Self-citationComposed ensembles of random unitary matrices
Pozniak, M., Zyczkowski, K., & Kus, M. (1998) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/31/3/016 · Cited by 128
Separable balls around the maximally mixed multipartite quantum states
Gurvits, L., & Barnum, H. (2003) · Physical Review A · doi:10.1103/physreva.68.042312 · Cited by 99
Entangling power of the quantum baker's map
Scott, A. J., & Caves, C. M. (2003) · CERN Document Server (European Organization for Nuclear Research) · Cited by 83
Self-citationQuantum computing and polynomial equations over Z_2
Dawson, C. M., Haselgrove, H. L., Hines, A. P., Mortimer, D., Nielsen, M. A., & Osborne, T. J. (2005) · Quantum Information and Computation · doi:10.26421/qic5.2-2 · Cited by 81
Exponential Speedup with a Single Bit of Quantum Information: Measuring the Average Fidelity Decay
Poulin, D., Blume-Kohout, R., Laflamme, R., & Ollivier, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.177906 · Cited by 79
NMR quantum information processing and entanglement
Laflamme, R., Cory, D. G., Negrevergne, C., & Viola, L. (2002) · Quantum Information and Computation · doi:10.26421/qic2.2-5 · Cited by 70
Remarks on the Atiyah-Hitchin Metric
Bakas, I. (2000) · Fortschritte der Physik · Cited by 60
Better bound on the exponent of the radius of the multipartite separable ball
Gurvits, L., & Barnum, H. (2005) · Physical Review A · doi:10.1103/physreva.72.032322 · Cited by 44
Quantum computing and polynomial equations over the finite field Z_2Preprint
Dawson, C. M., Haselgrove, H. L., Hines, A. P., et al. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0408129 · Cited by 44
Estimation of the local density of states on a quantum computer
Emerson, J., Lloyd, S., Poulin, D., & Cory, D. G. (2004) · Physical Review A · doi:10.1103/physreva.69.050305 · Cited by 18
The Physical Implementation of Quantum Computation
DiVincenzo, D. P. (2000) · Fortschritte der Physik · doi:10.1002/1521-3978(200009)48:9/11<771::aid-prop771>3.0.co;2-e
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Colloquium: Quantum coherence as a resource
Streltsov, A., Adesso, G., & Plenio, M. B. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.041003 · Cited by 1,794
The classical-quantum boundary for correlations: Discord and related measures
Modi, K., Brodutch, A., Cable, H., Paterek, T., & Vedral, V. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.1655 · Cited by 1,600
Quantum Discord and the Power of One Qubit
Datta, A., Shaji, A., & Caves, C. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.050502 · Cited by 1,258
Self-citationNecessary and Sufficient Condition for Nonzero Quantum Discord
Dakić, B., Vedral, V., & Brukner, Č. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.190502 · Cited by 1,203
Metadata
- Authors
- Datta, A., Flammia, S. T., & Caves, C. M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2005-10-18
- Volume
- 72
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2060849535
- Cited by
- 371
- References
- 27
- FWCI
- 4.81
- 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
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.