arXiv (All)
open access
Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces
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 k
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantum Speed Limits from Symmetries in Quantum Control#987442
- Lie-Algebraic Bounds on Quantum Control Time via the Baker-Campbell-Hausdorff Formula#1122898
- Subspace Controllability in Variational Quantum Circuits: Maximising Expressivity and Increasing Search Efficiency with Dynamical Lie Algebras#1050649
- On the Need for (Quantum) Memory with Short Outputs#1116216
- Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints#1141596
Record · ID 1187383
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive