Skip to content
Preprint

Sound and Efficient Certification of High-Quality Qubit Operations: Theory and Experiment

Aug 2026 · 0 citations · 71 references
Physics

Abstract

Can a high-quality quantum gate be certified when uncharacterized state-preparation and measurement errors are dominant? Can this be achieved with low experimental overhead? Here, we introduce a sound black-box certification protocol for a single-qubit gate based on a small set of fixed, deterministic sequences. From the data, the protocol derives finite-sample bounds on the gate's rotation eigenvalue, a gauge-invariant property. Its phase reveals the accuracy of the rotation angle, while its modulus quantifies the loss of coherence under repeated gate applications. We implement the protocol on a $^{40}\mathrm{Ca}^{+}$ trapped-ion processor and certify the $\sqrt{\mathrm{X}}$-gate rotation eigenvalue using $22\,000$ circuit executions, and demonstrate the robustness of certification to state-preparation and measurement errors by deliberately degrading the readout. Finally, we prove that these spectral constraints imply, up to a physically meaningful unitary change of basis, a rigorous average gate-fidelity lower bound for every time-independent qubit model compatible with the data. In both readout settings, the spectral bounds yield the same fidelity certificate of $99.94(3)\%$ with $99\%$ confidence. Our results establish a new standard for quantum-gate certification by combining soundness and experimental efficiency without requiring trusted reference operations, randomized circuits, or model fitting.

View source

Similar papers

Preprint Jul 2026

Sampling hard circuits with verifiably high fidelity

The construction is a systematic method for promoting a stabilizer state to a magic state while keeping an error-detected fidelity certificate, and is a systematic method for promoting a stabilizer state to a magic state while keeping an error-detected fidelity certificate.

S. Martiel, Jay-U. Chung, A. Seif et al. · 5 citations
Preprint Sep 2026

Experimental validation of a compact fault-tolerant architecture for trapped ions

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, a...

Noah F. Berthusen, Ali Lavasani, Asmae Benhemou et al. · 2 citations
Preprint Aug 2026

Towards fault-tolerance with universal phase-error-transparent gates for high-spin cat codes

This work constructs a universal logical gate set that is error-transparent (ET) to phase errors, and shows how logical measurement and recovery can be constructed from ET operations, and explains why state-preparation cannot be made ET.

K. Onggadinata, Si Yan Koh, Arghya Maity et al. · 0 citations
Preprint Jul 2026

Phase-Sensitive Benchmarking of Composite Quantum Gates with Chiral-Interference Circuits on Quantum Hardware

We construct and experimentally implement compact gate-native circuits that simulate the state-transfer interference underlying three- and four-level chiral-resolution protocols. Both models are encoded in a two-qubit register, with the enantiomer-dependent sign of one of the couplings simulated by a conditional-phase...

G. M. Aleksandrov, N. Vitanov · 0 citations
Preprint Aug 2026

A certified lower bound on the quantum-capacity threshold of the depolarizing channel

The noise threshold below which the qubit depolarizing channel retains positive quantum capacity has been studied since 1996. The classic constructions come with exact finite formulae, but in every reported threshold to date -- most recently the record of Agarwal et al. -- the final step, the sign of the coherent infor...

Artus Krohn-Grimberghe · 1 citation
Preprint Aug 2026

Quantum Circuit for General Unitary: Improved T-count via Block Flattening and Dilation

A Clifford+T quantum circuit construction that approximately implements any classically specified unitary to within error $\epsilon$ and achieves a worst-case $T$-count with leading exponential scaling of $2^{5n/4}$ whenever $\log(1/\epsilon)=\operatorname{poly}(n)$.

Pei Yuan, Sheng-Yu Zhang, Wei Zi · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.