The learnability of Pauli noise

• URL: http://arxiv.org/abs/2206.06362v2
• Date: Fri, 23 Dec 2022 22:14:58 GMT
• Title: The learnability of Pauli noise
• Authors: Senrui Chen, Yunchao Liu, Matthew Otten, Alireza Seif, Bill Fefferman, Liang Jiang
• Abstract summary: 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.
• Score: 3.251977404026275
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today's quantum devices. A well-known issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question of what information about noise is learnable and what is not, which has been unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates, showing that learnable information corresponds to the cycle space of the pattern transfer graph of the gate set, while unlearnable information corresponds to the cut space. This implies the optimality of cycle benchmarking, in the sense that it can learn all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM's CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we give an attempt to characterize the unlearnable information by assuming perfect initial state preparation. However, based on the experimental data, we conclude that this assumption is inaccurate as it yields unphysical estimates, and we obtain a lower bound on state preparation noise.

Related papers

• Efficient self-consistent learning of gate set Pauli noise [6.298222373534273]
  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.
  arXiv  Detail & Related papers  (2024-10-04T20:19:57Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Can Quantum Computers Do Nothing? [44.99833362998488]
  In idling qubits, information can 'leak' into neighbouring qubits, become non-locally distributed, and ultimately inaccessible. No information-theoretic protocol exists to quantify this information loss due to internal dynamics. We implement this protocol in over 3500 experiments carried out across 4 months on IBM's entire Falcon 5.11 series of processors.
  arXiv  Detail & Related papers  (2024-06-24T17:59:45Z)
• 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)
• 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)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Error-Mitigated Quantum Metrology via Virtual Purification [0.0]
  We propose an error-mitigated quantum metrology that can filter out unknown fluctuating noise. We demonstrate that our protocol mitigates systematic errors and recovers superclassical scaling in a practical situation with time-inhomogeneous bias-inducing noise.
  arXiv  Detail & Related papers  (2021-12-03T11:07:50Z)
• 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)
• Fast Estimation of Sparse Quantum Noise [1.933681537640272]
  We present a practical algorithm for estimating the $s$ nonzero Pauli error rates in an $s$-sparse, $n$-qubit Pauli noise channel. We experimentally validate a version of the algorithm that uses simplified Clifford circuits on data from an IBM 14-qubit superconducting device.
  arXiv  Detail & Related papers  (2020-07-15T18:00:01Z)
• 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)
• Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles [65.9694455739978]
  We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. Our analysis reveals that the optimal hypothesis can significantly deviate from the underlying realizability function, depending on the noise characteristics. This implies that classical approaches cannot guarantee a non-trivial regret bound.
  arXiv  Detail & Related papers  (2017-03-03T21:39:56Z)

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.