Continuous Noise Model for Quantum Circuits

• URL: http://arxiv.org/abs/2604.26008v1
• Date: Tue, 28 Apr 2026 18:00:03 GMT
• Title: Continuous Noise Model for Quantum Circuits
• Abstract summary: We study a continuous coherent noise model for quantum circuits and compare it with a discrete Pauli model.<n>The focus is on small coherent gate errors that build up across circuit depth.<n>Results show that continuous coherent noise can degrade logical performance more strongly than Pauli noise.
• Score: 0.6335848702857038
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and relaxation, which is irreversible. Current studies focus on coherent gate errors caused by control misalignment, which accumulate with circuit depth but can, in principle, be corrected. This work studies a continuous coherent noise model for quantum circuits and compares it with a discrete Pauli model. The focus is on small coherent gate errors that build up across circuit depth. These errors are modeled as random rotations on the Bloch sphere using a von Mises-Fisher distribution. In the small-angle limit, the model reduces to an isotropic Gaussian distribution. We test the model on quantum error-correction circuits based on the [[5,1,3]] and [[7,1,3]] codes. A variant of Grover's search circuit with different qubit counts is also examined. To enable fair comparison, we introduce a model-independent matching scheme. Pauli and continuous noise channels are aligned using the binary entropy at readout. This isolates the effect of noise structure at fixed uncertainty. An approximate analytical method for coherent error propagation is also developed. The method tracks error distributions through Clifford circuits without full Monte Carlo sampling. It reduces simulation cost while preserving accuracy for circuit-level error estimates. The approximation is validated against brute-force simulations, identifying its regime of validity with Clifford circuits and limits under error correction. Our results show that continuous coherent noise can degrade logical performance more strongly than Pauli noise. They also clarify when simplified propagation models succeed and when they break down.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Efficient Quantum Error Mitigation for Unitary k-Designs [0.0]
  noisy hardware makes quantum circuits prone to a myriad of error sources.<n>We use unitary k-design Pauli support distributions to estimate circuit-wide depolarization.<n>We show that the method effectively reduces gate-based error for unitary k-designs without incurring any two-qubit gate overhead.
  arXiv  Detail & Related papers  (2026-06-02T16:52:08Z)
• Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits [2.932287734903261]
  We introduce a hybrid Gaussian-exponential extrapolation scheme tailored for quantum circuits with periodic structure.<n>For moderate to large circuit depths, the hybrid model yields measurable reductions in bias relative to previous extrapolation variants.
  arXiv  Detail & Related papers  (2026-05-28T02:01:03Z)
• Correcting coherent quantum errors by going with the flow [0.0]
  We show that the logical qubit performance beyond distance 3 for correlated single-qubit Hamiltonian noise models (i.e., global errant qubit rotations) matches the performance of Pauli noise model with the same process fidelity (fidelity after one application)<n>In a more general circuit model of noise, correlations may add constructively within syndrome extraction rounds but Pauli frame randomization from passive error correction mitigates this effect across multiple rounds.
  arXiv  Detail & Related papers  (2026-02-24T16:39:14Z)
• Color code thresholds under circuit-level noise beyond the Pauli framework [0.0]
  A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits.<n>This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering Pauli noise models.<n>We extend circuit-level noise beyond the Pauli framework by estimating the threshold of the color code under more general noise models.
  arXiv  Detail & Related papers  (2025-11-07T21:24:51Z)
• Randomized term grouping over physical law on digital quantum simulation [0.0]
  We introduce a randomized algorithm based on qDrift to compute Hamiltonian dynamics on digital quantum computers.<n>We frame it as physDrift because conservation laws in physics are obeyed during evolution of arbitrary quantum states.
  arXiv  Detail & Related papers  (2023-09-24T13:15:39Z)
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation [0.0]
  We develop a recipe for mitigating quantum gate errors for variational algorithms using zero-noise extrapolation. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. We find that the estimated energy in the variational approach is approximately linear with respect to the circuit error sum.
  arXiv  Detail & Related papers  (2023-07-20T18:00:03Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• 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.