Contextuality in measurement-based quantum computation

Raussendorf, Robert

doi:10.1103/PhysRevA.88.022322

Contextuality in measurement-based quantum computation

Robert Raussendorf
(
- British Columbia U.
)

Aug 19, 2013

7 pages

Published in:

Phys.Rev.A 88 (2013) 2, 022322

Published: Aug 19, 2013

DOI:

10.1103/PhysRevA.88.022322

reference search119 citations

Citations per year

Abstract: (APS)

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.

computer: quantum
qubit
nonlinear
quantum algorithm
measurement theory
03.67.Ac
03.65.Ta

References(31)

Figures(0)

in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM

P. Shor

in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), (Association for Computing Machinery, New York,), p. 212

L.K. Grover

in Proceedings of the 35th Symposium on the Theory of Computing, (Association for Computing Machinery, New York,), p. 59

A.M. Childs
,
R. Cleve
,
E. Deotto
,
E. Farhi
,
S. Gutmann

et al.

Quantum entanglement

Ryszard Horodecki
(
- Gdansk U.
)
,
Pawel Horodecki
(
- Gdansk Tech. U. and
- AGH-UST, Cracow
)
,
Michal Horodecki
(
- Gdansk U.
)
,
Karol Horodecki
(
- Charles U. and
- Gdansk U.
)

- Rev.Mod.Phys. 81 (2009) 865-942
•
e-Print:
- quant-ph/0702225
•
DOI:
- 10.1103/RevModPhys.81.865

Quantum algorithms revisited

Richard Cleve
(
- Calgary U.
)
,
Artur Ekert
(
- Oxford U.
)
,
Chiara Macchiavello
(
- Oxford U. and
- ISI, Turin
)
,
Michele Mosca
(
- Oxford U.
)

- Proc.Roy.Soc.Lond.A 454 (1998) 339
•
e-Print:
- quant-ph/9708016
•
DOI:
- 10.1098/rspa.1998.0164

Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space

David Poulin
(
- Sherbrooke U.
)
,
Angie Qarry
(
- Vienna U. and
- Singapore Natl. U.
)
,
Rolando Somma
(
- Los Alamos
)
,
Frank Verstraete
(
- Vienna U.
)

- Phys.Rev.Lett. 106 (2011) 170501
•
e-Print:
- 1102.1360
•
DOI:
- 10.1103/PhysRevLett.106.170501

Ph.D. thesis, California Institute of Technology

D. Gottesman

Universal Quantum Computation with Little Entanglement

Maarten Van den Nest
(
- Munich, Max Planck Inst. Quantenopt.
)

- Phys.Rev.Lett. 110 (2013) 6, 060504
•
DOI:
- 10.1103/PhysRevLett.110.060504

Efficient Classical Simulation of Slightly Entangled Quantum Computations

Guifré Vidal
(
- Caltech, IQI
)

- Phys.Rev.Lett. 91 (2003) 14, 147902
•
DOI:
- 10.1103/PhysRevLett.91.147902

M. van

den Nest
,
G. W. Dür

- Phys.Rev.A 75 (2007) 012337

M.J. Bremner
,
C. Mora
,
A. Winter

- Phys.Rev.Lett. 102 (2009) 190502

Most Quantum States Are Too Entangled To Be Useful As Computational Resources

D. Gross
(
- Braunschweig Tech. U.
)
,
S.T. Flammia
(
- Perimeter Inst. Theor. Phys.
)
,
J. Eisert
(
- Potsdam U. and
- Imperial Coll., London
)

- Phys.Rev.Lett. 102 (2009) 19, 190501
•
DOI:
- 10.1103/PhysRevLett.102.190501

The Problem of Hidden Variables in Quantum Mechanics

- J.Math.Mech. 17 (1968) 59-87

On the Problem of Hidden Variables in Quantum Mechanics

John S. Bell
(
- SLAC
)

- Rev.Mod.Phys. 38 (1966) 447-452
•
DOI:
- 10.1103/RevModPhys.38.447

A One-Way Quantum Computer

Robert Raussendorf
(
- Munich U., ASC
)
,
Hans J. Briegel
(
- Munich U., ASC
)

- Phys.Rev.Lett. 86 (2001) 22, 5188
•
DOI:
- 10.1103/PhysRevLett.86.5188

Computational Power of Correlations

- Phys.Rev.Lett. 102 (2009) 5, 050502
•
DOI:
- 10.1103/PhysRevLett.102.050502

Hidden variables and the two theorems of John Bell

N. David Mermin
(
- Ames Lab and
- Cornell U., LASSP
)

- Rev.Mod.Phys. 65 (1993) 803-815,
- Rev.Mod.Phys. 88 (2016) 3, 039902 (erratum),
- Rev.Mod.Phys. 89 (2017) 4, 049901 (erratum)
•
e-Print:
- 1802.10119
•
DOI:
- 10.1103/RevModPhys.65.803