Contextuality supplies the 'magic' for quantum computation

Nature

Volumn 510, Issue 7505, 2014, Pages 351-355

  Howard, Mark ^a,b   Wallman, Joel ^b   Veitch, Victor ^b,c   Emerson, Joseph ^b  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM DOT;

ALGORITHM; NUMERICAL MODEL; QUANTUM MECHANICS;

ALGORITHM; ARTICLE; COMPUTER; CONCEPTUAL FRAMEWORK; INFORMATION PROCESSING; INFORMATION SCIENCE; MAGIC STATE DISTILLATION; MATHEMATICAL PARAMETERS; PRIORITY JOURNAL; QUANTUM COMPUTATION; QUANTUM COMPUTER; QUANTUM CONTEXTUALITY; QUANTUM THEORY; STABILIZER OPERATION;

EID: 84903217274     PISSN: 00280836     EISSN: 14764687     Source Type: Journal    
DOI: 10.1038/nature13460     Document Type: Article

References (48)

1. Shor, P. W. in Proc. IEEE Foundations of Computer Science (FOCS) (ed. Goldwasser, S.) 124-134 http://dx.doi.org/10.1109/SFCS.1994.365700 (IEEE Computer Society, 1994).
2. Lloyd, S. Universal quantum simulators. Science 273, 1073-1078 (1996).
3. Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. A. 400, 97-117 (1985).
4. Vidal, G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003).
5. Datta, A., Shaji, A.&Caves, C. M.Quantumdiscord and thepower ofone qubit. Phys. Rev. Lett. 100, 050502 (2008).
6. Steane, A. M. A quantum computer only needs one universe. Preprint at http:// arxiv.org/abs/quant-ph/0003084 (2000).
7. Vedral, V. The elusive source of quantum speedup. Found. Phys. 40, 1141-1154 (2010).
8. Brodutch, A. Discord and quantum computational resources. Phys. Rev. A 88, 022307 (2013).
9. Van den Nest, M. Universal quantum computation with little entanglement. Phys. Rev. Lett. 110, 060504 (2013).
10. Knill, E. & Laflamme, R. Power of one bit of quantum information. Phys. Rev. Lett. 81, 5672-5675 (1998).
11. Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R. & Van den Nest, M. Measurement-based quantum computation. Nature Phys. 5, 19-26 (2009).
12. Bell, J. On the problemof hidden variables in quantummechanics. Rev. Mod. Phys. 38, 447-452 (1966).
13. Kochen, S. & Specker, E. P. The problem of hidden variables in quantum mechanics. J Math. Mech. 17, 59-87 (1968).
14. Bravyi, S.&Kitaev, A.Universal quantumcomputation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005).
15. Knill, E. Quantum computing with realistically noisy devices. Nature 434, 39-44 (2005).
16. Campbell, E. T., Anwar, H. & Browne, D. E. Magic state distillation in all prime dimensions using quantum Reed-Muller codes. Phys. Rev. X 2, 041021 (2012).
17. Mermin, N. D. Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett. 65, 3373-3376 (1990).
18. Buhrman, H., Cleve, R., Massar, S. & de Wolf, R. Nonlocality and communication complexity. Rev. Mod. Phys. 82, 665-698 (2010).
19. Acín, A. et al. Device-independent security of quantum cryptography against collective attacks. Phys. Rev. Lett. 98, 230501 (2007).
20. Reichardt, B. W., Unger, F. & Vazirani, U. Classical command of quantum systems. Nature 496, 456-460 (2013).
21. Vazirani, U. & Vidick, T. Fully device independent quantum key distribution. Preprint at http://arxiv.org/abs/1210.1810 (2012).
22. Raussendorf, R. Contextuality in measurement-based quantum computation. Phys. Rev. A 88, 022322 (2013).
23. Hoban, M. J., Wallman, J. J. & Browne, D. E. Generalized Bell-inequality experiments and computation. Phys. Rev. A 84, 062107 (2011).
24. Gottesman, D. Theory of fault-tolerant quantum computation. Phys. Rev. A 57, 127-137 (1998).
25. Kitaev A. Yu. Fault-tolerantquantumcomputation by anyons. Ann. Phys. 303, 2-30 (2003).
26. Raussendorf, R., Harrington, J. & Goyal, K. A fault-tolerant one-way quantum computer. Ann. Phys. 321, 2242-2270 (2006).
27. Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452-4505 (2002).
28. Anwar, H., Brown, B. J., Campbell, E. T. & Browne, D. E. Efficient decoders for qudit topological codes. Preprint at http://arxiv.org/abs/1311.4895 (2013).
29. Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).
30. Aaronson, S. & Gottesman, D. Improved simulation of stabilizer circuits. Phys. Rev. A 70, 052328 (2004).
31. Cabello, A., Severini, S. & Winter, A. (Non-)Contextuality of physical theories as an axiom. Preprint at http://arxiv.org/abs/1010.2163 (2010).
32. Cabello, A., Severini, S. & Winter, A. Graph-theoretic approach to quantum correlations. Phys. Rev. Lett. 112, 040401 (2014).
33. Cormick, C., Galvão, E. F., Gottesman, D., Pablo Paz, J. & Pittenger, A. O. Classicality in discrete Wigner functions. Phys. Rev. A 73, 012301 (2006).
34. Howard, M. & Vala, J. Qudit versions of the qubit p/8 gate. Phys. Rev. A 86, 022316 (2012).
35. Veitch, V., Ferrie, C., Gross, D. & Emerson, J. Negative quasi-probability as a resource for quantum computation. N. J. Phys. 14, 113011 (2012).
36. Mari, A. & Eisert, J. Positive Wigner functions render classical simulation of quantum computation efficient. Phys. Rev. Lett. 109, 230503 (2012).
37. van Dam, W.&Howard, M.Noise thresholds for higher-dimensional systemsusing the discrete Wigner function. Phys. Rev. A 83, 032310 (2011).
38. Appleby, D. M., Bengtsson, I. & Chaturvedi, S. Spectra of phase point operators in odd prime dimensions and the extended Clifford group. J. Math. Phys. 49, 012102 (2008).
39. Wallman, J. J. & Bartlett, S. D. Non-negative subtheories and quasiprobability representations of qubits. Phys. Rev. A 85, 062121 (2012).
40. Gross, D. Hudson's theorem for finite-dimensional quantum systems. J. Math. Phys. 47, 122107 (2006).
41. Wootters, W. K. The discrete Wigner function. Ann. NY Acad. Sci. 480, 275-282 (1986).
42. Gibbons, K. S., Hoffman, M. J. & Wootters, W. K. Discrete phase space based on finite fields. Phys. Rev. A 70, 062101 (2004).
43. Östergard, P. R. J. A fast algorithmfor the maximumclique problem. Discrete Appl. Math. 120, 197-207 (2002).
44. Veitch, V., Mousavian, S. A. H., Gottesman, D. & Emerson, J. The resource theory of stabilizer computation. N. J. Phys. 16, 013009 (2014).
45. Howard, M., Brennan, E. & Vala, J. Quantum contextuality with stabilizer states. Entropy 15, 2340-2362 (2013).
46. Peres, A. Two simple proofs of the Kochen-Specker theorem. J. Phys. A 24, L175-L178 (1991).
47. Spekkens, R. W. Contextuality for preparations, transformations, and unsharp measurements. Phys. Rev. A 71, 052108 (2005).
48. Acín, A., Fritz, T., Leverrier, A.& Sainz, A. B. A combinatorial approach to nonlocality and contextuality. Preprint at http://arxiv.org/abs/1212.4084 (2012).