Orbital-rotated Fermi-Hubbard model as a benchmarking problem for quantum chemistry with the exact solution

• URL: http://arxiv.org/abs/2402.11869v2
• Date: Thu, 24 Jul 2025 08:06:54 GMT
• Title: Orbital-rotated Fermi-Hubbard model as a benchmarking problem for quantum chemistry with the exact solution
• Authors: Ryota Kojima, Masahiko Kamoshita, Keita Kanno,
• Abstract summary: We introduce the orbital-rotated Fermi-Hubbard (ORFH) model as a scalable and exactly solvable benchmarking problem for quantum chemistry algorithms.<n>We analyze the ORFH Hamiltonian from multiple perspectives, including operator norm and electronic correlation.<n>Our results demonstrate that the ORFH model provides a versatile and scalable testbed for benchmarking quantum chemistry algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum chemistry is a key target for quantum computing, but benchmarking quantum algorithms for large molecular systems remains challenging due to the lack of exactly solvable yet structurally realistic models. In particular, molecular Hamiltonians typically contain $O(N^4)$ Pauli terms, significantly increasing the cost of quantum simulations, while many exactly solvable models, such as the one-dimensional Fermi-Hubbard (1D FH) model, contain only $O(N)$ terms. In this work, we introduce the orbital-rotated Fermi-Hubbard (ORFH) model as a scalable and exactly solvable benchmarking problem for quantum chemistry algorithms. Starting from the 1D FH model, we apply a spin-involved orbital rotation to construct a Hamiltonian that retains the exact ground-state energy but exhibits a Pauli term count scaling as $O(N^4)$, similar to real molecular systems. We analyze the ORFH Hamiltonian from multiple perspectives, including operator norm and electronic correlation. We benchmark variational quantum eigensolver (VQE) optimizers and Pauli term grouping methods, and compare their performance with those for hydrogen chains. Furthermore, we show that the ORFH Hamiltonian increases the computational difficulty for classical methods such as the density matrix renormalization group (DMRG), offering a nontrivial benchmark beyond quantum algorithms. Our results demonstrate that the ORFH model provides a versatile and scalable testbed for benchmarking quantum chemistry algorithms under realistic structural conditions, while maintaining exact solvability even at large system sizes.

Related papers

• Hamiltonian Learning at Heisenberg Limit for Hybrid Quantum Systems [0.7499722271664147]
  Hybrid quantum systems with different particle species are fundamental in quantum materials and quantum information science.<n>We establish a rigorous theoretical framework proving that, given access to an unknown spin-boson type Hamiltonian, our algorithm achieves Heisenberg-limited estimation.<n>Our results provide a scalable and robust framework for precision Hamiltonian characterization in hybrid quantum platforms.
  arXiv  Detail & Related papers  (2025-02-27T18:47:47Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states.<n>Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• Simulating electronic structure on bosonic quantum computers [34.84696943963362]
  We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
  arXiv  Detail & Related papers  (2024-04-16T02:04:11Z)
• Resource analysis of quantum algorithms for coarse-grained protein folding models [0.0]
  We analyze the resource requirements for simulating protein folding on a quantum computer. We calculate the minimum number of qubits, interactions, and two-qubit gates necessary to build a quantum algorithm.
  arXiv  Detail & Related papers  (2023-11-07T18:27:44Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Feedback-based quantum algorithms for ground state preparation [0.0]
  Ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. We develop formulations of feedback-based quantum algorithms for ground state preparation.
  arXiv  Detail & Related papers  (2023-03-06T06:27:59Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments [5.774827369850958]
  Recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments. This tutorial review focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies.
  arXiv  Detail & Related papers  (2021-09-27T04:24:19Z)
• Dynamical Self-energy Mapping (DSEM) for quantum computing [0.0]
  For noisy intermediate-scale quantum (NISQ) devices only a moderate number of qubits with a limited coherence is available. We present how to bypass this challenge in practical molecular chemistry simulations on NISQ devices by employing a classical-quantum hybrid algorithm.
  arXiv  Detail & Related papers  (2020-10-12T04:12:21Z)
• Sparse-Hamiltonian approach to the time evolution of molecules on quantum computers [0.0]
  We explore the possibility of mapping the molecular problem onto a sparse Hubbard-like Hamiltonian. This allows a Green's-function-based approach to electronic structure via a hybrid quantum-classical algorithm.
  arXiv  Detail & Related papers  (2020-09-26T20:32:06Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Hybrid Quantum-Classical Eigensolver Without Variation or Parametric Gates [0.0]
  We present a process for obtaining the eigenenergy spectrum of electronic quantum systems. This is achieved by projecting the Hamiltonian of a quantum system onto a limited effective Hilbert space. A process for preparing short depth quantum circuits to measure the corresponding diagonal and off-diagonal terms of the effective Hamiltonian is given.
  arXiv  Detail & Related papers  (2020-08-26T02:31:24Z)
• Gate-free state preparation for fast variational quantum eigensolver simulations: ctrl-VQE [0.0]
  VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine. As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
  arXiv  Detail & Related papers  (2020-08-10T17:53:09Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

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.