Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Empirical Validation of Ancilla Recycling via Uncomputation and Loschmidt Echo Decay on NISQ Architectures

Madhan Mohan Agaram

Published Oct 27, 2026• 0 citations
Publisher

Abstract

In quantum algorithm design, scratchpad auxiliary (ancilla) qubits represent a critical hardwareoverhead. While intermediate measurements can collapse superpositions destructively, Bennett’s principle of reversible uncomputation allows auxiliary registers to be disentangled unitarily and returned to their ground state |0⟩ for reuse. In this paper, we report empirical hardware benchmarks of coherent ancilla uncomputation and full-cycle state restoration across 12-qubit and 20-qubit registers executed on the 156-qubit superconducting processor ibm_kingston . To evaluate uncomputation under non-trivial amplitude configurations, continuous phase rotations were parameterized using entropy bytes extracted from a classical binary stream. The hardware successfully reset 10 entangled ancilla qubits back to the |0000000000⟩ state with an uncomputation fidelity of 90.30% (903/1000 shots). However, executing a complete forward-and-reverse Loschmidt echo protocol across the full 20-qubit register yielded an exact state restoration fidelity of only 21.40%. This degradation quantitatively illustrates how non-unitary NISQ errors— including 2-qubit gate cross-talk, T1/T2 relaxation, and compounding measurement readout error—destroy exact reversibility as circuit depth doubles. We provide full experimental provenance, calibration context, and job identifiers to establish a reproducible baseline for NISQ ancilla management. Keywords: Ancilla recycling, Quantum uncomputation, Loschmidt echo, NISQ benchmarking, Superconducting qubits,Heavy-hex architecture.

DOI
10.5281/zenodo.23696412

Related papers

Erasynth: Improving Quantum Uncomputation with Structural Measurements

Mingfei Zhang, Anbang Wu, Pu Pang +7 more

In quantum computing, safely clearing temporary ancilla qubits, a process known as uncomputation, is essential to prevent irreversible computational errors caused by entanglement. The typical uncomputation process removes entanglement by reversing gates used to correlate ancilla and (program) data, potentially doubling circuit depth and gate counts. The alternative approach introduces measurements to directly reset ancilla to the ground state and has the potential of reducing uncomputation overhead. Unfortunately, existing measurement-based methods may need to correct the minus sign of exponentially many quantum state terms due to measurement uncertainty, instead incurring larger gate overhead. Our insight to further reduce the uncomputation overhead is to integrate the idea of both methods. To some extent, the unitary-based method is highly structural, reflecting the circuit's computation-uncomputation symmetry, while the measurement-based method introduces randomness due to the uncertainty of the involved qubit set and the resulting phase corrections. Either being too structural or too random introduces high overhead for uncomputation. This work improves existing methods by incorporating structural circuit analysis to suppress the randomness of measurements. This work proposes Erasynth, which analyzes the circuit context and identifies the best timing of applying measurements to release ancilla; unveils the optimal strategy to release ancilla according to the dimension of involved quantum data subspace; prunes and only corrects the key data subspace suffering from measurement-induced phase flip. Experimental evaluations show that Erasynth reduces CX gates by up to 37.48%/97.56% and T gates by up to 50.0%/98.54% over the unitary-based/measurement-based baseline, while also reducing circuit depth by up to 75.62%/98.89%.

International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Nov 4, 2026•0 citations

Measurement-Free Ancilla Recycling via Blind Reset: A Cross-Platform Study on Superconducting and Trapped-Ion Processors

Sangkeum Lee

Ancilla reuse in repeated syndrome extraction couples reset quality to logical-cycle latency. We evaluate blind reset -- unitary-only recycling via scaled sequence replay -- on IQM Garnet, Rigetti Ankaa-3, and IonQ under matched seeds, sequence lengths, and shot budgets. Using ancilla cleanliness F_clean=P(|0>), per-cycle latency, and a distance-3 repetition-code logical-error proxy, platform-calibrated simulation identifies candidate regions where blind reset cuts cycle latency by up to 38x under NVQLink-class feedback overhead while maintaining F_clean >= 0.86 for L <= 6. Hardware experiments on IQM Garnet confirm blind-reset cleanliness >= 0.84 at L=8 (1024 shots, seed 42); platform-calibrated simulation for Rigetti Ankaa-3 predicts comparable performance. Architecture-dependent crossover lengths are L* ~ 12 (IQM), ~ 11 (Rigetti), ~ 1 (IonQ), and ~ 78 with GPU-linked external feedback. Two added analyses tighten deployment boundaries: a T1/T2 sensitivity map identifies coherence-ratio regimes, and error-bound validation confirms measured cleanliness remains consistent with the predicted diagnostic envelope. A deployment decision matrix translates these results into backend-specific policy selection.

