Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
quant-ph
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- A Term-Rewriting Semantics for Pure Quantum States
- Certified Misty-State Rewriting (A Question-and-Answer Guide)
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- An efficient magic state approach to small angle rotations
- Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
- Lower bounds on the non-Clifford resources for quantum computations
- The Clifford hierarchy for one qubit or qudit
- Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
- Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
- Subgroups of SO(3) Associated with Tilings
- The Clifford-cyclotomic group and Euler-Poincar'e characteristics
- Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits
- Contributions to the Theory of Clifford-Cyclotomic Circuits
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements