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:2609.20406

The effects of shot noise on the quantum computation of NMR spectra

Sebastian Walch, Keith R. Fratus, Jan-Michael Reiner, Igor Lesanovsky

quant-phSubmitted Sep 17, 2026• Announced Sep 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Recent advances in the field of quantum computing hardware motivate the search for applications which demonstrate so-called quantum advantage. One promising use case that has been identified is the simulation of quantum many-body systems. The computational resources required for performing such a simulation on a classical computer generally grow exponentially with the size of the system being modeled, which is ultimately due to the exponential growth of the Hilbert space in which the dynamics of such a system take place. While digital quantum computers natively evolve quantum states directly in such a Hilbert space, thus naively avoiding this problem, the result of such a computation is typically not obtained as a deterministic output. Rather, it requires projective measurements which are fundamentally affected by shot noise. Any desired expectation values must therefore be reconstructed from repeated measurements, making the number of those measurements a relevant computational resource, and thus an important consideration for any potential claims of quantum advantage. In this work, we study how this resource scales with system size (a scaling which itself depends on the desired accuracy of the final result), using the simulation of nuclear magnetic resonance (NMR) spectra as a test case. We study this scaling for both real-world molecules, as well as a class of model NMR Hamiltonians which allow for efficient large-scale simulations with one-dimensional, two-dimensional, and all-to-all interactions. We find that the required resources increase only weakly with molecular size, far below the exponential growth of the underlying Hilbert space. This result suggests that shot noise should not pose a fundamental barrier to achieving quantum advantage in the simulation of NMR systems, and perhaps for many-body systems more broadly.

AI Summary

The paper asks whether measurement shot noise can impose an exponential resource cost on quantum computation of NMR spectra. It studies spectra reconstructed by Fourier transforming infinite-temperature magnetization correlation functions, with accuracy measured by cosine similarity to exact reference spectra rather than by resolving every transition. The measurement protocol samples initial product states in the $x$ basis, evolves them, and measures transverse magnetization. Each correlation estimate averages products of initial and final magnetization eigenvalues. With $R$ shots per time point and measurement direction, a covariance calculation and second-order expansion of cosine similarity give the large-$R$ mean spectral infidelity $\mathcal I(R,L)\approx\mathcal A(L)/R$. The system-size dependence is investigated numerically using analytically evaluable Ising dynamics for $L=10$–$50$ spins, with one-dimensional, two-dimensional, and all-to-all couplings. Gaussian noise generated from exact single-shot variances models finite-shot estimates. Across linewidths of $1$ and $3\,\mathrm{Hz}$, the inferred $\mathcal A(L)$ grows much more slowly than exponentially over the tested range, with pronounced flattening for distance-decaying interactions. Exact-diagonalization checks of Heisenberg models up to $12$ spins and four molecular examples also show weak size dependence. The study excludes hardware noise, decoherence errors, and time-evolution approximation errors. Its large-system results concern a classically tractable Ising model; the small Heisenberg calculations do not establish asymptotic scaling. The global spectral-overlap criterion discounts unresolved fine structure. The paper also notes that common liquid-state NMR spectra are already accurately accessible to approximate classical methods, so these results do not establish quantum advantage.

Little sign of AI-generated textIncrementalOverclaimsStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

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

Towards quantum utility for NMR quantum simulation on a NISQ computer

Artemiy Burov, Oliver Nagl, Clément Javerzac‐Galy

While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we investigate the application of noisy intermediate-scale quantum devices for simulating nuclear magnetic resonance (NMR) experiments in the high-field regime. In this work, the NMR interactions are mapped to a quantum device via a product formula with minimal resource overhead, an approach that we discuss in detail. Using this approach, we show the results of simulations of liquid-state proton NMR spectra on relevant molecules with up to 11 spins, and up to a total of 47 atoms, and compare them with real NMR experiments. Despite current limitations, we show that a similar approach will eventually lead to a case of quantum utility, a scenario where a practically relevant computational problem can be solved by a quantum computer but not by conventional means. We provide an experimental estimation of the amount of quantum resources needed for solving larger instances of the problem with the presented approach. The polynomial scaling we demonstrate on real processors is a foundational step in bringing practical quantum computation closer to reality.

arXiv:2404.17548•Apr 26, 2024•11 citations

Large-scale NMR simulation on a trapped-ion quantum computer

Pascal Stadler, Alec Owens, Etienne Granet +2 more

Simulating nuclear magnetic resonance (NMR) spectra is a promising application of quantum simulation. Using Quantinuum's System Model H2, a trapped-ion quantum computer, we demonstrate an end-to-end, large-scale digital NMR simulation of a classically challenging benchmark molecule, 1,2-di-tert-butyl-diphosphane. We implement a hardware-efficient reduction of the nuclear-spin Hamiltonian, enabling Trotterized real-time evolution of an effective 21-spin model with tailored error suppression to reduce the effects of device noise. The reconstructed liquid-state proton NMR spectrum agrees with classical reference calculations and reproduces key spectroscopic features that previous quantum hardware demonstrations did not capture. Given the widespread use of NMR in chemical analysis and industrial research, these results advance digital quantum simulation of NMR spectra towards practical quantum utility.

