Accelerating Fermionic System Simulation on Quantum Computers

• URL: http://arxiv.org/abs/2505.08206v1
• Date: Tue, 13 May 2025 03:44:07 GMT
• Title: Accelerating Fermionic System Simulation on Quantum Computers
• Authors: Qing-Song Li, Jiaxuan Zhang, Huan-Yu Liu, Qingchun Wang, Yu-Chun Wu, Guo-Ping Guo,
• Abstract summary: A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems.<n>We introduce a grouping strategy that partitions Hamiltonian terms into $mathcalO(N4)$ groups.<n>We propose a parallel Hamiltonian evolution scheme that reduces the circuit depth of Hamiltonian evolution by a factor of $N$.
• Score: 1.655267861296594
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in the second quantization representation, the number of terms in many fermion-system Hamiltonians, such as molecular Hamiltonians, is substantial, approximately $\mathcal{O}(N^4)$, where $N$ is the number of molecular orbitals. Due to this, the computational resources required for Hamiltonian evolution and expectation value measurements could be excessively large. To address this, we introduce a grouping strategy that partitions these $\mathcal{O}(N^4)$ Hamiltonian terms into $\mathcal{O}(N^2)$ groups, with the terms in each group mutually commuting. Based on this grouping method, we propose a parallel Hamiltonian evolution scheme that reduces the circuit depth of Hamiltonian evolution by a factor of $N$. Moreover, our grouping measurement strategy reduces the number of measurements needed to $\mathcal{O}(N^2)$, whereas the current best grouping measurement schemes require $\mathcal{O}(N^3)$ measurements. Additionally, we find that measuring the expectation value of a group of Hamiltonian terms requires fewer repetitions than measuring a single term individually, thereby reducing the number of quantum circuit executions. Our approach saves a factor of $N^3$ in the overall time for Hamiltonian evolution and measurements, significantly decreasing the time required for quantum computers to simulate fermionic systems.

Related papers

• Exponential improvement in quantum simulations of bosons [0.0]
  Hamiltonian quantum simulation of bosons on digital quantum computers requires truncating the Hilbert space to finite dimensions.<n>For lattice quantum field theories such as Yang-Mills theory and QCD, several Hamiltonian formulations and corresponding truncations have been put forward in recent years.<n>We show that the universal framework, advocated by three of the authors, provides a natural avenue to solve the exponential scaling of circuit complexity with $Q$.
  arXiv  Detail & Related papers  (2025-05-05T10:48:52Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• 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)
• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians [0.0]
  We propose a simple scheme to estimate fermionic observables and Hamiltonians relevant in quantum chemistry and correlated fermionic systems. Our approach is based on implementing a measurement that jointly measures noisy versions of any product of two or four Majorana operators in an $N$ mode fermionic system.
  arXiv  Detail & Related papers  (2024-02-29T15:04:34Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane [0.0]
  We propose an efficient and almost optimal scheme for measuring molecular Hamiltonians in quantum chemistry on quantum computers. It requires $2N2$ distinct measurements in the leading order with $N$ being the number of molecular orbitals. Because evaluating expectation values of molecular Hamiltonians is one of the major bottlenecks in the applications of quantum devices to quantum chemistry, our finding is expected to accelerate such applications.
  arXiv  Detail & Related papers  (2023-01-18T06:51:18Z)
• On the complexity of implementing Trotter steps [2.1369834525800138]
  We develop methods to perform faster Trotter steps with complexity sublinear in number of terms. We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank. Our result suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter synthesis steps with lower gate complexity.
  arXiv  Detail & Related papers  (2022-11-16T19:00:01Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• 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)

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.