Accelerating Fermionic System Simulation on Quantum Computers

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.

15 pages, 7 figures

References in corpus (24)

• A variational eigenvalue solver on a quantum processor
• Surface codes: Towards practical large-scale quantum computation
• The theory of variational hybrid quantum-classical algorithms
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Elucidating Reaction Mechanisms on Quantum Computers
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• The randomized measurement toolbox
• Simulating Physical Phenomena by Quantum Networks
• Simulating chemistry using quantum computers
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Low Depth Quantum Simulation of Electronic Structure
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Measurement reduction in variational quantum algorithms
• Efficient evaluation of quantum observables using entangled measurements
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Adaptive estimation of quantum observables
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Improving quantum measurements by introducing "ghost" Pauli products
• A unified framework of transformations based on the Jordan-Wigner transformation
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Error-correcting codes for fermionic quantum simulation