Efficient classical simulation of slightly entangled quantum computations

1.6kCitations
Citations of this article
695Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a classical protocol to efficiently simulate any pure-state quantum computation that involves only a restricted amount of entanglement. More generally, we show how to classically simulate pure-state quantum computations on [Formula presented] qubits by using computational resources that grow linearly in [Formula presented] and exponentially in the amount of entanglement in the quantum computer. Our results imply that a necessary condition for an exponential computational speedup (with respect to classical computations) is that the amount of entanglement increases with the size [Formula presented] of the computation, and provide an explicit lower bound on the required growth. © 2003 The American Physical Society.

Cite

CITATION STYLE

APA

Vidal, G. (2003). Efficient classical simulation of slightly entangled quantum computations. Physical Review Letters, 91(14). https://doi.org/10.1103/PhysRevLett.91.147902

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free