Efficient classical simulation of cluster state quantum circuits with alternative inputs
Sahar Atallah, Michael Garn, Sania Jevtic, Yukuan Tao, Shashank, Virmani

TL;DR
This paper identifies specific initial states in cluster state quantum circuits that can be efficiently simulated classically, expanding understanding of the boundary between quantum advantage and classical simulability.
Contribution
It introduces a new class of initial states close to diagonal states that allow efficient classical simulation of certain cluster state quantum circuits.
Findings
Classical simulation is efficient for states within a certain trace distance of diagonal states.
The classically simulatable region size increases with a coarse grained approach.
Results extend to qudit systems with diagonal interactions and specific measurements.
Abstract
We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch sphere, gates are applied, and finally the qubits are measured adaptively using measurements or measurements of operators. We consider what happens when the initialisation step is modified, and show that for lattices of finite degree , there is a constant such that if the qubits are prepared in a state that is within in trace distance of a state that is diagonal in the computational basis, then the system can be efficiently simulated classically in the sense of sampling from the output distribution within a desired total variation distance. In the square lattice with …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
