Classical simulation of limited-width cluster-state quantum computation
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.
Cluster state Matrix product state
Nadav Yoran Anthony J.Short
H.H.Wills Physics Laboratory, University of Bristol,Tyndall Avenue, Bristol BS8 1TL, UK
国际会议
Asian Conference on Quantum Onformation Science 2006(2006亚洲量子信息大会)
北京
英文
19-20
2006-09-01(万方平台首次上网日期,不代表论文的发表时间)