quant-pharXiv:2609.17102•Sep 16, 2026•0 citations

Effects of noise, correlations, and errors in the preparation of initial states in quantum simulations

Nayeli Zuniga-Hansen, Yu-Chieh Chi, Mark Byrd

In principle, a quantum system could be used to simulate another quantum system. The purpose of such a simulation would be to obtain information about problems which are difficult to simulate on a classical computer due to the exponential increase of the Hilbert space with the size of the system and which cannot be readily measured or controlled in an experiment. The system will interact with the surrounding environment and with the other particles in the system, and be implemented using imperfect controls, making it subject to noise. It has been suggested that noise does not need to be controlled to the same extent as it must be for general quantum computing. However, the effects of noise in quantum simulations are not well understood and how best to treat them in most cases is not known. In this paper we study an existing quantum algorithm for simulating the one-dimensional Fano-Anderson model using a liquid-state NMR device. We examine models of noise in the evolution using different initial states in the original model. We also add interacting spins to simulate a realistic situation where an environment of spins is present. We find that states which are entangled with their environment, and sometimes correlated but not necessarily entangled, have an evolution which is described by maps which are not completely positive. We discuss the conditions for this to occur and also the implications.

arXiv:1202.6337•Physical Review A•Oct 25, 2012•7 citations

Large circuit execution for NMR spectroscopy simulation on NISQ quantum hardware

Artemiy Burov, Julien Baglio, Clément Javerzac-Galy

With the latest advances in quantum computing technology, we are gradually moving from the noisy intermediate-scale quantum (NISQ) era characterized by hardware limited in the number of qubits and plagued with quantum noise, to the age of quantum utility where both the newest hardware and software methods allow for tackling problems which have been deemed difficult or intractable with conventional classical methods. One of these difficult problems is the simulation of one-dimensional (1D) nuclear magnetic resonance (NMR) spectra, a major tool to learn about the structure of molecules, helping the design of new materials or drugs. Using advanced error mitigation and error suppression techniques from Q-CTRL together with the latest commercially available superconducting-qubit quantum computer from IBM and trapped-ion quantum computer from IonQ, we present the quantum Hamiltonian simulation of liquid-state 1D NMR spectra in the high-field regime for spin systems up to 34 spins. Our pipeline has a major impact on the ability to execute deep quantum circuits with the reduction of quantum noise, improving mean square error by a factor of 22. It allows for the execution of deep quantum circuits and obtaining salient features of the 1D NMR spectra for both 16-spin and 22-spin systems, as well as a 34-spin system, which lies beyond the regime where unrestricted full Liouvillespace simulations are practical (32 spins, the Liouville limit). Our work is a step toward near-term quantum utility in NMR spectroscopy.

quant-pharXiv:2512.14513•Dec 17, 2025•5 citations

Quantum computing under real-world constraints: efficiency of an ensemble quantum algorithm and fighting decoherence by gate design

Y. Yamamoto, Cyrus P. Master

Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence.

