Parallelization techniques for quantum simulation of fermionic systems

Abstract

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

arXiv comment27 pages, 12 figures; (v2) corrected a misplaced figure; (v3) updated for publication with minor changes

References in corpus (60)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Simulation
• Gapless Spin-Fluid Ground State in a Random Quantum Heisenberg Magnet
• Chiral effective field theory and nuclear forces
• Fermionic quantum computation
• Hamiltonian Simulation by Qubitization
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• A Theory of Trotter Error
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum Algorithms for Fermionic Simulations
• Low Depth Quantum Simulation of Electronic Structure
• Simulating lattice gauge theories on a quantum computer
• A Trailhead for Quantum Simulation of SU(3) Yang-Mills Lattice Gauge Theory in the Local Multiplet Basis
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Constrained dynamics via the Zeno effect in quantum simulation: Implementing non-Abelian lattice gauge theories with cold atoms
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Topological and subsystem codes on low-degree graphs with flag qubits
• Faster quantum simulation by randomization
• Higher Order Decompositions of Ordered Operator Exponentials
• An introduction to the SYK model
• General Methods for Digital Quantum Simulation of Gauge Theories
• Series Expansions for the Massive Schwinger Model in Hamiltonian lattice theory
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Towards simulating 2D effects in lattice gauge theories on a quantum computer
• Search for Efficient Formulations for Hamiltonian Simulation of non-Abelian Lattice Gauge Theories
• Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• A Compact Fermion to Qubit Mapping
• Superfast encodings for fermionic quantum simulation
• Lowering qubit requirements for quantum simulations of fermionic systems
• Operator Locality in Quantum Simulation of Fermionic Models
• Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
• Faster Digital Quantum Simulation by Symmetry Protection
• Oracles for Gauss's law on digital quantum computers
• Fermions without fermi fields
• Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• Removing Staggered Fermionic Matter in $U(N)$ and $SU(N)$ Lattice Gauge Theories
• Local spin operators for fermion simulations
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
• Exact bosonization in arbitrary dimensions
• Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer
• Geometric Quantum Information Structure in Quantum Fields and their Lattice Simulation
• Second-quantized fermionic operators with polylogarithmic qubit and gate complexity
• Suppressing Coherent Gauge Drift in Quantum Simulations
• Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion
• Non-Abelian gauge invariance from dynamical decoupling
• A Compact Fermion to Qubit Mapping Part 2: Alternative Lattice Geometries
• Clifford algebras, Spin groups and qubit trees
• Improving Quantum Algorithms for Quantum Chemistry
• Suppressing nonperturbative gauge errors in the thermodynamic limit using local pseudogenerators