Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces
Andreas Stergiou, Nicolas PD Sawaya

TL;DR
This paper proves that hardware-efficient quantum gates are universal for state preparation within constrained subspaces, using Lie algebra techniques, with applications to models like Fermi-Hubbard and CFT.
Contribution
It introduces a Lie algebraic framework demonstrating universality of gates in particle and symmetry constrained subspaces, extending to complex phases and providing verification criteria.
Findings
Proves universality of gates in fixed particle number and spin subspaces.
Extends results to complex phases enabling arbitrary state preparation.
Demonstrates applications to Fermi-Hubbard, Bose-Hubbard, and CFT models.
Abstract
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates are universal for state preparation in these subspaces. The key mechanism is Pauli dressing: commutators of overlapping gates produce Pauli operators on shared qubits, acting as spectator projectors that decompose multi-plane rotations into single-plane generators spanning the full algebra, where is the dimension of the constrained subspace, thereby guaranteeing universality for real state preparation. Adding independent complex phases extends this to , enabling arbitrary complex state preparation. We provide a computationally efficient Jacobian criterion for verifying that a circuit can explore any…
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.
