Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime

• URL: http://arxiv.org/abs/2405.07720v3
• Date: Mon, 10 Feb 2025 07:19:21 GMT
• Title: Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
• Authors: Kento Tsubouchi, Yosuke Mitsuhashi, Kunal Sharma, Nobuyuki Yoshioka,
• Abstract summary: Twirling noise affecting quantum gates is essential in understanding and controlling errors.<n>We show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise.<n>These findings enable us to mitigate errors in non-Clifford operations with minimal sampling overhead.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Twirling noise affecting quantum gates is essential in understanding and controlling errors, but applicable operations to noise are usually restricted by symmetries inherent in quantum gates. In this work, we propose symmetric Clifford twirling, a Clifford twirling utilizing only symmetric Clifford operators that commute with certain Pauli subgroups. We fully characterize how each Pauli noise is converted through the twirling and show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise. Moreover, we provide numerical demonstrations for highly structured circuits, such as Trotterized Hamiltonian simulation circuits, that noise effect on typical observables can be described by the global white noise. We further demonstrate that symmetric Clifford twirling and its hardware-efficient variant using only a local symmetric Clifford operators acting on a few logical qubits can significantly accelerate the scrambling. These findings enable us to mitigate errors in non-Clifford operations with minimal sampling overhead in the early stages of fault-tolerant quantum computing.

Related papers

• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary. We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
  We show that for a broad class of error models these concerns are unwarranted. We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
  arXiv  Detail & Related papers  (2025-03-07T21:18:59Z)
• Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
  We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors. We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
  arXiv  Detail & Related papers  (2024-03-28T19:29:12Z)
• Theory of quantum error mitigation for non-Clifford gates [0.0]
  Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits. How well such techniques work is thought to depend strongly on how noisy the underlying gates are. This paper generalizes these techniques to non-Clifford gates.
  arXiv  Detail & Related papers  (2024-03-27T17:36:35Z)
• Pseudo Twirling Mitigation of Coherent Errors in non-Clifford Gates [0.0]
  We introduce, analyzes, and experimentally demonstrate a technique called Pseudo Twirling' to address coherent errors in general gates and circuits. We experimentally showcase that integrating pseudo twirling with a quantum error mitigation method called Adaptive KIK' enables the simultaneous mitigation of both noise and coherent errors in non-Clifford gates.
  arXiv  Detail & Related papers  (2024-01-17T08:14:59Z)
• Simulating quantum circuit expectation values by Clifford perturbation theory [0.0]
  We consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations. We introduce a perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approxing expectation values of large near-Clifford circuits.
  arXiv  Detail & Related papers  (2023-06-07T21:42:10Z)
• Quantum Noise as a Symmetry-Breaking Field [0.8504685056067142]
  We investigate the effect of quantum noise on the measurement-induced quantum phase transition in monitored random quantum circuits. Using the efficient simulability of random Clifford circuits, we find that the transition is broadened into a crossover. We show that a mapping to a classical statistical mechanics problem accounts for the main features of the random circuit phase diagram.
  arXiv  Detail & Related papers  (2022-08-29T20:05:09Z)
• High-Order Qubit Dephasing at Sweet Spots by Non-Gaussian Fluctuators: Symmetry Breaking and Floquet Protection [55.41644538483948]
  We study the qubit dephasing caused by the non-Gaussian fluctuators. We predict a symmetry-breaking effect that is unique to the non-Gaussian noise.
  arXiv  Detail & Related papers  (2022-06-06T18:02:38Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Learning Noise via Dynamical Decoupling of Entangled Qubits [49.38020717064383]
  Noise in entangled quantum systems is difficult to characterize due to many-body effects involving multiple degrees of freedom. We develop and apply multi-qubit dynamical decoupling sequences that characterize noise that occurs during two-qubit gates.
  arXiv  Detail & Related papers  (2022-01-26T20:22:38Z)
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors [0.7299729677753102]
  We present a protocol for learning and inverting a sparse noise model that is able to capture correlated noise and scales to large quantum devices. These advances allow us to demonstrate PEC on a superconducting quantum processor with crosstalk errors.
  arXiv  Detail & Related papers  (2022-01-24T18:40:43Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.