cs.ARCross-listedarXiv:2603.08733•Feb 25, 2026•0 citations

High-fidelity realization of the AKLT state on a NISQ-era quantum processor

Tianqi Chen, Ruizhe Shen, Ching Hua Lee +1 more

The AKLT state is the ground state of an isotropic quantum Heisenberg spin-1 model. It exhibits an excitation gap and an exponentially decaying correlation function, with fractionalized excitations at its boundaries. So far, the one-dimensional AKLT model has only been experimentally realized with trapped-ions as well as photonic systems. In this work, we successfully prepared the AKLT state on a noisy intermediate-scale quantum (NISQ) era quantum device. In particular, we developed a non-deterministic algorithm on the IBM quantum processor, where the non-unitary operator necessary for the AKLT state preparation is embedded in a unitary operator with an additional ancilla qubit for each pair of auxiliary spin-1/2’s. Such a unitary operator is effectively represented by a parametrized circuit composed of single-qubit and nearest-neighbor CX gates. Compared with the conventional operator decomposition method from Qiskit, our approach results in a much shallower circuit depth with only nearest-neighbor gates, while maintaining a fidelity in excess of 99.99% with the original operator. By simultaneously post-selecting each ancilla qubit such that it belongs to the subspace of spin-up |↑>, an AKLT state can be systematically obtained by evolving from an initial trivial product state of singlets plus ancilla qubits in spin-up on a quantum computer, and it is subsequently recorded by performing measurements on all the other physical qubits. We show how the accuracy of our implementation can be further improved on the IBM quantum processor with readout error mitigation.

arXiv:2210.13840•SciPost Physics•Oct 18, 2023•40 citations

MBUndo: Sound, Automatic, and Efficient Measurement-Based Uncomputation for Quantum Circuits

Shengyuan Yang, Charles Yuan

Quantum programs that use temporary values, known as \emph{ancilla} qubits, must explicitly \emph{uncompute} each ancilla back to zero to ensure that the program produces correct outputs. Conventional uncomputation uses unitary quantum gates, whereas leading quantum algorithms now leverage \emph{measurement-based uncomputation} (MBU), which replaces costly unitary $T$ gates with cheaper measurements and phase corrections. Current quantum programming frameworks can use measurement to uncompute specific gates such as Toffoli. No automatic transformation, however, accepts an arbitrary circuit whose ancillas are computed and uncomputed via the standard approach and converts the circuit to use MBU\@. Researchers instead apply MBU to individual circuit designs by hand, which limits algorithm development and compiler optimization. Such a transformation has not existed due to two fundamental unknowns: where MBU applies and which gates realize MBU for an arbitrary computation. To solve these, we first present a static analysis that identifies, for each ancilla qubit, each circuit position where measurement is sound --- subsuming basic assumptions that MBU only applies at the end of a circuit. Next, we present circuit transformations that soundly turn unitary uncomputation gates into efficient phase corrections after measurement --- generalizing rewrite rules from prior literature that are either limited to a single gate or not applicable to a general circuit. We present \textsf{MBUndo}, an integrated compiler pass that automatically converts circuits to measurement-based uncomputation. It requires no user annotations other than which qubits are ancillas, the same as needed by existing uncomputation synthesizers, and can enhance their output circuits. We evaluate \textsf{MBUndo} on 22 benchmarks to reveal \emph{T} gate reductions of ${>}36.5\%$ over uncomputation synthesizers.

cs.PLCross-listedarXiv:2611.02345•Nov 3, 2026•0 citations

Repetition-code-based readout error detection and correction across hardware platforms and generations

