Measurement-Based Quantum Computation and Undecidable Logic
Open accessThe 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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Additional connections between MQC and other fields have been established, for example to decidability of formal languages in mathematical logic.
“Finally, we mention that additional connections between MQC and other fields have been established, e.g. to decidability of formal languages in mathematical logic 103 .”
From Measurement-based quantum computation (2009) · cites this paper as [103]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
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 · see citing works
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477 · see citing works
Self-citationÜber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395 · see citing works
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368 · see citing works
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 · see citing works
Self-citationFeynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770 · see citing works
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · see citing works
Self-citationHandbook of Graph Grammars and Computing by Graph Transformation
(1997) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812384720 · Cited by 1,350 · see citing works
Decidability of second-order theories and automata on infinite trees.
Rabin, M. O. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0246760-1 · Cited by 1,173 · see citing works
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023 · see citing works
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 · see citing works
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577 · see citing works
THE EXPRESSION OF GRAPH PROPERTIES AND GRAPH TRANSFORMATIONS IN MONADIC SECOND-ORDER LOGIC
Courcelle, B. (1997) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812384720_0005 · Cited by 313 · see citing works
Universal Resources for Measurement-Based Quantum Computation
Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150504 · Cited by 238 · see citing works
Self-citationVertex-minors, monadic second-order logic, and a conjecture by Seese
Courcelle, B., & Oum, S. (2006) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2006.04.003 · Cited by 119 · see citing works
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 · see citing works
Self-citationMeasurement-based quantum computation with the toric code states
Bravyi, S., & Raussendorf, R. (2007) · Physical Review A · doi:10.1103/physreva.76.022304 · Cited by 69 · see citing works
On the simulation of quantum circuitsPreprint
Jozsa, R. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0603163 · Cited by 49 · see citing works
Classical Simulation of Limited-Width Cluster-State Quantum Computation
Yoran, N., & Short, A. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.170503 · Cited by 33 · see citing works
Entanglement in Graph States and its ApplicationsPreprint
Hein, M., Dür, W., Eisert, J., et al. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0602096 · Cited by 15 · see citing works
Flagged first, then by citations
Research works printed but not linked: 8
- [1]1. R. P. Feynman, Opt. News 11, 11 (1985): Found. Phys. 16 507 (1986); Int. J. Theor. Phys. 21, 467 (1982).
- [3]3. R. Jozsa and N. Linden, Proc. R. Soc. London, Ser. A 459 , 2011 (2003).
- [5]5. I. Markov and Y. Shi, quant-ph/0511069. · arXiv
- [8]8. N. Yoran and A. J. Short, Phys. Rev. Lett. 96, 170503 (2006).
- [9]9. D. Gross and J. Eisert, quant-ph/0609149. · arXiv
- [17]17. B. Courcelle and S.-I. Oum, J. Combin, Theory Ser. B 97 , Issue 1, 2007, Pages 91-126.
- [19]19. S.-I. Oum, PhD thesis, Princeton University, 2005.
- [21]21. M. O. Rabin, Trans. Amer. Math. Soc. 141, 1-35, 1969.
Cited by
Sorted by citations
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · see citing works
Self-citation
- Authors
- Van den Nest, M., & Briegel, H. J.
- Affiliations
- Austrian Academy of Sciences (AT)
- ORCID
- Briegel, Hans J.
- Venue
- Foundations of Physics
- Published
- 2008-03-14
- Volume
- 38
- Issue
- 5
- Pages
- 448-457
- ISSN
- 0015-9018 (ISSN-L)
- 1572-9516
- OpenAlex
- W2005587022
- Cited by
- 17
- References
- 21
- Citations by year
- 2026: 1 · 2025: 3 · 2022: 3 · 2021: 1 · 2020: 1 · 2019: 1 · 2018: 1 · 2015: 2 · 2014: 1 · 2013: 1
- FWCI
- 1.06
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Foundations of Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- European Commission
- Austrian Science Fund
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- measurement-based quantum computation, graph states, Gödel's incompleteness theorems, quantum correlations, computational speed-up, quantum resource theory
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
