Simulating high-accuracy nuclear motion Hamiltonians in discrete variable representation using Walsh-Hadamard QROM with fault-tolerant quantum computers

• URL: http://arxiv.org/abs/2510.19062v1
• Date: Tue, 21 Oct 2025 20:31:12 GMT
• Title: Simulating high-accuracy nuclear motion Hamiltonians in discrete variable representation using Walsh-Hadamard QROM with fault-tolerant quantum computers
• Authors: Michał Szczepanik, Ákos Nagy, Emil Żak,
• Abstract summary: We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers.<n>The quantum volume required for computing the rovibrational spectrum of water can be reduced by up to $105$ times.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers. The method integrates exact curvilinear kinetic energy operators and general-form potential energy surfaces expressed in a hybrid finite-basis/discrete-variable representation. The Hamiltonian is encoded as a unitary quantum circuit using a quantum read-only memory construction based on the Walsh--Hadamard transform, enabling high-accuracy quantum phase estimation of rovibrational energy levels. Our technique provides asymptotic reductions in both logical-qubit count and T-gate complexity that are exponential in the number of atoms and at least polynomial in the total Hilbert-space size, relative to existing block-encoding techniques based on linear combinations of unitaries. Compared with classical variational methods, it offers exponential memory savings and polynomial reductions in time complexity. The quantum volume required for computing the rovibrational spectrum of water can be reduced by up to $10^{5}$ times compared with other quantum methods, increasing to at least $10^{6}$ for a 30-dimensional (12-atom) model system. For this case with a six-body coupled potential, estimating spectroscopic-accuracy energy levels would require about three months on a $1~\mathrm{MHz}$ fault-tolerant quantum processor with fewer than 300 logical qubits, versus over 30,000 years on the fastest current classical supercomputer. These estimates are approximate and subject to technological uncertainties, and realizing the asymptotic advantage will require substantial quantum resources and continued algorithmic progress.

Related papers

• Towards Quantum Advantage in Chemistry [0.70661060006164]
  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.
  arXiv  Detail & Related papers  (2025-12-15T18:49:30Z)
• Guided sampling ansätzes for variational quantum computing [1.055551340663609]
  We introduce a class of guided sampling ansatzes that depend on the system interactions and measured state samples as well as a parameter space.<n>With only 200 circuit executions per structure on the IonQ Aria quantum computer, our calculations produced total energies around the relaxed structure with errors well below $1.59times10-3$ Ha.
  arXiv  Detail & Related papers  (2025-08-19T15:21:23Z)
• Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening [0.0]
  We introduce a quantum machine learning approach that encodes molecular information into quantum states.<n>With six quantum circuit units, the model achieves an RMSD of 2.37 kcal/mol and a Pearson correlation of 0.650.
  arXiv  Detail & Related papers  (2025-07-24T14:01:39Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• 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)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era [11.231358835691962]
  TenCirChem is an open-source library for variation simulatingal quantum algorithms for quantum computational chemistry. TenCirChem shows high performance on the simulation of unitary coupled-cluster circuits. TenCirChem is capable of running real quantum hardware experiments.
  arXiv  Detail & Related papers  (2023-03-20T01:47:45Z)
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices [3.1952399274829775]
  We develop a tool called quantum eigenvalue transformation of unitary matrices with reals (QET-U) This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model.
  arXiv  Detail & Related papers  (2022-04-12T17:11:40Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation [7.620967781722716]
  We present a variational quantum algorithm for solving the Poisson equation. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian. Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
  arXiv  Detail & Related papers  (2021-06-17T09:01:53Z)

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.