Adptive quantum computation, constant depth quantum circuits and arthur-merlin games

Terhal, B. M.; DiVincenzo, David P.

Adptive quantum computation, constant depth quantum circuits and arthur-merlin games

Journal article (2004)

Authors

B. M. Terhal IBM Thomas J. Watson Research Centre

David P. DiVincenzo IBM Thomas J. Watson Research Centre

Affiliation

External organisation

Constant Depth Quantum Circuits Quantum Computation by teleportation

To reference this document use:

http://resolver.tudelft.nl/uuid:7f64355c-ec21-4d21-b65b-7a88ce206b3f

More Info

expand_more

Published Date

2004

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM.