Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
arXiv:2408.12199 · doi:10.1038/s41467-025-59198-z
Abstract
The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Recent progress in quantum learning theory prompts a crucial question: can linear properties of a large-qubit circuit with d tunable RZ gates and G-d Clifford gates be efficiently learned from measurement data generated by varying classical inputs? In this work, we prove that the sample complexity scaling linearly in is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. To address this challenge, we propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead. Our results advance two crucial realms in quantum computation: the exploration of quantum algorithms with practical utilities and learning-based quantum system certification. We conduct numerical simulations to validate our proposals across diverse scenarios, encompassing quantum information processing protocols, Hamiltonian simulation, and variational quantum algorithms up to 60 qubits.
Published version in Nature Communications. 61 Pages, 20 figures
References in corpus (47)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Noisy intermediate-scale quantum (NISQ) algorithms
- Improved Simulation of Stabilizer Circuits
- Quantum Error Correction for Quantum Memories
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Logical quantum processor based on reconfigurable atom arrays
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Simulating quantum computation by contracting tensor networks
- Quantum Process Tomography: Resource Analysis of Different Strategies
- The randomized measurement toolbox
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- Ancilla-assisted quantum process tomography
- Quantum certification and benchmarking
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Information-theoretic bounds on quantum advantage in machine learning
- A Neural Decoder for Topological Codes
- Efficient estimation of Pauli observables by derandomization
- Theory of overparametrization in quantum neural networks
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Machine learning non-local correlations
- Quantum Fourier Transform Has Small Entanglement
- Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
- Variational Quantum-Neural Hybrid Eigensolver
- Neural Error Mitigation of Near-Term Quantum Simulations
- Optimising shadow tomography with generalised measurements
- Approximate Autonomous Quantum Error Correction with Reinforcement Learning
- Classical surrogates for quantum learning models
- Realizing a deep reinforcement learning agent discovering real-time feedback control strategies for a quantum system
- Efficient unitary designs with a system-size independent number of non-Clifford gates
- Deep learning of quantum entanglement from incomplete measurements
- Neural-Network Decoders for Measurement Induced Phase Transitions
- Learning quantum circuits of some gates
- Dynamical simulation via quantum machine learning with provable generalization
- Learning quantum states and unitaries of bounded gate complexity
- Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
- Enhanced estimation of quantum properties with common randomized measurements
- Statistical Complexity of Quantum Learning
- Neural-Shadow Quantum State Tomography
- Exponentially improved efficient machine learning for quantum many-body states with provable guarantees
- The power and limitations of learning quantum dynamics incoherently
- Recent Advances for Quantum Neural Networks in Generative Learning