Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix

Abstract

Learning about physical systems from quantum-enhanced experiments, relying on a quantum memory and quantum processing, can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum advantages have been established for a variety of state learning tasks, quantum process learning allows for comparable advantages only with a careful problem formulation and is less understood. We establish an exponential quantum advantage for learning an unknown $n$-qubit quantum process $\mathcal{N}$. We show that a quantum memory allows to efficiently solve the following tasks: (a) learning the Pauli transfer matrix of an arbitrary $\mathcal{N}$, (b) predicting expectation values of bounded Pauli-sparse observables measured on the output of an arbitrary $\mathcal{N}$ upon input of a Pauli-sparse state, and (c) predicting expectation values of arbitrary bounded observables measured on the output of an unknown $\mathcal{N}$ with sparse Pauli transfer matrix upon input of an arbitrary state. With quantum memory, these tasks can be solved using linearly-in-$n$ many copies of the Choi state of $\mathcal{N}$, and even time-efficiently in the case of (b). In contrast, any learner without quantum memory requires exponentially-in-$n$ many queries, even when querying $\mathcal{N}$ on subsystems of adaptively chosen states and performing adaptively chosen measurements. In proving this separation, we extend existing shadow tomography upper and lower bounds from states to channels via the Choi-Jamiolkowski isomorphism. Moreover, we combine Pauli transfer matrix learning with polynomial interpolation techniques to develop a procedure for learning arbitrary Hamiltonians, which may have non-local all-to-all interactions, from short-time dynamics. Our results highlight the power of quantum-enhanced experiments for learning highly complex quantum dynamics.

arXiv comment30+31 pages, 2+1 figures; V2 includes small corrections to Remark 4.3 and Lemma 6.1 as well improvements to the presentation

References in corpus (45)

• Quantum Computing in the NISQ era and beyond
• Predicting Many Properties of a Quantum System from Very Few Measurements
• The power of quantum neural networks
• General Entanglement Breaking Channels
• Quantum advantage in learning from experiments
• Generalization in quantum machine learning from few training data
• Information-theoretic bounds on quantum advantage in machine learning
• Does a single eigenstate encode the full Hamiltonian?
• Provably efficient machine learning for quantum many-body problems
• Sample-optimal tomography of quantum states
• Learning a local Hamiltonian from local measurements
• Determining a local Hamiltonian from a single eigenstate
• Sample-efficient learning of quantum many-body systems
• Efficient measure for the expressivity of variational quantum algorithms
• Efficient estimation of Pauli channels
• Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
• Quantum Algorithmic Measurement
• Introduction to Quantum Gate Set Tomography
• Hamiltonian Tomography via Quantum Quench
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Out-of-distribution generalization for learning quantum dynamics
• On the statistical complexity of quantum circuits
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Quantum advantages for Pauli channel estimation
• Shadow process tomography of quantum channels
• Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
• Robust and Efficient Hamiltonian Learning
• Fast Estimation of Sparse Quantum Noise
• Classical shadow tomography for continuous variables quantum systems
• Pauli error estimation via Population Recovery
• Structural risk minimization for quantum linear classifiers
• Pseudo-dimension of quantum circuits
• An approximate description of quantum states
• Practical Black Box Hamiltonian Learning
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Online Learning of Quantum States
• Learning quantum many-body systems from a few copies
• Effects of quantum resources on the statistical complexity of quantum circuits
• Scalably learning quantum many-body Hamiltonians from dynamical data
• The Learnability of Quantum States
• Foundations for learning from noisy quantum experiments
• Binary Classification with Classical Instances and Quantum Labels
• Rademacher complexity of noisy quantum circuits
• A Hierarchy for Replica Quantum Advantage
• Learning quantum processes without input control

Cited by in corpus (14)

• Learning quantum states and unitaries of bounded gate complexity
• Quantum learning advantage on a scalable photonic platform
• The power and limitations of learning quantum dynamics incoherently
• Structure learning of Hamiltonians from real-time evolution
• Quantum Tensor Product Decomposition from Choi State Tomography
• Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
• Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States
• Learning unitaries with quantum statistical queries
• Single-copy stabilizer testing
• Learning Quantum Processes with Quantum Statistical Queries
• Fast generation of Pauli transfer matrices utilizing tensor product structure
• Nearly query-optimal classical shadow estimation of unitary channels
• Learning the structure of any Hamiltonian from minimal assumptions
• Quantifying Irreversibility via Bayesian Subjectivity for Classical & Quantum Linear Maps