Efficient self-consistent learning of gate set Pauli noise

• URL: http://arxiv.org/abs/2410.03906v1
• Date: Fri, 4 Oct 2024 20:19:57 GMT
• Title: Efficient self-consistent learning of gate set Pauli noise
• Authors: Senrui Chen, Zhihan Zhang, Liang Jiang, Steven T. Flammia,
• Abstract summary: We study the task of gate set Pauli noise learning, where a set of quantum gates, state preparation, and measurements all suffer from unknown Pauli noise channels with a customized noise ansatz. We show that all learnable information about the gate noise can be learned to relative precision, under mild assumptions on the noise ansatz.
• Score: 6.298222373534273
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding quantum noise is an essential step towards building practical quantum information processing systems. Pauli noise is a useful model that has been widely applied in quantum benchmarking, error mitigation, and error correction. Despite intensive study, most existing works focus on learning Pauli noise channels associated with some specific gates rather than treating the gate set as a whole. A learning algorithm that is self-consistent, complete, and efficient at the same time is yet to be established. In this work, we study the task of gate set Pauli noise learning, where a set of quantum gates, state preparation, and measurements all suffer from unknown Pauli noise channels with a customized noise ansatz. Using tools from algebraic graph theory, we analytically characterize the self-consistently learnable degrees of freedom for Pauli noise models with arbitrary linear ansatz, and design experiments to efficiently learn all the learnable information. Specifically, we show that all learnable information about the gate noise can be learned to relative precision, under mild assumptions on the noise ansatz. We then demonstrate the flexibility of our theory by applying it to concrete physically motivated ansatzs (such as spatially local or quasi-local noise) and experimentally relevant gate sets (such as parallel CZ gates). These results not only enhance the theoretical understanding of quantum noise learning, but also provide a feasible recipe for characterizing existing and near-future quantum information processing devices.

Related papers

• 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)
• Noise-induced shallow circuits and absence of barren plateaus [2.5295633594332334]
  We show that any noise truncates' most quantum circuits to effectively logarithmic depth. We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables.
  arXiv  Detail & Related papers  (2024-03-20T19:00:49Z)
• 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)
• Robust Quantum Gates against Correlated Noise in Integrated Quantum Chips [11.364693110852738]
  We report the experimental realization of robust quantum gates in superconducting quantum circuits. Our work provides a versatile toolbox for achieving noise-resilient complex quantum circuits.
  arXiv  Detail & Related papers  (2024-01-03T16:12:35Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree. We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Efficient learning of the structure and parameters of local Pauli noise channels [1.5229257192293197]
  We present a novel approach for learning Pauli noise channels over n qubits. We achieve our results by leveraging a groundbreaking result by Bresler for efficiently learning Gibbs measures. Our method is efficient both in the number of samples and postprocessing without giving up on other desirable features.
  arXiv  Detail & Related papers  (2023-07-06T12:42:49Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• The learnability of Pauli noise [3.251977404026275]
  We give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates. We experimentally demonstrate noise characterization of IBM's CNOT gate up to 2 unlearnable degrees of freedom.
  arXiv  Detail & Related papers  (2022-06-13T17:58:43Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• 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)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17: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.