Classical simulation of limited-width cluster-state quantum computation

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.

4 pages, 1 figure

Cited by in corpus (8)

• Matchgates and classical simulation of quantum circuits
• Classical simulation versus universality in measurement based quantum computation
• Fundamentals of universality in one-way quantum computation
• Efficient classical simulation of the semi-classical Quantum Fourier Transform
• Exponential complexity and ontological theories of quantum mechanics
• Efficient classical simulation of the approximate quantum Fourier transform
• On the simulation of quantum circuits
• Measurement-based quantum computation and undecidable logic