Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States

Abstract

We introduce a new approach to learn Hamiltonians through a resource that we call the pseudo-Choi state, which encodes the Hamiltonian in a state using a procedure that is analogous to the Choi-Jamiolkowski isomorphism. We provide an efficient method for generating these pseudo-Choi states by querying a time evolution unitary of the form $e^{-iHt}$ and its inverse, and show that for a Hamiltonian with $M$ terms the Hamiltonian coefficients can be estimated via classical shadow tomography within error $\epsilon$ in the $2$-norm using $\tilde{O}\left(\frac{M}{t^2{\epsilon }^2}\right)$ queries to the state preparation protocol, where $t\le \frac{1}{2\Vert H\Vert }$. We further show an alternative approach that eschews classical shadow tomography in favor of quantum mean estimation that reduces this cost (at the price of many more qubits) to $\tilde{O}\left(\frac{M}{t\epsilon }\right)$. Additionally, we show that in the case where one does not have access to the state preparation protocol, the Hamiltonian can be learned using $\tilde{O}\left(\frac{{\alpha }^{4}M}{{\epsilon }^2}\right)$ copies of the pseudo-Choi state. The constant $\alpha$ depends on the norm of the Hamiltonian, and the scaling in terms of $\alpha$ can be improved quadratically if using pseudo-Choi states of the normalized Hamiltonian. Finally, we show that our learning process is robust to errors in the resource states and to errors in the Hamiltonian class. Specifically, we show that if the true Hamiltonian contains more terms than we believe are present in the reconstruction, then our methods give an indication that there are Hamiltonian terms that have not been identified and will still accurately estimate the known terms in the Hamiltonian.

64 pages, 3 figures. Pages 50-64 contain appendices

References in corpus (29)

• Quantum algorithm for solving linear systems of equations
• Improved Simulation of Stabilizer Circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Randomized Benchmarking of Quantum Gates
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum certification and benchmarking
• Practical characterization of quantum devices without tomography
• Experimental Quantum Hamiltonian Learning
• Fixed-point quantum search with an optimal number of queries
• Hamiltonian Learning and Certification Using Quantum Resources
• Robust Online Hamiltonian Learning
• High-precision quantum algorithms for partial differential equations
• A general framework for randomized benchmarking
• Sample-efficient learning of quantum many-body systems
• What randomized benchmarking actually measures
• Optimizing quantum optimization algorithms via faster quantum gradient computation
• Hadamard-free circuits expose the structure of the Clifford group
• Quantum SDP-Solvers: Better upper and lower bounds
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Exponential quantum speedup in simulating coupled classical oscillators
• Robust and Efficient Hamiltonian Learning
• Relations for certain symmetric norms and anti-norms before and after partial trace
• Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
• Practical Black Box Hamiltonian Learning
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
• The advantage of quantum control in many-body Hamiltonian learning
• A simple method for sampling random Clifford operators
• Physics and Complexity: a brief spin glass perspective

Cited by in corpus (3)

• Nearly query-optimal classical shadow estimation of unitary channels
• Learning the structure of any Hamiltonian from minimal assumptions
• Constrained Shadow Tomography for Molecular Simulation on Quantum Devices