Towards Quantum Advantage in Chemistry

• URL: http://arxiv.org/abs/2512.13657v1
• Date: Mon, 15 Dec 2025 18:49:30 GMT
• Title: Towards Quantum Advantage in Chemistry
• Authors: Scott N. Genin, Ohyun Kwon, Seyyed Mehdi Hosseini Jenab, Seon-Jeong Lim, Taehyung Kim, Tae-Gon Kim, Rami Gherib, Angela F. Harper, Ilya G. Ryabinkin, Michael G. Helander,
• Abstract summary: We execute the iterative qubit coupled-cluster algorithm on fault-tolerant quantum hardware.<n>We show iQCC achieves the lowest mean absolute error (0.05 eV) and highest R$2$ (0.94) relative to experiment.<n>We find these systems remain classically tractable up to $sim$200 logical qubits.
• Score: 0.70661060006164
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Molecular simulations are widely regarded as leading candidates to demonstrate quantum advantage--defined as the point at which quantum methods surpass classical approaches in either accuracy or scale. Yet the qubit counts and error rates required to realize such an advantage remain uncertain; resource estimates for ground-state electronic structure span orders of magnitude, and no quantum-native method has been validated at a commercially relevant scale. Here we address this uncertainty by executing the iterative qubit coupled-cluster (iQCC) algorithm, designed for fault-tolerant quantum hardware, at unprecedented scale using a quantum solver on classical processors, enabling simulations of transition organo-metallic complexes requiring hundreds of logical qubits and millions of entangling gates. Using this approach, we compute the lowest triplet excited state (T$_1$) energies of Ir(III) and Pt(II) phosphorescent organometallic compounds and show that iQCC achieves the lowest mean absolute error (0.05 eV) and highest R$^2$ (0.94) relative to experiment, outperforming leading classical methods. We find these systems remain classically tractable up to $\sim$200 logical qubits, establishing the threshold at which quantum advantage in computational chemistry may emerge and clarifying resource requirements for future quantum computers.

Related papers

• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Coupled Cluster Downfolding Theory in Simulations of Chemical Systems on Quantum Hardware [9.389379035303165]
  We show how classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices.<n>We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum (QNIS) devices and future fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-07-01T21:34:29Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware [31.15746974078601]
  We calculate the lowest energy eigenvalue of active space Hamiltonians of industrially relevant and strongly correlated metal chelates on trapped ion quantum hardware. We are able to achieve chemical accuracy by training a variational quantum algorithm on quantum hardware, followed by a classical diagonalization in the subspace of states measured as outputs of the quantum circuit.
  arXiv  Detail & Related papers  (2024-08-20T12:50:15Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Shortcut to Chemically Accurate Quantum Computing via Density-based Basis-set Correction [0.4909687476363595]
  We embed a quantum computing ansatz into density-functional theory via density-based basis-set corrections (DBBSC) We provide a shortcut towards chemically accurate quantum computations by approaching the complete-basis-set limit. The resulting approach self-consistently accelerates the basis-set convergence, improving electronic densities, ground-state energies, and first-order properties.
  arXiv  Detail & Related papers  (2024-05-19T14:31:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Estimating Phosphorescent Emission Energies in Ir(III) Complexes using Large-Scale Quantum Computing Simulations [0.0]
  We apply the iterative qubit coupled cluster (iQCC) method on classical hardware to the calculation of the transition energies in nine phosphorescent iridium complexes. Our simulations would require a gate-based quantum computer with a minimum of 72 fully-connected and error-corrected logical qubits. The iQCC quantum method is found to match the accuracy of the fine-tuned DFT functionals, has a better Pearson correlation coefficient, and still has considerable potential for systematic improvement.
  arXiv  Detail & Related papers  (2021-11-07T20:02:10Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
  We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
  arXiv  Detail & Related papers  (2020-01-31T19:44:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.