Nearly query-optimal classical shadow estimation of unitary channels

Abstract

Classical shadow estimation (CSE) is a powerful tool for learning the properties of quantum states and quantum processes. Here we consider the CSE task for quantum unitary channels. By querying an unknown unitary channel $\mathcal{U}$ multiple times in quantum experiments, the goal is to learn a classical description from which one can accurately predict many different linear properties of the channel, i.e., the expectation values of arbitrary observables measured on the output of $\mathcal{U}$ upon arbitrary input states. Based on collective measurements on multiple systems, we propose a query efficient protocol for this task, whose query complexity has a quadratic advantage over the previous best approach for this problem, and almost saturates the information-theoretic lower bound. To further enhance practicality, we also present a variant protocol using only single-copy measurements, which still offers much better query performance than previous protocols that do not use quantum memory, and can serve as a key subroutine for learning an arbitrary unknown Hamiltonian from dynamics. In addition to linear properties of unitary channels, our protocol can also be applied to simultaneously predict many non-linear properties, such as out-of-time-ordered correlators.

13+25 pages, 3 figures, and 5 tables; published in PRX Quantum

References in corpus (62)

• Quantum Machine Learning
• Quantum sensing
• Advances in Quantum Metrology
• Variational Quantum Algorithms
• Quantum machine learning in feature Hilbert spaces
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
• Quantum advantage in learning from experiments
• Quantum process tomography of a controlled-NOT gate
• Generalization in quantum machine learning from few training data
• The randomized measurement toolbox
• Information-theoretic bounds on quantum advantage in machine learning
• Suppressing qubit dephasing using real-time Hamiltonian estimation
• Generating random density matrices
• Multiqubit Clifford groups are unitary 3-designs
• Learning a local Hamiltonian from local measurements
• Learning Quantum Systems
• Direct Characterization of Quantum Dynamics
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Theory of quantum system certification: a tutorial
• Scrambling Dynamics and Out-of-Time Ordered Correlators in Quantum Many-Body Systems: a Tutorial
• Random matrix techniques in quantum information theory
• Probing scrambling using statistical correlations between randomized measurements
• Quantum Chaos is Quantum
• Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
• Deterministic realization of collective measurements via photonic quantum walks
• Theoretical and Experimental Perspectives of Quantum Verification
• Out-of-distribution generalization for learning quantum dynamics
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Approaching optimal entangling collective measurements on quantum computing platforms
• Information Scrambling in Quantum Neural Networks
• Speed limits and locality in many-body quantum dynamics
• Asymptotics of random density matrices
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Quantum scrambling with classical shadows
• Shadow process tomography of quantum channels
• Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
• Hamiltonian simulation with random inputs
• Universally Fisher-Symmetric Informationally Complete Measurements
• Projected Least-Squares Quantum Process Tomography
• Robust and Efficient Hamiltonian Learning
• Optimal universal programming of unitary gates
• Dynamical simulation via quantum machine learning with provable generalization
• Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
• Learning quantum states and unitaries of bounded gate complexity
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Performance analysis of multi-shot shadow estimation
• Supervised learning of time-independent Hamiltonians for gate design
• Distributed quantum inner product estimation
• Practical Black Box Hamiltonian Learning
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Minimizing back-action through entangled measurements
• Query-optimal estimation of unitary channels in diamond distance
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
• Learning shallow quantum circuits
• The advantage of quantum control in many-body Hamiltonian learning
• Enhanced estimation of quantum properties with common randomized measurements
• Sample-optimal classical shadows for pure states
• Structure learning of Hamiltonians from real-time evolution
• Experimental Realization of Genuine Three-copy Collective Measurements for Optimal Information Extraction
• Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States