Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization

• URL: http://arxiv.org/abs/2501.17243v1
• Date: Tue, 28 Jan 2025 19:02:52 GMT
• Title: Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization
• Authors: Scott E. Smart, Alexander Jürgens, Joseph Peetz, Prineha Narang,
• Abstract summary: We present a procedure for learning a class of random unitary channels on a quantum computer. Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
• Score: 41.94295877935867
• License:
• Abstract: Random (mixed) unitary channels describe an important subset of quantum channels, which are commonly used in quantum information, noise modeling, and quantum error mitigation. Despite their usefulness, there is substantial complexity in characterizing or identifying generic random unitary channels. We present a procedure for learning a class of random unitary channels on orthogonal unitary bases on a quantum computer utilizing Pauli learning and a contracted quantum learning procedure. Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels. We demonstrate our approach for varying degrees of noise and investigate the scalability of these approaches, particularly with sparse noise models.

Related papers

• Noise-Aware Mixed-State Quantum Computation via Parameterized Quantum Channels [0.0]
  We discuss the generalization strategies for controlling quantum channels and their practical realizations. We describe a simple example of application in the context of error mitigation, where the control parameters for the quantum channels are optimized in the presence of noise.
  arXiv  Detail & Related papers  (2025-02-04T13:50:21Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Learning unitaries with quantum statistical queries [0.0]
  We propose several algorithms for learning unitary operators from quantum statistical queries (QSQs) Our methods hinge on a novel technique for estimating the Fourier mass of a unitary on a subset of Pauli strings with a single quantum statistical query. We show that quantum statistical queries lead to an exponentially larger sample complexity for certain tasks, compared to separable measurements to the Choi-Jamiolkowski state.
  arXiv  Detail & Related papers  (2023-10-03T17:56:07Z)
• Efficient information recovery from Pauli noise via classical shadow [6.689075863602204]
  We introduce an efficient algorithm that can recover information from quantum states under Pauli noise. For a local and bounded-degree observable, only partial knowledge of the channel is required to recover the ideal information. As a notable application, our method can be severed as a sample-efficient error mitigation scheme for Clifford circuits.
  arXiv  Detail & Related papers  (2023-05-06T23:34:13Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)

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.