Idling error suppression through gate scheduling

• URL: http://arxiv.org/abs/2607.02031v1
• Date: Thu, 02 Jul 2026 10:57:24 GMT
• Title: Idling error suppression through gate scheduling
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Achieving high-precision quantum computation requires effective suppression of idling errors that occur when qubits remain inactive during waiting periods within a quantum circuit. Conventional mitigation techniques, such as dynamical decoupling, suppress decoherence by periodically refreshing quantum states through the insertion of additional control gates. In this paper, we propose an alternative approach that suppresses idling errors through quantum circuit scheduling without introducing any additional gate operations. By appropriately adjusting the execution timing of quantum gates with scheduling flexibility, we demonstrate through both numerical simulations and hardware experiments that the overall computational accuracy can be significantly influenced and, in many cases, improved. In addition, we analytically derive the density-matrix evolution under idling noise and provide a theoretical framework that explains the observed behavior.

Related papers

• Fidelity bounds for adiabatic gates and other quantum operations with time-dependent dissipation [0.0]
  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.
  arXiv  Detail & Related papers  (2026-06-18T17:15:19Z)
• 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)
• Depth Optimization of Ansatz Circuits for Variational Quantum Algorithms [2.3220521366735247]
  The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms.<n>We show that their depth can be reduced by introducing additional qubits, mid-circuit measurements, and classically controlled operations.<n>In particular, we show that the proposed non-unitary quantum circuits can efficiently represent fluid flow configurations in both laminar and turbulent regimes.
  arXiv  Detail & Related papers  (2025-11-17T11:14:14Z)
• 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)
• 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)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• Error Mitigation in Quantum Computers through Instruction Scheduling [7.0230815242347475]
  Current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. This paper presents TimeStitch, a framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits.
  arXiv  Detail & Related papers  (2021-05-04T20:58:58Z)
• 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.