Efficient learning of the structure and parameters of local Pauli noise channels

• URL: http://arxiv.org/abs/2307.02959v1
• Date: Thu, 6 Jul 2023 12:42:49 GMT
• Title: Efficient learning of the structure and parameters of local Pauli noise channels
• Authors: Cambyse Rouz\'e, Daniel Stilck Fran\c{c}a
• Abstract summary: 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.
• Score: 1.5229257192293197
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The unavoidable presence of noise is a crucial roadblock for the development of large-scale quantum computers and the ability to characterize quantum noise reliably and efficiently with high precision is essential to scale quantum technologies further. Although estimating an arbitrary quantum channel requires exponential resources, it is expected that physically relevant noise has some underlying local structure, for instance that errors across different qubits have a conditional independence structure. Previous works showed how it is possible to estimate Pauli noise channels with an efficient number of samples in a way that is robust to state preparation and measurement errors, albeit departing from a known conditional independence structure. We present a novel approach for learning Pauli noise channels over n qubits that addresses this shortcoming. Unlike previous works that focused on learning coefficients with a known conditional independence structure, our method learns both the coefficients and the underlying structure. We achieve our results by leveraging a groundbreaking result by Bresler for efficiently learning Gibbs measures and obtain an optimal sample complexity of O(log(n)) to learn the unknown structure of the noise acting on n qubits. This information can then be leveraged to obtain a description of the channel that is close in diamond distance from O(poly(n)) samples. Furthermore, our method is efficient both in the number of samples and postprocessing without giving up on other desirable features such as SPAM-robustness, and only requires the implementation of single qubit Cliffords. In light of this, our novel approach enables the large-scale characterization of Pauli noise in quantum devices under minimal experimental requirements and assumptions.

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)
• Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness [0.0]
  We show the natural robustness of quantum statistical queries for learning quantum processes. We adapt a learning algorithm for constant-depth quantum circuits to the quantum statistical query setting. We prove that pseudorandom unitaries (PRUs) cannot be constructed using circuits of constant depth.
  arXiv  Detail & Related papers  (2024-05-20T14:55:20Z)
• 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)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.412425180760368]
  We propose a robust shallow shadows protocol for characterizing quantum states on current quantum computing platforms. Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
  arXiv  Detail & Related papers  (2024-02-27T21:53:32Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• 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)
• Using deep learning to understand and mitigate the qubit noise environment [0.0]
  We propose to address the challenge of extracting accurate noise spectra from time-dynamics measurements on qubits. We demonstrate a neural network based methodology that allows for extraction of the noise spectrum associated with any qubit surrounded by an arbitrary bath. Our results can be applied to a wide range of qubit platforms and provide a framework for improving qubit performance.
  arXiv  Detail & Related papers  (2020-05-03T17:13: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.