Csaba Czabán, Orsolya Kálmán, Sergey N. Filippov +1 more

Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect only the classical measurement outcomes, they can be addressed using classical coding techniques: immediately before measurement, each data qubit is redundantly encoded with ancilla qubits, and the resulting bit string is decoded either by post-selection or by majority voting. Unlike conventional readout error mitigation, which corrects only aggregate quantities such as expectation values, this approach operates on individual measurement shots and can therefore produce approximately corrected samples. We present a systematic cross-platform and cross-generation experimental evaluation of repetition-code readout error detection and correction. We benchmark the same protocol on IBM Heron r1-r3 superconducting processors and Quantinuum H1 and H2 trapped-ion processors while independently varying the code distance, hardware generation, and encoding layout. We find that both error detection and correction improve readout fidelity on every device and generation tested, even as the unencoded baseline improves substantially across successive hardware releases. At the same time, the value of additional redundancy depends strongly on the underlying hardware. On superconducting processors, the extra gate errors introduced by the encoding rapidly offset its benefits, whereas on trapped-ion processors the much lower gate error rates allow larger code distances to remain advantageous.

quant-pharXiv:2606.30606•Jun 30, 2026•0 citations

Ancilla-recycled RODEO filtering for nuclear scattering: A cross-platform benchmark on quantum processors

Myeong-Hwan Mun, Jubin Park, Myung-Ki Cheoun +1 more

Quantum computation of trapped spectra for nuclear scattering requires resource-efficient circuits and reliable energy inputs. We present a cross-platform benchmark of ancilla-recycled RODEO filtering for a four-dimensional effective Hamiltonian describing a trapped neutron--proton model. Static circuits on IonQ Forte-1 and dynamic circuits on IBM Aachen implement the same ideal ten-cycle all-zero accepted filter using twelve and three active qubits, respectively. Mid-circuit measurement and reset reduce the active qubit count by 75\% while retaining all controlled evolutions. The interleaved IBM peak-center offset from the exact level is $-0.017 \pm 0.507~\mathrm{keV}$, compared with $-0.568 \pm 0.694~\mathrm{keV}$ for IonQ (finite-shot bootstrap uncertainties). At \(ω=3.7~\mathrm{MeV}\), the modified effective range expansion maps both centers to finite-confinement scattering inputs consistent with the exact reference within propagated uncertainties. Three IBM batches exhibit center variations beyond finite-shot uncertainties (\(p=0.015\)), despite comparatively stable postselection amplitudes. Calibration-derived noisy simulations do not consistently reproduce the measured centers. Complete sampled support enables sample-based quantum diagonalization to recover the exact effective-space level, whereas larger-space simulator tests expose substantial errors from omitted configurations. The calculation validates one finite-confinement input, not a free-space phase shift. This benchmark provides a reusable circuit and validation protocol separating spectral precision, hardware repeatability, and sampled-subspace completeness for multilevel nuclear-scattering calculations.

