Symmetry-accelerated classical simulation of Clifford-dominated circuits
Giulio Camillo, Filipa C. R. Peres, Markus Heinrich, and Juani Bermejo-Vega

TL;DR
This paper introduces symmetry-based methods to significantly improve the efficiency of classical simulations of Clifford-dominated quantum circuits, enabling larger and more complex circuit simulations.
Contribution
It develops symmetry reduction techniques that drastically lower computational costs for stabilizer extent calculations, allowing optimal decompositions on larger unitaries.
Findings
Achieved optimal decompositions for unitaries on up to seven qubits using standard laptops.
Demonstrated exponential runtime improvements in simulating quantum Fourier transforms.
Provided new insights into non-stabilizer properties of certain quantum gates and states.
Abstract
Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which quantifies the overhead of representing non-Clifford operations as linear combinations of Clifford unitaries. However, finding optimal decompositions rapidly becomes intractable as it constitutes a superexponentially large optimization problem. In this work, we exploit symmetries in the computation of the stabilizer extent, proving that for real, diagonal, and real-diagonal unitaries, the optimization can be restricted to the corresponding subgroups of the Clifford group without loss of optimality. This ``strong symmetry reduction'' drastically reduces computational cost, enabling optimal decompositions of unitaries on up to seven qubits using a…
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-Dot Cellular Automata
