Post-selection on auxiliary qubit return-to-zero measurements, informed by backward light cones, reduces false-negative rate by ~10% while discarding ~1% of valid shots in simulations.
De- sign and synthesis of scalable quantum programs
3 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 3representative 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.
Dual-register encoding enables coined quantum walks on degree-varying complex networks with circuit depth scaling as N^1.9, shown via simulations on standard models and small IBM hardware executions.
citing papers explorer
-
Low-cost quantum error mitigation via auxiliary qubit return validation
Post-selection on auxiliary qubit return-to-zero measurements, informed by backward light cones, reduces false-negative rate by ~10% while discarding ~1% of valid shots in simulations.
-
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.
-
Coined Quantum Walks on Complex Networks for Quantum Computers
Dual-register encoding enables coined quantum walks on degree-varying complex networks with circuit depth scaling as N^1.9, shown via simulations on standard models and small IBM hardware executions.