Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
Not on the map. Why?
Abstract (arXiv)
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 N. We show that a quantum memory allows to efficiently solve the following tasks: (a) learning the Pauli transfer matrix of an arbitrary N, (b) predicting expectation values of bounded Pauli-sparse observables measured on the output of an arbitrary N upon input of a Pauli-sparse state, and (c) predicting expectation values of arbitrary bounded observables measured on the output of an unknown 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 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 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.
Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). Builds on 27 of its 81 references that are in the map. First posted on arXiv 8 Dec 2022.
Builds on
27 of 81 references.
References · 27
- 2020The power of quantum neural networkscited by 377
- 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 229
- 2021Generalization in quantum machine learning from few training datacited by 214
- 2021Quantum advantage in learning from experimentscited by 186
- 2021Information-theoretic bounds on quantum advantage in machine learningcited by 95
- 2021Provably efficient machine learning for quantum many-body problemscited by 91
- 2021Encoding-dependent generalization bounds for parametrized quantum circuitscited by 81
- 2016Efficient quantum tomography IIcited by 54
- 2021Exponential separations between learning with and without quantum memorycited by 50
- 2022Out-of-distribution generalization for learning quantum dynamicscited by 49
- 2018Online Learning of Quantum Statescited by 37
- 2020Sample-efficient learning of quantum many-body systemscited by 36
15 more
- 2022Learning to predict arbitrary quantum processescited by 34
- 2020Pseudo-dimension of quantum circuitscited by 30
- 2021On the statistical complexity of quantum circuitscited by 25
- 2021Structural risk minimization for quantum linear classifierscited by 24
- 2022Learning many-body Hamiltonians with Heisenberg-limited scalingcited by 22
- 2018Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problemcited by 16
- 2021A Hierarchy for Replica Quantum Advantagecited by 16
- 2021Sample Complexity of Learning Parametric Quantum Circuitscited by 15
- 2022Practical Black Box Hamiltonian Learningcited by 15
- 2022The Complexity of NISQcited by 13
- 2022Adaptive Online Learning of Quantum Statescited by 12
- 2022Foundations for learning from noisy quantum experimentscited by 11
- 2021Effects of quantum resources on the statistical complexity of quantum circuitscited by 9
- 2022Scalably learning quantum many-body Hamiltonians from dynamical datacited by 7
- 2020Binary Classification with Classical Instances and Quantum Labelscited by 5
Built on by
Citing papers per year: 2023: 9; 2024: 8; 2025: 3; 2026: 2.
22 papers.
Sort:
- 2023A survey on the complexity of learning quantum statescited by 31
- 2023Learning quantum states and unitaries of bounded gate complexitycited by 15
- 2023The power and limitations of learning quantum dynamics incoherentlycited by 12
- 2025A Primer on Quantum Machine Learningcited by 9
- 2024Structure learning of Hamiltonians from real-time evolutioncited by 8
- 2023Tight bounds on Pauli channel learning without entanglementcited by 7
- 2023Classical Verification of Quantum Learningcited by 6
- 2023Transition Role of Entangled Data in Quantum Machine Learningcited by 5
- 2023Learning unitaries with quantum statistical queriescited by 5
- 2023Learning Quantum Processes with Quantum Statistical Queriescited by 4
- 2024Hamiltonian Property Testingcited by 4
- 2024Learning k-body Hamiltonians via compressed sensingcited by 4
10 more
- 2024Learning the structure of any Hamiltonian from minimal assumptionscited by 4
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scalingcited by 3
- 2024An optimal tradeoff between entanglement and copy complexity for state tomographycited by 2
- 2024Simple algorithms to test and learn local Hamiltonianscited by 2
- 2026A PAC-Bayesian approach to generalization for quantum modelscited by 2
- 2024Testing classical properties from quantum datacited by 1
- 2026Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approachcited by 1
- 2023Efficient information recovery from Pauli noise via classical shadowcited by 0
- 2024Adaptivity can help exponentially for shadow tomographycited by 0
- 2025Optimal certification of constant-local Hamiltonianscited by 0
- 2026A PAC-Bayesian approach to generalization for quantum models24 Mar 2026
- 2026Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach20 Feb 2026
- 2025Optimal certification of constant-local Hamiltonians10 Dec 2025
- 2025A Primer on Quantum Machine Learning20 Nov 2025
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scaling17 Feb 2025
- 2024Adaptivity can help exponentially for shadow tomography26 Dec 2024
- 2024Testing classical properties from quantum data19 Nov 2024
- 2024Learning the structure of any Hamiltonian from minimal assumptions29 Oct 2024
- 2024Learning k-body Hamiltonians via compressed sensing24 Oct 2024
- 2024Structure learning of Hamiltonians from real-time evolution30 Apr 2024
- 2024Simple algorithms to test and learn local Hamiltonians9 Apr 2024
- 2024Hamiltonian Property Testing5 Mar 2024
10 more
- 2024An optimal tradeoff between entanglement and copy complexity for state tomography26 Feb 2024
- 2023Learning quantum states and unitaries of bounded gate complexity30 Oct 2023
- 2023Learning unitaries with quantum statistical queries3 Oct 2023
- 2023Learning Quantum Processes with Quantum Statistical Queries3 Oct 2023
- 2023Tight bounds on Pauli channel learning without entanglement23 Sep 2023
- 2023Classical Verification of Quantum Learning8 Jun 2023
- 2023Transition Role of Entangled Data in Quantum Machine Learning6 Jun 2023
- 2023A survey on the complexity of learning quantum states31 May 2023
- 2023Efficient information recovery from Pauli noise via classical shadow6 May 2023
- 2023The power and limitations of learning quantum dynamics incoherently22 Mar 2023
- 2023A survey on the complexity of learning quantum statescited by 31
- 2023Learning quantum states and unitaries of bounded gate complexitycited by 15
- 2023The power and limitations of learning quantum dynamics incoherentlycited by 12
- 2025A Primer on Quantum Machine Learningcited by 9
- 2024Structure learning of Hamiltonians from real-time evolutioncited by 8
- 2023Tight bounds on Pauli channel learning without entanglementcited by 7
- 2023Classical Verification of Quantum Learningcited by 6
- 2023Transition Role of Entangled Data in Quantum Machine Learningcited by 5
- 2023Learning unitaries with quantum statistical queriescited by 5
- 2023Learning Quantum Processes with Quantum Statistical Queriescited by 4
- 2024Hamiltonian Property Testingcited by 4
- 2024Learning k-body Hamiltonians via compressed sensingcited by 4
12 most cited of 22 All 22 (JSON)
- 2026A PAC-Bayesian approach to generalization for quantum models24 Mar 2026
- 2026Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach20 Feb 2026
- 2025Optimal certification of constant-local Hamiltonians10 Dec 2025
- 2025A Primer on Quantum Machine Learning20 Nov 2025
- 2025Ansatz-free Hamiltonian learning with Heisenberg-limited scaling17 Feb 2025
- 2024Adaptivity can help exponentially for shadow tomography26 Dec 2024
- 2024Testing classical properties from quantum data19 Nov 2024
- 2024Learning the structure of any Hamiltonian from minimal assumptions29 Oct 2024
- 2024Learning k-body Hamiltonians via compressed sensing24 Oct 2024
- 2024Structure learning of Hamiltonians from real-time evolution30 Apr 2024
- 2024Simple algorithms to test and learn local Hamiltonians9 Apr 2024
- 2024Hamiltonian Property Testing5 Mar 2024
12 newest of 22 All 22 (JSON)