Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1402.4516 · Physical Review B

Exact NMR simulation of protein-size spin systems using tensor train formalism

Dmitry Savostyanov, Sergey Dolgov, Jörn M. Werner, Ilya Kuprov

Published Aug 25, 2014• 32 citations
arXivHTMLPDF

Abstract

We introduce a new method, based on alternating optimization, for compact representation of spin Hamiltonians and solution of linear systems of algebraic equations in the tensor train format.We demonstrate the method's utility by simulating, without approximations, a 15 N NMR spectrum of ubiquitin-a protein containing several hundred interacting nuclear spins.Existing simulation algorithms for the spin system and the NMR experiment in question either require significant approximations or scale exponentially with the spin system size.We compare the proposed method to the SPINACH package that uses heuristic restricted state space techniques to achieve polynomial complexity scaling.When the spin system topology is close to a linear chain (e.g., for the backbone of a protein), the tensor train representation is more compact and can be computed faster than the sparse representation using restricted state spaces.

DOI
10.1103/physrevb.90.085139

Related papers

Quantum mechanical NMR simulation algorithm for protein-size spin systems

Luke Edwards, Dmitry Savostyanov, Zenawi Teklay Welderufael +2 more

Nuclear magnetic resonance spectroscopy is one of the few remaining areas of physical chemistry for which polynomially scaling quantum mechanical simulation methods have not so far been available. In this communication we adapt the restricted state space approximation to protein NMR spectroscopy and illustrate its performance by simulating common 2D and 3D liquid state NMR experiments (including accurate description of relaxation processes using Bloch-Redfield-Wangsness theory) on isotopically enriched human ubiquitin - a protein containing over a thousand nuclear spins forming an irregular polycyclic three-dimensional coupling lattice. The algorithm uses careful tailoring of the density operator space to only include nuclear spin states that are populated to a significant extent. The reduced state space is generated by analysing spin connectivity and decoherence properties: rapidly relaxing states as well as correlations between topologically remote spins are dropped from the basis set.

arXiv:1402.6139•Journal of Magnetic Resonance•Apr 18, 2014•45 citations

The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format

Sebastian Holtz, Thorsten Rohwedder, Reinhold Schneider

Recent achievements in the field of tensor product approximation provide promising new formats for the representation of tensors in form of tree tensor networks. In contrast to the canonical r-term representation (CANDECOMP, PARAFAC), these new formats provide stable representations, while the amount of required data is only slightly larger. The tensor train (TT) format [SIAM J. Sci. Comput., 33 (2011), pp. 2295–2317], a simple special case of the hierarchical Tucker format [J. Fourier Anal. Appl., 5 (2009), p. 706], is a useful prototype for practical low-rank tensor representation. In this article, we show how optimization tasks can be treated in the TT format by a generalization of the well-known alternating least squares (ALS) algorithm and by a modified approach (MALS) that enables dynamical rank adaptation. A formulation of the component equations in terms of so-called retraction operators helps to show that many structural properties of the original problems transfer to the micro-iterations, giving what is to our knowledge the first stable generic algorithm for the treatment of optimization tasks in the tensor format. For the examples of linear equations and eigenvalue equations, we derive concrete working equations for the micro-iteration steps; numerical examples confirm the theoretical results concerning the stability of the TT decomposition and of ALS and MALS but also show that in some cases, high TT ranks are required during the iterative approximation of low-rank tensors, showing some potential of improvement.

SIAM Journal on Scientific Computing•Jan 1, 2012•361 citations

Quantum Computation of Molecular Structure Using Data from Challenging-To-Classically-Simulate Nuclear Magnetic Resonance Experiments

Thomas E. O’Brien, L. B. Ioffe, Yuan Su +4 more

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 on 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.

arXiv:2109.02163•PRX Quantum•Sep 27, 2022•27 citations

Can a Quantum Computer Simulate Nuclear Magnetic Resonance Spectra Better than a Classical One?

Keith R. Fratus, Nicklas Enenkel, Sebastian Zanker +3 more

The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way to a quantum computer. As such, it represents a problem for which such a device may provide some practical advantage over traditional computing methods. In order to understand the extent to which such problems may indeed provide examples of useful quantum advantage, it is important to understand the limitations of existing classical simulation methods. In this work, we benchmark our own classical solver designed to study such problems. This solver uses a clustering approximation to achieve a resource scaling which is linear in the total number of nuclear spins in a given molecule, for a fixed cluster size. The success of such an approximation would present a stark repudiation to the common claim that such problems require an exponential scaling of resources, the very claim which makes simulating an NMR spectra a candidate for quantum advantage. Our benchmarking results indicate that our approximation performs well throughout, and even somewhat beyond, the more typical experimental regimes. We discuss what implications this may have for future efforts to demonstrate quantum advantage in the context of NMR.

arXiv:2508.06448•Aug 8, 2025•13 citations

Solving the time-independent Schrödinger equation for chains of coupled excitons and phonons using tensor trains

Patrick Gelß, Rupert Klein, Sebastian Matera +1 more

We demonstrate how to apply the tensor-train format to solve the time-independent Schrödinger equation for quasi-one-dimensional excitonic chain systems with and without periodic boundary conditions. The coupled excitons and phonons are modeled by Fröhlich-Holstein type Hamiltonians with on-site and nearest-neighbor interactions only. We reduce the memory consumption as well as the computational costs significantly by employing efficient decompositions to construct low-rank tensor-train representations, thus mitigating the curse of dimensionality. In order to compute also higher quantum states, we introduce an approach that directly incorporates the Wielandt deflation technique into the alternating linear scheme for the solution of eigenproblems. Besides systems with coupled excitons and phonons, we also investigate uncoupled problems for which (semi-)analytical results exist. There, we find that in the case of homogeneous systems, the tensor-train ranks of state vectors only marginally depend on the chain length, which results in a linear growth of the storage consumption. However, the central processing unit time increases slightly faster with the chain length than the storage consumption because the alternating linear scheme adopted in our work requires more iterations to achieve convergence for longer chains and a given rank. Finally, we demonstrate that the tensor-train approach to the quantum treatment of coupled excitons and phonons makes it possible to directly tackle the phenomenon of mutual self-trapping. We are able to confirm the main results of the Davydov theory, i.e., the dependence of the wave packet width and the corresponding stabilization energy on the exciton-phonon coupling strength, although only for a certain range of that parameter. In future work, our approach will allow calculations also beyond the validity regime of that theory and/or beyond the restrictions of the Fröhlich-Holstein type Hamiltonians.

arXiv:2109.15104•The Journal of Chemical Physics•Dec 28, 2021•13 citations

On low-rank tensor train approximability for linear nearest neighbor systems

Patrick Gelß, Sebastian Matera, Reinhold Schneider +1 more

Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model or more general Markov jump processes, as well as 1D finite-state quantum systems are examples of such problems. While low-rank tensor train/matrix product state models have been shown to be highly efficient for the simulation of such systems, providing theoretical justification for this remains a challenging task. One approach for obtaining estimates on required ranks for certain accuracies is to investigate the rank increase in Krylov subspace methods for solving the problem at hand. In the context of area laws for ground states of 1D spin systems, nontrivial results on rank-increasing properties of nearest neighbor operator polynomials have been obtained in work of Arad et al. [arXiv:1301.1162] by studying the partial commutativity of local operators. In the present work, this technique is applied to polynomial methods for definite linear equations and dissipative linear ODEs with nearest neighbor structure. This allows to derive corresponding low-rank approximability statements for solutions of such problems which are independent of the system size. Numerical simulations of high-dimensional nearest neighbor systems illustrate the theoretical findings.

arXiv:2607.06453•Jul 7, 2026•0 citations
We introduce a new method, based on alternating optimization, for compact representation of spin Hamiltonians and solution of linear systems of algebraic equations in the tensor train format.We demonstrate the method's utility by simulating, without approximations, a 15 N NMR spectrum of ubiquitin-a protein containing several hundred interacting nuclear spins.Existing simulation algorithms for the spin system and the NMR experiment in question either require significant approximations or scale exponentially with the spin system size.We compare the proposed method to the SPINACH package that uses heuristic restricted state space techniques to achieve polynomial complexity scaling.When the spin system topology is close to a linear chain (e.g., for the backbone of a protein), the tensor train representation is more compact and can be computed faster than the sparse representation using restricted state spaces.
Nuclear magnetic resonance spectroscopy is one of the few remaining areas of physical chemistry for which polynomially scaling quantum mechanical simulation methods have not so far been available. In this communication we adapt the restricted state space approximation to protein NMR spectroscopy and illustrate its performance by simulating common 2D and 3D liquid state NMR experiments (including accurate description of relaxation processes using Bloch-Redfield-Wangsness theory) on isotopically enriched human ubiquitin - a protein containing over a thousand nuclear spins forming an irregular polycyclic three-dimensional coupling lattice. The algorithm uses careful tailoring of the density operator space to only include nuclear spin states that are populated to a significant extent. The reduced state space is generated by analysing spin connectivity and decoherence properties: rapidly relaxing states as well as correlations between topologically remote spins are dropped from the basis set.
Recent achievements in the field of tensor product approximation provide promising new formats for the representation of tensors in form of tree tensor networks. In contrast to the canonical r-term representation (CANDECOMP, PARAFAC), these new formats provide stable representations, while the amount of required data is only slightly larger. The tensor train (TT) format [SIAM J. Sci. Comput., 33 (2011), pp. 2295–2317], a simple special case of the hierarchical Tucker format [J. Fourier Anal. Appl., 5 (2009), p. 706], is a useful prototype for practical low-rank tensor representation. In this article, we show how optimization tasks can be treated in the TT format by a generalization of the well-known alternating least squares (ALS) algorithm and by a modified approach (MALS) that enables dynamical rank adaptation. A formulation of the component equations in terms of so-called retraction operators helps to show that many structural properties of the original problems transfer to the micro-iterations, giving what is to our knowledge the first stable generic algorithm for the treatment of optimization tasks in the tensor format. For the examples of linear equations and eigenvalue equations, we derive concrete working equations for the micro-iteration steps; numerical examples confirm the theoretical results concerning the stability of the TT decomposition and of ALS and MALS but also show that in some cases, high TT ranks are required during the iterative approximation of low-rank tensors, showing some potential of improvement.
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 on 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.
The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way to a quantum computer. As such, it represents a problem for which such a device may provide some practical advantage over traditional computing methods. In order to understand the extent to which such problems may indeed provide examples of useful quantum advantage, it is important to understand the limitations of existing classical simulation methods. In this work, we benchmark our own classical solver designed to study such problems. This solver uses a clustering approximation to achieve a resource scaling which is linear in the total number of nuclear spins in a given molecule, for a fixed cluster size. The success of such an approximation would present a stark repudiation to the common claim that such problems require an exponential scaling of resources, the very claim which makes simulating an NMR spectra a candidate for quantum advantage. Our benchmarking results indicate that our approximation performs well throughout, and even somewhat beyond, the more typical experimental regimes. We discuss what implications this may have for future efforts to demonstrate quantum advantage in the context of NMR.
We demonstrate how to apply the tensor-train format to solve the time-independent Schrödinger equation for quasi-one-dimensional excitonic chain systems with and without periodic boundary conditions. The coupled excitons and phonons are modeled by Fröhlich-Holstein type Hamiltonians with on-site and nearest-neighbor interactions only. We reduce the memory consumption as well as the computational costs significantly by employing efficient decompositions to construct low-rank tensor-train representations, thus mitigating the curse of dimensionality. In order to compute also higher quantum states, we introduce an approach that directly incorporates the Wielandt deflation technique into the alternating linear scheme for the solution of eigenproblems. Besides systems with coupled excitons and phonons, we also investigate uncoupled problems for which (semi-)analytical results exist. There, we find that in the case of homogeneous systems, the tensor-train ranks of state vectors only marginally depend on the chain length, which results in a linear growth of the storage consumption. However, the central processing unit time increases slightly faster with the chain length than the storage consumption because the alternating linear scheme adopted in our work requires more iterations to achieve convergence for longer chains and a given rank. Finally, we demonstrate that the tensor-train approach to the quantum treatment of coupled excitons and phonons makes it possible to directly tackle the phenomenon of mutual self-trapping. We are able to confirm the main results of the Davydov theory, i.e., the dependence of the wave packet width and the corresponding stabilization energy on the exciton-phonon coupling strength, although only for a certain range of that parameter. In future work, our approach will allow calculations also beyond the validity regime of that theory and/or beyond the restrictions of the Fröhlich-Holstein type Hamiltonians.
Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model or more general Markov jump processes, as well as 1D finite-state quantum systems are examples of such problems. While low-rank tensor train/matrix product state models have been shown to be highly efficient for the simulation of such systems, providing theoretical justification for this remains a challenging task. One approach for obtaining estimates on required ranks for certain accuracies is to investigate the rank increase in Krylov subspace methods for solving the problem at hand. In the context of area laws for ground states of 1D spin systems, nontrivial results on rank-increasing properties of nearest neighbor operator polynomials have been obtained in work of Arad et al. [arXiv:1301.1162] by studying the partial commutativity of local operators. In the present work, this technique is applied to polynomial methods for definite linear equations and dissipative linear ODEs with nearest neighbor structure. This allows to derive corresponding low-rank approximability statements for solutions of such problems which are independent of the system size. Numerical simulations of high-dimensional nearest neighbor systems illustrate the theoretical findings.