Efficient classical simulation of slightly entangled quantum computations.
暂无分享,去创建一个
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 n qubits by using computational resources that grow linearly in n 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 n of the computation, and provide an explicit lower bound on the required growth.
[1] B. M. Fulk. MATH , 1992 .
[2] R. Jozsa,et al. On the role of entanglement in quantum-computational speed-up , 2002, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[3] G. Vidal,et al. Entanglement in quantum critical phenomena. , 2002, Physical review letters.