Efficient classical simulation of slightly entangled quantum computations

Details Efficient classical simulation of slightly entangled quantum computations Efficient classical simulation of slightly entangled quantum computations

2003-01-15

arxiv.org/abs/quant-ph/0301063v2

Phys. Rev. Lett. 91, 147902 (2003)

Physics

Quantum Physics

4 pages. Major changes. Significantly improved simulation scheme

Scientific paper

10.1103/PhysRevLett.91.147902

We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.

Affiliated with

Also associated with

No associations

Rating

Efficient classical simulation of slightly entangled quantum computations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient classical simulation of slightly entangled quantum computations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient classical simulation of slightly entangled quantum computations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498169