Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments

Abstract

We propose a quantum algorithm for inferring the molecular nuclear spin Hamiltonian from time-resolved measurements of spin-spin correlators, which can be obtained via nuclear magnetic resonance (NMR). We focus on learning the anisotropic dipolar term of the Hamiltonian, which generates dynamics that are challenging-to-classically-simulate in some contexts. We demonstrate the ability to directly estimate the Jacobian and Hessian of the corresponding learning problem on a quantum computer, allowing us to learn the Hamiltonian parameters. We develop algorithms for performing this computation on both noisy near-term and future fault-tolerant quantum computers. We argue that the former is promising as an early beyond-classical quantum application since it only requires evolution of a local spin Hamiltonian. We investigate the example of a protein (ubiquitin) confined in a membrane as a benchmark of our method. We isolate small spin clusters, demonstrate the convergence of our learning algorithm on one such example, and then investigate the learnability of these clusters as we cross the ergodic to non-ergodic phase transition by suppressing the dipolar interaction. We see a clear correspondence between a drop in the multifractal dimension measured across many-body eigenstates of these clusters, and a transition in the structure of the Hessian of the learning cost-function (from degenerate to learnable). Our hope is that such quantum computations might enable the interpretation and development of new NMR techniques for analyzing molecular structure.

20 pages, 6 page appendix with some FT and NISQ algorithm details, 7 figures

References in corpus (18)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum random access memory
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Observation of Time-Crystalline Eigenstate Order on a Quantum Processor
• Provably efficient machine learning for quantum many-body problems
• Robust Online Hamiltonian Learning
• Optimal Quantum Measurements of Expectation Values of Observables
• Non-ergodic phases in strongly disordered random regular graphs
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Parameter Estimation with Mixed-State Quantum Computation
• Effectiveness of classical spin simulations for describing NMR relaxation of quantum spins
• Digital quantum simulation of NMR experiments
• Scalable Bayesian Hamiltonian learning
• Optimizing qubit Hamiltonian parameter estimation algorithms using PSO
• Composite pulses in NMR quantum computation
• Meta Hamiltonian Learning

Cited by in corpus (10)

• Drug design on quantum computers
• Zero- to Ultralow-field Nuclear Magnetic Resonance
• Digital quantum simulation of NMR experiments
• The advantage of quantum control in many-body Hamiltonian learning
• Quantum Model Learning Agent: characterisation of quantum systems through machine learning
• Hamiltonian learning for 300 trapped ion qubits with long-range couplings
• Exponential learning advantages with conjugate states and minimal quantum memory
• Accelerating two-dimensional electronic spectroscopy simulations with a probe qubit protocol
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Learning out-of-time-ordered correlators with classical kernel methods