Mapping approximation strategy allocation in quantum circuits to a 1D Ising model enables a linear-time optimal algorithm that reduces gate count by 26% on average.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Approximation of Single Qubit Rotations within a Quantum Circuit
Mapping approximation strategy allocation in quantum circuits to a 1D Ising model enables a linear-time optimal algorithm that reduces gate count by 26% on average.