The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Power of One Bit of Quantum Information
Open accessAbstract
In standard quantum computation, the initial state is pure and the answer is determined by making a measurement of some of the bits in the computational basis. What can be accomplished if the initial state is a highly mixed state and the answer is determined by measuring the expectation of ${\ensuremath{\sigma}}_{z}$ on the first bit with bounded sensitivity? This is the situation in high temperature ensemble quantum computation. We show that in this model it is possible to perform interesting physics simulations that have no known efficient classical algorithms, even though the model is less powerful than standard quantum computation in the presence of oracles.
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
Polynomial-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
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Brucker, P. (1995) · Scheduling Algorithms · doi:10.1007/978-3-662-03088-2_3 · Cited by 2,289
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Encyclopedia of nuclear magnetic resonance
(2003) · TrAC Trends in Analytical Chemistry · doi:10.1016/s0165-9936(03)00914-2 · Cited by 1,656
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Cited by
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Self-citationEfficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
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
Necessary 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
The role of quantum information in thermodynamics—a topical review
Goold, J., Huber, M., Riera, A., Rio, L. D., & Skrzypczyk, P. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/14/143001 · Cited by 918
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Experimental Quantum Computing without Entanglement
Lanyon, B. P., Barbieri, M., Almeida, M. P., & White, A. G. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.200501 · Cited by 874
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
Boson Sampling on a Photonic Chip
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837
Extracting Work from a Single Heat Bath via Vanishing Quantum Coherence
Scully, M. O., Zubairy, M. S., Agarwal, G. S., & Walther, H. (2003) · Science · doi:10.1126/science.1078955 · Cited by 748
Tillmann, M., Dakić, B., Heilmann, R., Nolte, S., Szameit, A., & Walther, P. (2013) · Nature Photonics · doi:10.1038/nphoton.2013.102 · Cited by 709
Using measurement-induced disturbance to characterize correlations as classical or quantum
Luo, S. (2008) · Physical Review A · doi:10.1103/physreva.77.022301 · Cited by 667
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
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
Robustness of quantum discord to sudden death
Werlang, T., Souza, S., Fanchini, F. F., & Villas Boas, C. J. (2009) · Physical Review A · doi:10.1103/physreva.80.024103 · Cited by 545
Characterizing Nonclassical Correlations via Local Quantum Uncertainty
Girolami, D., Tufarelli, T., & Adesso, G. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.240402 · Cited by 513
Almost all quantum states have nonclassical correlations
Ferraro, A., Aolita, L., Cavalcanti, D., Cucchietti, F. M., & Acín, A. (2010) · Physical Review A · doi:10.1103/physreva.81.052318 · Cited by 513
Quantum generative adversarial networks
Dallaire-Demers, P.-L., & Killoran, N. (2018) · Physical Review A · doi:10.1103/physreva.98.012324 · Cited by 506
Quantum discord as resource for remote state preparation
Dakić, B., Lipp, Y. O., Ma, X., Ringbauer, M., Kropatschek, S., Barz, S., Paterek, T., Vedral, V., Zeilinger, A., Brukner, Č., et al. (2012) · Nature Physics · doi:10.1038/nphys2377 · Cited by 462
Quantum-enhanced measurements without entanglement
Braun, D., Adesso, G., Benatti, F., Floreanini, R., Marzolino, U., Mitchell, M. W., & Pirandola, S. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.035006 · Cited by 434
Direct Estimations of Linear and Nonlinear Functionals of a Quantum State
Ekert, A. K., Alves, C. M., Oi, D. K. L., Horodecki, M., Horodecki, P., & Kwek, L. C. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.217901 · Cited by 427
Converting Coherence to Quantum Correlations
Ma, J., Yadin, B., Girolami, D., Vedral, V., & Gu, M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.160407 · Cited by 408
Measures and applications of quantum correlations
Adesso, G., Bromley, T. R., & Cianciaruso, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/47/473001 · Cited by 385
Negative quasi-probability as a resource for quantum computation
Veitch, V., Ferrie, C., Gross, D., & Emerson, J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/113011 · Cited by 377
Entanglement and the power of one qubit
Datta, A., Flammia, S. T., & Caves, C. M. (2005) · Physical Review A · doi:10.1103/physreva.72.042316 · Cited by 371
Quantum-assisted quantum compiling
Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A. T., & Coles, P. J. (2019) · Quantum · doi:10.22331/q-2019-05-13-140 · Cited by 382
Quantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347
Self-citationMoore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Quantum discord of two-qubitXstates
Chen, Q., Zhang, C., Yu, S., Yi, X. X., & Oh, C. H. (2011) · Physical Review A · doi:10.1103/physreva.84.042313 · Cited by 300
Trading Classical and Quantum Computational Resources
Bravyi, S., Smith, G., & Smolin, J. A. (2016) · Physical Review X · doi:10.1103/physrevx.6.021043 · Cited by 299
Second law of quantum complexity
Brown, A. R., & Susskind, L. (2018) · Physical Review D · doi:10.1103/physrevd.97.086015 · Cited by 292
Non-Markovian effect on the quantum discord
Wang, B., Xu, Z.-Y., Chen, Z.-Q., & Feng, M. (2010) · Physical Review A · doi:10.1103/physreva.81.014101 · Cited by 290
Quantum coherence and geometric quantum discord
Hu, M.-L., Hu, X., Wang, J., Peng, Y., Zhang, Y.-R., & Fan, H. (2018) · Physics Reports · doi:10.1016/j.physrep.2018.07.004 · Cited by 289
Computing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
Linking Quantum Discord to Entanglement in a Measurement
Streltsov, A., Kampermann, H., & Bruß, D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.160401 · Cited by 282
Variational Quantum Linear Solver
Bravo-Prieto, C., LaRose, R., Cerezo, M., Subasi, Y., Cincio, L., & Coles, P. J. (2023) · Quantum · doi:10.22331/q-2023-11-22-1188 · Cited by 260
Role of entanglement and correlations in mixed-state quantum computation
Datta, A., & Vidal, G. (2007) · Physical Review A · doi:10.1103/physreva.75.042310 · Cited by 259
DYNAMICS OF QUANTUM CORRELATIONS IN TWO-QUBIT SYSTEMS WITHIN NON-MARKOVIAN ENVIRONMENTS
FRANCO, R. L., BELLOMO, B., MANISCALCO, S., & COMPAGNO, G. (2013) · International Journal of Modern Physics B · doi:10.1142/s0217979213450537 · Cited by 252
Behavior of Quantum Correlations under Local Noise
Streltsov, A., Kampermann, H., & Bruß, D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.170502 · Cited by 189
Jones, J. A. (2001) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/s0079-6565(00)00033-9 · Cited by 177
Quantum computation with universal error mitigation on a superconducting quantum processor
Song, C., Cui, J., Wang, H., Hao, J., Feng, H., & Li, Y. (2019) · Science Advances · doi:10.1126/sciadv.aaw5686 · Cited by 131
Efficient Factorization with a Single Pure Qubit andlogNMixed Qubits
Parker, S., & Plenio, M. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3049 · Cited by 130
Interpretation of tomography and spectroscopy as dual forms of quantum computation
Miquel, C., Paz, J. P., Saraceno, M., Knill, E., Laflamme, R., & Negrevergne, C. (2002) · Nature · doi:10.1038/nature00801 · Cited by 110
Self-citationEfficient quantum walk on a quantum processor
Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O’Brien, J. L., Wang, J. B., & Matthews, J. C. F. (2016) · Nature Communications · doi:10.1038/ncomms11511 · Cited by 108
Classical simulation of photonic linear optics with lost particles
Oszmaniec, M., & Brod, D. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aadfa8 · Cited by 89
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
On the Hardness of Distinguishing Mixed-State Quantum Computations
Rosgen, B., & Watrous, J. (2005) · 20th Annual IEEE Conference on Computational Complexity (CCC'05) · doi:10.1109/ccc.2005.21 · Cited by 70
Hardness of Classically Simulating the One-Clean-Qubit Model
Morimae, T., Fujii, K., & Fitzsimons, J. F. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.130502 · Cited by 70
Unitary quantum gates, perfect entanglers, and unistochastic maps
Musz, M., Kuś, M., & Życzkowski, K. (2013) · Physical Review A · doi:10.1103/physreva.87.022111 · Cited by 58
Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing
Menicucci, N. C., & Caves, C. M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.167901 · Cited by 43
Quantum algorithms for classical lattice models
De las Cuevas, G., Dür, W., Van den Nest, M., & Martin-Delgado, M. A. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/9/093021 · Cited by 40
The Classification of Reversible Bit Operations
Aaronson, S., Grier, D., & Schaeffer, L. (2015) · arXiv · doi:10.48550/arxiv.1504.05155 · Cited by 33
“(2)To clarify, there are many restricted models of quantum computing known that are plausibly “intermediate” in that sense, including BosonSampling [1], the one-clean-qubit model [15], and log-depth quantum circuits [8].”
BackgroundAlgorithm for the solution of the Dirac equation on digital quantum computers
Fillion-Gourdeau, F., MacLean, S., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.042343 · Cited by 33
Self-citationDallaire-Demers, P.-L., & Wilhelm, F. K. (2016) · Physical Review A · doi:10.1103/physreva.93.032303 · Cited by 31
Frozen Gaussian quantum discord in photonic crystal cavity array system
Lü, Y.-Q., An, J.-H., Chen, X.-M., Luo, H.-G., & Oh, C. H. (2013) · Physical Review A · doi:10.1103/physreva.88.012129 · Cited by 20
Noise-tolerant parity learning with one quantum bit
Park, D. K., Rhee, J.-K. K., & Lee, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032327 · Cited by 12
Metadata
- Authors
- Knill, E., & Laflamme, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1998-12-21
- Volume
- 81
- Issue
- 25
- Pages
- 5672-5675
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1770873769
- Cited by
- 884
- References
- 20
- FWCI
- 8.75
- 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.