The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Contextuality in measurement-based quantum computation
Open accessAbstract
We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a nonlinear Boolean function with a high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a superpolynomial speedup over the best-known classical algorithm, namely, the quantum algorithm that solves the ``discrete log'' problem.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Self-citationOn 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
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Persistent Entanglement in Arrays of Interacting Particles
Briegel, H. J., & Raussendorf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.910 · Cited by 1,950
Self-citationQuantum amplitude amplification and estimation
Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002) · Contemporary Mathematics · doi:10.1090/conm/305/05215 · Cited by 1,680
Bell’s Theorem, Quantum Theory and Conceptions of the Universe
(1989) · doi:10.1007/978-94-017-0849-4 · Cited by 1,632
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Cleve, R., Ekert, A., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,299
Hidden variables and the two theorems of John Bell
Mermin, N. D. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.803 · Cited by 1,078
Multiparty entanglement in graph states
Hein, M., Eisert, J., & Briegel, H. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062311 · Cited by 915
Application of Boolean algebra to switching circuit design and to error detection
Muller, D. E. (1954) · Transactions of the I.R.E. Professional Group on Electronic Computers · doi:10.1109/irepgelc.1954.6499441 · Cited by 668
Contextuality for preparations, transformations, and unsharp measurements
Spekkens, R. W. (2005) · Physical Review A · doi:10.1103/physreva.71.052108 · Cited by 630
Quantum Cryptography with 3-State Systems
Bechmann-Pasquinucci, H., & Peres, A. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3313 · Cited by 556
Two simple proofs of the Kochen-Specker theorem
Peres, A. (1991) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/24/4/003 · Cited by 420
The sheaf-theoretic structure of non-locality and contextuality
Abramsky, S., & Brandenburger, A. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/11/113036 · Cited by 419
Quantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406
State-independent experimental test of quantum contextuality
Kirchmair, G., Zähringer, F., Gerritsma, R., Kleinmann, M., Gühne, O., Cabello, A., Blatt, R., & Roos, C. F. (2009) · Nature · doi:10.1038/nature08172 · Cited by 384
Dawson, C. M., & Nielsen, M. A. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-6 · Cited by 288
Most Quantum States Are Too Entangled To Be Useful As Computational Resources
Gross, D., Flammia, S. T., & Eisert, J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.190501 · Cited by 284
Proc. 26th annual symposium on Foundations of computer science
Tarjan, R. E. (1985) · Cited by 267
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
Computational Power of Correlations
Anders, J., & Browne, D. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.050502 · Cited by 184
Quantum computation by measurement and quantum memory
Nielsen, M. A. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01803-0 · Cited by 150
Are Random Pure States Useful for Quantum Computation?
Bremner, M. J., Mora, C. E., & Winter, A. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.190502 · Cited by 146
Temporally unstructured quantum computation
Shepherd, D., & Bremner, M. J. (2009) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2008.0443 · Cited by 135
Proceedings of the 44th symposium on Theory of Computing
Karloff, H. J., & Pitassi, T. (2012) · Cited by 130
Universal Quantum Computation with Little Entanglement
den Nest, M. V. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.060504 · Cited by 127
Abramsky, S., & Hardy, L. (2012) · Physical Review A · doi:10.1103/physreva.85.062114 · Cited by 122
Some Open Problems in Quantum Information TheoryPreprint
Krueger, O., & Werner, R. F. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504166 · Cited by 96
Classical simulation versus universality in measurement-based quantum computation
Van den Nest, M., Dür, W., Vidal, G., & Briegel, H. J. (2007) · Physical Review A · doi:10.1103/physreva.75.012337 · Cited by 95
Quantum code words contradict local realism
Divincenzo, D. P., & Peres, A. (1997) · Physical Review A · doi:10.1103/physreva.55.4089 · Cited by 85
QUANTUM COMPUTATION BY MEASUREMENTS
LEUNG, D. W. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000055 · Cited by 85
Computational model underlying the one-way quantum computer
Raussendorf, R., & Briegel, H. J. (2002) · doi:10.5555/2011492.2011495 · Cited by 82
Self-citationAccuracy threshold for quantum computation
Knill, E. H., Zurek, W. H., & Laflamme, R. (1996) · Cited by 74
Computational model underlying the one-way quantum computer
Raussendorf, R., & Briegel, H. (2002) · Quantum Information and Computation · doi:10.26421/qic2.6-3 · Cited by 56
Self-citationChen, X., Chung, H., Cross, A. W., Zeng, B., & Chuang, I. L. (2008) · Physical Review A · doi:10.1103/physreva.78.012353 · Cited by 52
Ji, Z., Chen, J.-X., Wei, Z., & Ying, M. (2010) · Quantum Information and Computation · doi:10.26421/qic10.1-2-8 · Cited by 46
A new way to obtain Bell inequalities
Hardy, L. (1991) · Physics Letters A · doi:10.1016/0375-9601(91)90537-i · Cited by 38
A simple proof of the Kochen-Specker theorem
Cabello, A. (1994) · European Journal of Physics · doi:10.1088/0143-0807/15/4/004 · Cited by 28
Rudolph, T., & Virmani, S. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/228 · Cited by 21
Stronger Quantum Correlations with Loophole-Free Postselection
Hoban, M. J., & Browne, D. E. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.120402 · Cited by 20
Permutational Quantum ComputingPreprint
Jordan, S. P. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.2508 · Cited by 8
Exponential quantum enhancement for distributed addition with local nonlinearity
Marblestone, A. H., & Devoret, M. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0126-9 · Cited by 3
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
Quantum Theory: Informational Foundations and Foils
(2016) · Fundamental Theories of Physics · doi:10.1007/978-94-017-7303-4 · Cited by 178
Sustained State-Independent Quantum Contextual Correlations from a Single Ion
Leupold, F. M., Malinowski, M., Zhang, C., Negnevitsky, V., Alonso, J., Home, J. P., & Cabello, A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.180401 · Cited by 60
Metadata
- Authors
- Raussendorf, R.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2013-08-19
- Volume
- 88
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1966003503
- Cited by
- 252
- References
- 50
- FWCI
- 12.15
- 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.