arXiv:2608.26569•Aug 27, 2026•1 citation
In quantum algorithm design, scratchpad auxiliary (ancilla) qubits represent a critical hardwareoverhead. While intermediate measurements can collapse superpositions destructively, Bennett’s principle of reversible uncomputation allows auxiliary registers to be disentangled unitarily and returned to their ground state |0⟩ for reuse. In this paper, we report empirical hardware benchmarks of coherent ancilla uncomputation and full-cycle state restoration across 12-qubit and 20-qubit registers executed on the 156-qubit superconducting processor ibm_kingston . To evaluate uncomputation under non-trivial amplitude configurations, continuous phase rotations were parameterized using entropy bytes extracted from a classical binary stream. The hardware successfully reset 10 entangled ancilla qubits back to the |0000000000⟩ state with an uncomputation fidelity of 90.30% (903/1000 shots). However, executing a complete forward-and-reverse Loschmidt echo protocol across the full 20-qubit register yielded an exact state restoration fidelity of only 21.40%. This degradation quantitatively illustrates how non-unitary NISQ errors— including 2-qubit gate cross-talk, T1/T2 relaxation, and compounding measurement readout error—destroy exact reversibility as circuit depth doubles. We provide full experimental provenance, calibration context, and job identifiers to establish a reproducible baseline for NISQ ancilla management. Keywords: Ancilla recycling, Quantum uncomputation, Loschmidt echo, NISQ benchmarking, Superconducting qubits,Heavy-hex architecture.
In quantum computing, safely clearing temporary ancilla qubits, a process known as uncomputation, is essential to prevent irreversible computational errors caused by entanglement. The typical uncomputation process removes entanglement by reversing gates used to correlate ancilla and (program) data, potentially doubling circuit depth and gate counts. The alternative approach introduces measurements to directly reset ancilla to the ground state and has the potential of reducing uncomputation overhead. Unfortunately, existing measurement-based methods may need to correct the minus sign of exponentially many quantum state terms due to measurement uncertainty, instead incurring larger gate overhead. Our insight to further reduce the uncomputation overhead is to integrate the idea of both methods. To some extent, the unitary-based method is highly structural, reflecting the circuit's computation-uncomputation symmetry, while the measurement-based method introduces randomness due to the uncertainty of the involved qubit set and the resulting phase corrections. Either being too structural or too random introduces high overhead for uncomputation. This work improves existing methods by incorporating structural circuit analysis to suppress the randomness of measurements. This work proposes Erasynth, which analyzes the circuit context and identifies the best timing of applying measurements to release ancilla; unveils the optimal strategy to release ancilla according to the dimension of involved quantum data subspace; prunes and only corrects the key data subspace suffering from measurement-induced phase flip. Experimental evaluations show that Erasynth reduces CX gates by up to 37.48%/97.56% and T gates by up to 50.0%/98.54% over the unitary-based/measurement-based baseline, while also reducing circuit depth by up to 75.62%/98.89%.
Ancilla reuse in repeated syndrome extraction couples reset quality to logical-cycle latency. We evaluate blind reset -- unitary-only recycling via scaled sequence replay -- on IQM Garnet, Rigetti Ankaa-3, and IonQ under matched seeds, sequence lengths, and shot budgets. Using ancilla cleanliness F_clean=P(|0>), per-cycle latency, and a distance-3 repetition-code logical-error proxy, platform-calibrated simulation identifies candidate regions where blind reset cuts cycle latency by up to 38x under NVQLink-class feedback overhead while maintaining F_clean >= 0.86 for L <= 6. Hardware experiments on IQM Garnet confirm blind-reset cleanliness >= 0.84 at L=8 (1024 shots, seed 42); platform-calibrated simulation for Rigetti Ankaa-3 predicts comparable performance. Architecture-dependent crossover lengths are L* ~ 12 (IQM), ~ 11 (Rigetti), ~ 1 (IonQ), and ~ 78 with GPU-linked external feedback. Two added analyses tighten deployment boundaries: a T1/T2 sensitivity map identifies coherence-ratio regimes, and error-bound validation confirms measured cleanliness remains consistent with the predicted diagnostic envelope. A deployment decision matrix translates these results into backend-specific policy selection.
The AKLT state is the ground state of an isotropic quantum Heisenberg spin-1 model. It exhibits an excitation gap and an exponentially decaying correlation function, with fractionalized excitations at its boundaries. So far, the one-dimensional AKLT model has only been experimentally realized with trapped-ions as well as photonic systems. In this work, we successfully prepared the AKLT state on a noisy intermediate-scale quantum (NISQ) era quantum device. In particular, we developed a non-deterministic algorithm on the IBM quantum processor, where the non-unitary operator necessary for the AKLT state preparation is embedded in a unitary operator with an additional ancilla qubit for each pair of auxiliary spin-1/2’s. Such a unitary operator is effectively represented by a parametrized circuit composed of single-qubit and nearest-neighbor CX gates. Compared with the conventional operator decomposition method from Qiskit, our approach results in a much shallower circuit depth with only nearest-neighbor gates, while maintaining a fidelity in excess of 99.99% with the original operator. By simultaneously post-selecting each ancilla qubit such that it belongs to the subspace of spin-up |↑>, an AKLT state can be systematically obtained by evolving from an initial trivial product state of singlets plus ancilla qubits in spin-up on a quantum computer, and it is subsequently recorded by performing measurements on all the other physical qubits. We show how the accuracy of our implementation can be further improved on the IBM quantum processor with readout error mitigation.
Quantum programs that use temporary values, known as \emph{ancilla} qubits, must explicitly \emph{uncompute} each ancilla back to zero to ensure that the program produces correct outputs. Conventional uncomputation uses unitary quantum gates, whereas leading quantum algorithms now leverage \emph{measurement-based uncomputation} (MBU), which replaces costly unitary TTT gates with cheaper measurements and phase corrections. Current quantum programming frameworks can use measurement to uncompute specific gates such as Toffoli. No automatic transformation, however, accepts an arbitrary circuit whose ancillas are computed and uncomputed via the standard approach and converts the circuit to use MBU\@. Researchers instead apply MBU to individual circuit designs by hand, which limits algorithm development and compiler optimization. Such a transformation has not existed due to two fundamental unknowns: where MBU applies and which gates realize MBU for an arbitrary computation. To solve these, we first present a static analysis that identifies, for each ancilla qubit, each circuit position where measurement is sound --- subsuming basic assumptions that MBU only applies at the end of a circuit. Next, we present circuit transformations that soundly turn unitary uncomputation gates into efficient phase corrections after measurement --- generalizing rewrite rules from prior literature that are either limited to a single gate or not applicable to a general circuit. We present \textsf{MBUndo}, an integrated compiler pass that automatically converts circuits to measurement-based uncomputation. It requires no user annotations other than which qubits are ancillas, the same as needed by existing uncomputation synthesizers, and can enhance their output circuits. We evaluate \textsf{MBUndo} on 22 benchmarks to reveal \emph{T} gate reductions of >36.5%{>}36.5\%>36.5% over uncomputation synthesizers.
Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect only the classical measurement outcomes, they can be addressed using classical coding techniques: immediately before measurement, each data qubit is redundantly encoded with ancilla qubits, and the resulting bit string is decoded either by post-selection or by majority voting. Unlike conventional readout error mitigation, which corrects only aggregate quantities such as expectation values, this approach operates on individual measurement shots and can therefore produce approximately corrected samples. We present a systematic cross-platform and cross-generation experimental evaluation of repetition-code readout error detection and correction. We benchmark the same protocol on IBM Heron r1-r3 superconducting processors and Quantinuum H1 and H2 trapped-ion processors while independently varying the code distance, hardware generation, and encoding layout. We find that both error detection and correction improve readout fidelity on every device and generation tested, even as the unencoded baseline improves substantially across successive hardware releases. At the same time, the value of additional redundancy depends strongly on the underlying hardware. On superconducting processors, the extra gate errors introduced by the encoding rapidly offset its benefits, whereas on trapped-ion processors the much lower gate error rates allow larger code distances to remain advantageous.
Quantum computation of trapped spectra for nuclear scattering requires resource-efficient circuits and reliable energy inputs. We present a cross-platform benchmark of ancilla-recycled RODEO filtering for a four-dimensional effective Hamiltonian describing a trapped neutron--proton model. Static circuits on IonQ Forte-1 and dynamic circuits on IBM Aachen implement the same ideal ten-cycle all-zero accepted filter using twelve and three active qubits, respectively. Mid-circuit measurement and reset reduce the active qubit count by 75\% while retaining all controlled evolutions. The interleaved IBM peak-center offset from the exact level is −0.017±0.507 keV-0.017 \pm 0.507~\mathrm{keV}−0.017±0.507 keV, compared with −0.568±0.694 keV-0.568 \pm 0.694~\mathrm{keV}−0.568±0.694 keV for IonQ (finite-shot bootstrap uncertainties). At ω=3.7 MeVω=3.7~\mathrm{MeV}ω=3.7 MeV, the modified effective range expansion maps both centers to finite-confinement scattering inputs consistent with the exact reference within propagated uncertainties. Three IBM batches exhibit center variations beyond finite-shot uncertainties (p=0.015p=0.015p=0.015), despite comparatively stable postselection amplitudes. Calibration-derived noisy simulations do not consistently reproduce the measured centers. Complete sampled support enables sample-based quantum diagonalization to recover the exact effective-space level, whereas larger-space simulator tests expose substantial errors from omitted configurations. The calculation validates one finite-confinement input, not a free-space phase shift. This benchmark provides a reusable circuit and validation protocol separating spectral precision, hardware repeatability, and sampled-subspace completeness for multilevel nuclear-scattering calculations.