Classical Simulation of Limited-Width Cluster-State Quantum Computation
- 1 May 2006
- journal article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 96 (17) , 170503
- https://doi.org/10.1103/physrevlett.96.170503
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.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Efficient Classical Simulation of Slightly Entangled Quantum ComputationsPhysical Review Letters, 2003
- A One-Way Quantum ComputerPhysical Review Letters, 2001
- Entanglement monotonesJournal of Modern Optics, 2000