Experimental characterization of the Toffoli gate via channel spectrum benchmarking
- URL: http://arxiv.org/abs/2512.20545v1
- Date: Tue, 23 Dec 2025 17:38:57 GMT
- Title: Experimental characterization of the Toffoli gate via channel spectrum benchmarking
- Authors: D. K. Korliakov, B. I. Bantysh, A. S. Borisenko, I. V. Zalivako, E. O. Kiktenko,
- Abstract summary: Channel spectrum benchmarking (CSB) provides a robust framework for characterizing quantum gate fidelities.<n>We introduce an extended CSB model together with a fidelity estimate interval (FEI) -- an interval-valued estimate of the target gate fidelity.<n>We further validate the protocol on a trapped-ion quantum processor by benchmarking two implementations of the three-qubit Toffoli gate.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Channel spectrum benchmarking (CSB) provides a robust framework for characterizing quantum gate fidelities while remaining insensitive to state preparation and measurement (SPAM) errors. Yet, current CSB implementations encounter fundamental challenges when reconstructing noisy eigenvalues, particularly in the presence of spectral degeneracies and off-diagonal noise components in the target gate's eigenbasis. These issues become especially pronounced in the strong noise regime for gates with fidelities around $90\%$. To address these limitations, we introduce an extended CSB model together with a fidelity estimate interval (FEI) -- an interval-valued estimate of the target gate fidelity. Numerical simulation demonstrates that FEI remains sufficiently narrow, with its midpoint reliably approximating the true fidelity. We further validate the protocol on a trapped-ion quantum processor by benchmarking two implementations of the three-qubit Toffoli gate. The results reveal a clear advantage of the qutrit-based implementation over its qubit-based counterpart.
Related papers
- Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
arXiv Detail & Related papers (2026-01-10T02:36:03Z) - Easier randomizing gates provide more accurate fidelity estimation [0.1759008116536278]
We show that the standard approach of interleaved randomized benchmarking (IRB) can produce highly inaccurate and even physically impossible estimates for the error on the interleaved gate.<n>We also show that interleaved benchmarking performed with cycle benchmarking, which randomizes with single qubit Pauli gates, provides dramatically reduced systematic uncertainty.
arXiv Detail & Related papers (2025-12-31T09:32:19Z) - Fidelity sweet spot in transmon qubit rings under strong connectivity noise [4.302324547544988]
We investigate the fidelity of quantum operations in transmon qubit systems, focusing on both SWAP and general gate operations.<n>Our results reveal a distinct fidelity sweet spot that emerges even under strong noise, indicating that optimal circuit depth can enhance gate performance.<n>We introduce a supervised machine-learning framework capable of predicting the positions of fidelity sweet spots, enabling efficient optimization of circuit durations across different device configurations.
arXiv Detail & Related papers (2025-11-11T13:59:54Z) - Characterizing Superconducting Qubits using Averaged Circuit Eigenvalue Sampling [0.0]
ACES protocol is used to characterize two coupled superconducting qubits.<n>We verify the accuracy of the protocol by comparing the predicted gate fidelities to that extracted from conventional benchmarking approaches.
arXiv Detail & Related papers (2025-10-02T18:03:38Z) - Context-aware gate set tomography: Improving the self-consistent characterization of trapped-ion universal gate sets by leveraging non-Markovianity [45.88028371034407]
Gate set tomography ( GST) estimates the complete set of noisy quantum gates, state preparations, and measurements.<n>In its original incarnation, GST improves the estimation precision by applying the gates sequentially.<n>We show that context dependence can be incorporated in the parametrization of the gate set, allowing us to reduce the sampling cost of GST.
arXiv Detail & Related papers (2025-07-03T11:37:36Z) - On the Convergence of DP-SGD with Adaptive Clipping [56.24689348875711]
Gradient Descent with gradient clipping is a powerful technique for enabling differentially private optimization.<n>This paper provides the first comprehensive convergence analysis of SGD with quantile clipping (QC-SGD)<n>We show how QC-SGD suffers from a bias problem similar to constant-threshold clipped SGD but can be mitigated through a carefully designed quantile and step size schedule.
arXiv Detail & Related papers (2024-12-27T20:29:47Z) - Bayesian Quantum Amplitude Estimation [46.03321798937855]
We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
arXiv Detail & Related papers (2024-12-05T18:09:41Z) - Spectator-Aware Frequency Allocation in Tunable-Coupler Quantum Architectures [2.056099393664103]
We present design constraints for SNAIL-based superconducting quantum modules.<n>We analyze the impact of frequency crowding on gate fidelity as the radix of the module increases.<n>We demonstrate scalable frequency allocation strategies that minimize spectator-induced errors.
arXiv Detail & Related papers (2024-09-26T20:15:45Z) - Benchmarking universal quantum gates via channel spectrum [0.0]
Noise remains the major obstacle to scalable quantum computation.
We propose a method to infer the noise properties of the target gate, including process fidelity, fidelity, and some unitary parameters, from the eigenvalues of its noisy channel.
Our method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems.
arXiv Detail & Related papers (2023-01-05T13:18:19Z) - Analytical and experimental study of center line miscalibrations in M\o
lmer-S\o rensen gates [51.93099889384597]
We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate.
We compute the gate evolution operator which allows us to obtain relevant key properties.
We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
arXiv Detail & Related papers (2021-12-10T10:56:16Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.