Any unital quantum channel on d dimensions admits exact simulation with ancilla dimension k and success probability Ω(k/log d) via randomization and postselection; the bound is tight and fails for strongly non-unital channels.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
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.
citing papers explorer
-
Randomized simulation of quantum channels using small ancilla
Any unital quantum channel on d dimensions admits exact simulation with ancilla dimension k and success probability Ω(k/log d) via randomization and postselection; the bound is tight and fails for strongly non-unital channels.
-
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.