Advanced atomic magnetometers have made it possible to acquire nuclear magnetic resonance spectra in zero to ultralow magnetic fields. This regime carries the benefit of compact, low-cost instrumentation with reduced spin relaxation effects and the ability to probe phenomena that are inaccessible in conventional high-field experiments. A trade-off is that the resulting spectra must be interpreted using simulations that are taxing for classical computation. Working by example for small-molecule and protein spectroscopy, we demonstrate that these simulations are a promising target for fault-tolerant quantum computation. Our holistic analysis spans from input selection to the construction of explicit circuits for qubitized quantum dynamics. By maintaining parity with experimental requirements, we demonstrate how certain cases might be especially promising for early fault-tolerant architectures. Notably, valuable natural products and small proteins could be simulated with a few hundred logical qubits and less than 10 12 T gates, corresponding to days of runtime with foreseeable hardware based on spin or superconducting qubits.
Advanced atomic magnetometers have made it possible to acquire nuclear magnetic resonance spectra in zero to ultralow magnetic fields. This regime carries the benefit of compact, low-cost instrumentation with reduced spin relaxation effects and the ability to probe phenomena that are inaccessible in conventional high-field experiments. A trade-off is that the resulting spectra must be interpreted using simulations that are taxing for classical computation. Working by example for small-molecule and protein spectroscopy, we demonstrate that these simulations are a promising target for fault-tolerant quantum computation. Our holistic analysis spans from input selection to the construction of explicit circuits for qubitized quantum dynamics. By maintaining parity with experimental requirements, we demonstrate how certain cases might be especially promising for early fault-tolerant architectures. Notably, valuable natural products and small proteins could be simulated with a few hundred logical qubits and less than 10 12 T gates, corresponding to days of runtime with foreseeable hardware based on spin or superconducting qubits.
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.
Simulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.
The predictive simulation of molecules and materials has had a broad and significant impact. It nevertheless remains constrained by the cost of accurately treating electronic correlation, excited states, and complex energy landscapes. Quantum computing offers a fundamentally different computational paradigm in which quantum states are encoded and manipulated directly rather than approximated on classical hardware. Here we discuss where this approach may provide a genuine scientific advantage in chemistry, materials science, and biochemistry. Promising directions include the high-accuracy treatment of correlated active spaces, improved excited-state simulations, and accelerated exploration of combinatorial structure spaces. The central challenge is therefore not qubit scaling alone, but demonstrably chemically meaningful gains in predictive reliability. We argue that near-term value is most likely to come from disciplined workflow integration rather than wholesale replacement of classical methods. Noisy physical devices, error-mitigated utility experiments, early fault-tolerant devices, and fully fault-tolerant quantum computers offer different scientific prospects, and claims of usefulness must be tied to the specific regime being discussed. Quantum computing will become scientifically valuable when it demonstrably reduces uncertainty in computed energies, rates, spectra, or materials stability after the full costs of state preparation, measurement, error handling, and coupling to classical simulation are included.
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 quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorithms for practical applications remains an outstanding challenge. Here we establish a concrete quantum-classical crossover for quantum many-body dynamics under realistic hardware conditions. We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations, suppressing the residual logical errors that limit existing partially fault-tolerant approaches. A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics at modest system sizes. For a physical error rate of p=10−3, fault-tolerant simulation requires approximately 2 hours and 3.7×105 physical qubits for a 100-site 1D system, whereas tensor network approaches would require about 100 years. For 2D models, where rapid entanglement growth limits the classical evolution time, we project quantum runtimes within minutes. A physical error rate of p=10−4 leads to at least an order of magnitude reduction in qubit count (3.1×104 physical qubits) and runtime (minutes for 1D and seconds for 2D). The reduction in quantum runtime arises from our improved rotation-state injection and co-design of quantum error correction and observable-estimation protocols, which jointly suppress logical-error accumulation and reduce sampling overhead. Our results establish a scalable route towards practical quantum advantage and identify quantitative engineering targets for future fault-tolerant architectures.
Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.