•Jan 1, 2005•4 citations
Recent advances in the field of quantum computing hardware motivate the search for applications which demonstrate so-called quantum advantage. One promising use case that has been identified is the simulation of quantum many-body systems. The computational resources required for performing such a simulation on a classical computer generally grow exponentially with the size of the system being modeled, which is ultimately due to the exponential growth of the Hilbert space in which the dynamics of such a system take place. While digital quantum computers natively evolve quantum states directly in such a Hilbert space, thus naively avoiding this problem, the result of such a computation is typically not obtained as a deterministic output. Rather, it requires projective measurements which are fundamentally affected by shot noise. Any desired expectation values must therefore be reconstructed from repeated measurements, making the number of those measurements a relevant computational resource, and thus an important consideration for any potential claims of quantum advantage. In this work, we study how this resource scales with system size (a scaling which itself depends on the desired accuracy of the final result), using the simulation of nuclear magnetic resonance (NMR) spectra as a test case. We study this scaling for both real-world molecules, as well as a class of model NMR Hamiltonians which allow for efficient large-scale simulations with one-dimensional, two-dimensional, and all-to-all interactions. We find that the required resources increase only weakly with molecular size, far below the exponential growth of the underlying Hilbert space. This result suggests that shot noise should not pose a fundamental barrier to achieving quantum advantage in the simulation of NMR systems, and perhaps for many-body systems more broadly.
The paper asks whether measurement shot noise can impose an exponential resource cost on quantum computation of NMR spectra. It studies spectra reconstructed by Fourier transforming infinite-temperature magnetization correlation functions, with accuracy measured by cosine similarity to exact reference spectra rather than by resolving every transition.
The measurement protocol samples initial product states in the xxx basis, evolves them, and measures transverse magnetization. Each correlation estimate averages products of initial and final magnetization eigenvalues. With RRR shots per time point and measurement direction, a covariance calculation and second-order expansion of cosine similarity give the large-RRR mean spectral infidelity I(R,L)≈A(L)/R\mathcal I(R,L)\approx\mathcal A(L)/RI(R,L)≈A(L)/R.
The system-size dependence is investigated numerically using analytically evaluable Ising dynamics for L=10L=10L=10–505050 spins, with one-dimensional, two-dimensional, and all-to-all couplings. Gaussian noise generated from exact single-shot variances models finite-shot estimates. Across linewidths of 111 and 3 Hz3\,\mathrm{Hz}3Hz, the inferred A(L)\mathcal A(L)A(L) grows much more slowly than exponentially over the tested range, with pronounced flattening for distance-decaying interactions. Exact-diagonalization checks of Heisenberg models up to 121212 spins and four molecular examples also show weak size dependence.
The study excludes hardware noise, decoherence errors, and time-evolution approximation errors. Its large-system results concern a classically tractable Ising model; the small Heisenberg calculations do not establish asymptotic scaling. The global spectral-overlap criterion discounts unresolved fine structure. The paper also notes that common liquid-state NMR spectra are already accurately accessible to approximate classical methods, so these results do not establish quantum advantage.
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.
While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we investigate the application of noisy intermediate-scale quantum devices for simulating nuclear magnetic resonance (NMR) experiments in the high-field regime. In this work, the NMR interactions are mapped to a quantum device via a product formula with minimal resource overhead, an approach that we discuss in detail. Using this approach, we show the results of simulations of liquid-state proton NMR spectra on relevant molecules with up to 11 spins, and up to a total of 47 atoms, and compare them with real NMR experiments. Despite current limitations, we show that a similar approach will eventually lead to a case of quantum utility, a scenario where a practically relevant computational problem can be solved by a quantum computer but not by conventional means. We provide an experimental estimation of the amount of quantum resources needed for solving larger instances of the problem with the presented approach. The polynomial scaling we demonstrate on real processors is a foundational step in bringing practical quantum computation closer to reality.
Simulating nuclear magnetic resonance (NMR) spectra is a promising application of quantum simulation. Using Quantinuum's System Model H2, a trapped-ion quantum computer, we demonstrate an end-to-end, large-scale digital NMR simulation of a classically challenging benchmark molecule, 1,2-di-tert-butyl-diphosphane. We implement a hardware-efficient reduction of the nuclear-spin Hamiltonian, enabling Trotterized real-time evolution of an effective 21-spin model with tailored error suppression to reduce the effects of device noise. The reconstructed liquid-state proton NMR spectrum agrees with classical reference calculations and reproduces key spectroscopic features that previous quantum hardware demonstrations did not capture. Given the widespread use of NMR in chemical analysis and industrial research, these results advance digital quantum simulation of NMR spectra towards practical quantum utility.
In principle, a quantum system could be used to simulate another quantum system. The purpose of such a simulation would be to obtain information about problems which are difficult to simulate on a classical computer due to the exponential increase of the Hilbert space with the size of the system and which cannot be readily measured or controlled in an experiment. The system will interact with the surrounding environment and with the other particles in the system, and be implemented using imperfect controls, making it subject to noise. It has been suggested that noise does not need to be controlled to the same extent as it must be for general quantum computing. However, the effects of noise in quantum simulations are not well understood and how best to treat them in most cases is not known. In this paper we study an existing quantum algorithm for simulating the one-dimensional Fano-Anderson model using a liquid-state NMR device. We examine models of noise in the evolution using different initial states in the original model. We also add interacting spins to simulate a realistic situation where an environment of spins is present. We find that states which are entangled with their environment, and sometimes correlated but not necessarily entangled, have an evolution which is described by maps which are not completely positive. We discuss the conditions for this to occur and also the implications.
With the latest advances in quantum computing technology, we are gradually moving from the noisy intermediate-scale quantum (NISQ) era characterized by hardware limited in the number of qubits and plagued with quantum noise, to the age of quantum utility where both the newest hardware and software methods allow for tackling problems which have been deemed difficult or intractable with conventional classical methods. One of these difficult problems is the simulation of one-dimensional (1D) nuclear magnetic resonance (NMR) spectra, a major tool to learn about the structure of molecules, helping the design of new materials or drugs. Using advanced error mitigation and error suppression techniques from Q-CTRL together with the latest commercially available superconducting-qubit quantum computer from IBM and trapped-ion quantum computer from IonQ, we present the quantum Hamiltonian simulation of liquid-state 1D NMR spectra in the high-field regime for spin systems up to 34 spins. Our pipeline has a major impact on the ability to execute deep quantum circuits with the reduction of quantum noise, improving mean square error by a factor of 22. It allows for the execution of deep quantum circuits and obtaining salient features of the 1D NMR spectra for both 16-spin and 22-spin systems, as well as a 34-spin system, which lies beyond the regime where unrestricted full Liouvillespace simulations are practical (32 spins, the Liouville limit). Our work is a step toward near-term quantum utility in NMR spectroscopy.
Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence.