Abstract
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In particular, we show that for all graph state resources which can yield a computational speed-up with respect to classical computation, the underlying graphs—describing the quantum correlations of the states—are associated with undecidable logic theories. Here undecidability is to be interpreted in a sense similar to Gödel’s incompleteness results, meaning that there exist propositions, expressible in the above classical formal logic, which cannot be proven or disproven.
Similar content being viewed by others
References
Feynman, R.P.: Opt. News 11, 11 (1985)
Feynman, R.P.: Found. Phys. 16, 507 (1986)
Feynman, R.P.: Int. J. Theor. Phys. 21, 467 (1982)
Shor, P.W.: SIAM J. Sci. Stat. Comput. 26, 1484 (1997)
Jozsa, R., Linden, N.: Proc. R. Soc. Lond. Ser. A 459, 2011 (2003)
Vidal, G.: Phys. Rev. Lett. 91, 147902 (2003)
Markov, I., Shi, Y.: quant-ph/0511069
Shi, Y., Duan, L., Vidal, G.: Phys. Rev. A 74, 022320 (2006)
Jozsa, R.: quant-ph/0603163
Yoran, N., Short, A.J.: Phys. Rev. Lett. 96, 170503 (2006)
Gross, D., Eisert, J.: quant-ph/0609149
Van den Nest, M., Miyake, A., Dür, W., Briegel, H.J.: Phys. Rev. Lett. 97, 150504 (2006)
Van den Nest, M., Dür, W., Vidal, G., Briegel, H.J.: Phys. Rev. A 75, 012337 (2007)
Raussendorf, R., Briegel, H.J.: Phys. Rev. Lett. 86, 5188 (2001)
Raussendorf, R., Browne, D.E., Briegel, H.J.: Phys. Rev. A 68, 022312 (2003)
Briegel, H.J., Raussendorf, R.: Phys. Rev. Lett. 86, 910 (2001)
Hein, M., et al.: In: Proceedings of the International School of Physics Enrico Fermi on Quantum Computers, Algorithms and Chaos, Varenna, Italy, July 2005. quant-ph/0602096
Gödel, K.: Mon. Math. Phys. 38, 173–198 (1931)
Courcelle, B., Oum, S.-I.: J. Comb. Theory Ser. B 97(1), 91–126 (2007)
Courcelle, B.: In: Handbook of Graph Grammars and Computing by Graph Transformation 1, pp. 313–400. World Scientific, River Edge (1997)
Oum, S.-I.: PhD thesis, Princeton University (2005)
Rabin, M.O.: Trans. Am. Math. Soc. 141, 1–35 (1969)
Bravyi, S., Raussendorf, R.: Phys. Rev. A 76, 022304 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Van den Nest, M., Briegel, H.J. Measurement-Based Quantum Computation and Undecidable Logic. Found Phys 38, 448–457 (2008). https://doi.org/10.1007/s10701-008-9212-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10701-008-9212-6