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

• URL: http://arxiv.org/abs/2405.07720v1
• Date: Mon, 13 May 2024 13:14:01 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. We propose symmetric Clifford twirling, a twirling utilizing only symmetric Clifford operators that commute with certain Pauli subgroups. We show that certain Pauli noise can be scrambled to a noise exponentially close to the global white noise.
• 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 Letter, 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. We further demonstrate that the effective noise of some highly structured circuits, such as Trotterized Hamiltonian simulation circuits, is scrambled to global white noise, and even a single use of CNOT gate 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, where executing non-Clifford operations is expected to be significantly more challenging than Clifford operations. Furthermore, they offer new insights into various fields of physics where randomness and symmetry play crucial roles.

Related papers

• Polynomial-Time Classical Simulation of Noisy Circuits with Naturally Fault-Tolerant Gates [0.22499166814992438]
  We show that there is no quantum advantage at large depths with realistically noisy Clifford circuits. The key insight behind the algorithm is that interspersed noise causes a decay of long-range entanglement. To prove our results, we merge techniques from percolation theory with tools from Pauli path analysis.
  arXiv  Detail & Related papers  (2024-11-04T19:11:58Z)
• 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)
• 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)
• 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)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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)
• Benchmarking near-term quantum computers via random circuit sampling [3.48887080077816]
  We develop an algorithm that can sample-efficiently estimate the total amount of noise induced by a layer of arbitrary non-Clifford gates. Our algorithm is inspired by Google's quantum supremacy experiment and is based on random circuit sampling.
  arXiv  Detail & Related papers  (2021-05-11T17:49:16Z)
• 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)

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.