arXiv subjects

Avi Elazari

Publications and source records attributed to Avi Elazari.

3 recordsLinked to original sources

arXiv2026

Low-cost quantum error mitigation via auxiliary qubit return validation

We introduce a low-overhead technique for quantum error mitigation based on post-selection using auxiliary qubit measurements. The method exploits the structural property that, in an error-free computation, auxiliary qubits are often expected to return to the zero state after use. By selectively measuring these qubits at carefully chosen points in the circuit, erroneous shots can be identified and discarded, improving result fidelity with minimal hardware overhead. To account for circuit noise, including measurement errors, we analyze the likelihood that a measurement outcome indicates a corrupted shot. This analysis is informed by the measurement's backward light cone, namely the set of circuit operations that could affect the outcome. Shots whose auxiliary measurement outcomes imply a corruption likelihood above a tunable threshold are rejected. Simulations show that the method reduces the false-negative rate by approximately 10% while discarding only approximately 1% of valid shots. The threshold controls the bias-variance tradeoff inherent to post-selection, allowing the method to be adapted to the fidelity and sampling requirements of different applications.

quant-ph↗

arXiv2026

Optimal Approximation of Single Qubit Rotations within a Quantum Circuit

Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli rotations, yielding an approximating sequence with $T$-count that equals $3 \log_2(1/\epsilon)$ for a target precision $\epsilon$. Magnitude Approximation can reduce the $T$-count to only $1 \log_2(1/\epsilon)$ by allowing large residual errors, which are rotations about orthogonal axes. Within a complete quantum circuit, these residual errors can then be absorbed into neighboring gates before they are approximated themselves. Determining the optimal allocation of approximation strategies within a large, multi-qubit circuit presents a significant combinatorial challenge. In this work, we present a linear-time algorithm that guarantees an optimal solution to this problem. We demonstrate that the issue of delegating Magnitude versus Diagonal approximation across a circuit maps formally to a classical 1D Ising model with a spatially varying field. By minimizing the energy of this Hamiltonian, we identify the optimal approximation configuration for each rotation without exponential overhead. Benchmarking our method against standard diagonal approximation on random quantum circuits, we observe an average reduction of 26\% in the total approximating circuit gate count, offering a significant efficiency gain for the implementation of quantum algorithms on near-term and fault-tolerant architectures.

quant-ph↗

arXiv2024

Design and synthesis of scalable quantum programs

We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program. Advanced synthesis algorithms transform the model into a low-level quantum program that meets the user's specification and is directed at a stipulated hardware. This separation of description from implementation is essential for scale. The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space. The results show clear superiority over the compilation and transpilation methods used today. We expect that this technological approach will take over and prevail as quantum software become more demanding, complex, and essential.

quant-ph↗