Classical simulation of limited-width cluster-state quantum computation
Quantum Physics
2009-11-13 v1
Abstract
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d -- the width of the cluster. We use this result to show that any log-depth quantum computation in the gate array model, with gates linking only nearby qubits, can be simulated efficiently on a classical computer.
Cite
@article{arxiv.quant-ph/0601178,
title = {Classical simulation of limited-width cluster-state quantum computation},
author = {Nadav Yoran and Anthony J. Short},
journal= {arXiv preprint arXiv:quant-ph/0601178},
year = {2009}
}
Comments
4 pages, 1 figure