Fidelity bounds for adiabatic gates and other quantum operations with time-dependent dissipation
- URL: http://arxiv.org/abs/2606.20501v1
- Date: Thu, 18 Jun 2026 17:15:19 GMT
- Title: Fidelity bounds for adiabatic gates and other quantum operations with time-dependent dissipation
- Abstract summary: As quantum-computing platforms are susceptible to noise, the fidelity of quantum operations is limited by decoherence.<n>We show that flux-dependent noise sensitivity, combined with qubit-coupler hybridization, significantly reduces the fidelity of adiabatic controlled-Z gates in superconducting quantum computers.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: As quantum-computing platforms are susceptible to noise, the fidelity of quantum operations is limited by decoherence. Understanding this limitation is crucial for building utility-scale quantum processors. In previous works [Phys. Rev. Lett. 129, 150504 (2022); Quantum 9, 1684 (2025)], we presented analytical formulae for the average gate fidelity of multi-qubit operations under static Markovian noise processes, including operations that temporarily leave the computational subspace. However, some quantum-computing architectures dynamically modulate qubit or coupler frequencies to implement two-qubit gates, e.g., baseband flux gates; such modulation can lead to dissipation rates varying in time. In this Letter, we therefore generalize the fidelity-reduction formulae to encompass time-dependent dissipation. Applying our generalized formula, we obtain a fidelity bound for adiabatic operations and demonstrate that flux-dependent noise sensitivity, combined with qubit-coupler hybridization, significantly reduces the fidelity of adiabatic controlled-Z (CZ) gates in superconducting quantum computers. Our work thus provides essential theoretical tools for evaluating error budgets and optimizing the design of quantum operations in tunable quantum-computing architectures, and may also find applications in quantum-sensing and quantum-communication protocols that are affected by time-dependent dissipation.
Related papers
- Idling error suppression through gate scheduling [0.0]
idling errors occur when qubits remain inactive during waiting periods within a quantum circuit.<n>We propose an alternative approach that suppresses idling errors through quantum circuit scheduling without introducing any additional gate operations.
arXiv Detail & Related papers (2026-07-02T10:57:24Z) - Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
arXiv Detail & Related papers (2026-01-11T11:17:37Z) - Fast quantum interconnects via constant-rate entanglement distillation [0.0]
We develop constant-rate entanglement distillation methods for quantum interconnects.
We prove the scheme has constant-rate in expectation and numerically optimize to achieve low practical overhead.
We find our optimized schemes outperform existing computationally efficient quantum interconnect schemes by an order of magnitude in relevant regimes.
arXiv Detail & Related papers (2024-08-28T16:54:54Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Impact of decoherence on the fidelity of quantum gates leaving the computational subspace [0.0]
We show the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators.<n>These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.
arXiv Detail & Related papers (2023-02-27T15:31:52Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - A variational quantum eigensolver for dynamic correlation functions [0.9176056742068814]
We show how the calculation of zero-temperature dynamic correlation functions can be recast into a modified VQE algorithm.
This allows for important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis.
We believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.
arXiv Detail & Related papers (2021-05-04T18:52:45Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.