Low-depth simulations of fermionic systems on square-grid quantum hardware

Abstract

We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging novel operator decomposition and circuit compression techniques paired with specifically chosen low-depth fermion-to-qubit mappings and allow for a high degree of gate cancellations and parallelism. Our mappings retain the flexibility to simultaneously optimize for qubit counts or qubit operator weights and can be used to investigate arbitrary fermionic lattice geometries. We showcase our approach by investigating the tight-binding model, the Fermi-Hubbard model as well as the multi-orbital Hubbard-Kanamori model. We report unprecedentedly low circuit depths per single Trotter layer with up to a $70\%$ improvement upon previous state-of-the-art. Our compression technique also results in significant reduction of two-qubit gates. We find the lowest gate-counts when applying the XYZ-formalism to the DK mapping. Additionally, we show that our decomposition and compression formalism produces favourable circuits even when no native parameterized two-qubit gates are available.

References in corpus (62)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum Simulation
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• Strong electronic correlations from Hund's coupling
• Hamiltonian Simulation by Qubitization
• Elucidating Reaction Mechanisms on Quantum Computers
• Towards Practical Quantum Variational Algorithms
• Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
• Theory of variational quantum simulation
• Optimal Quantum Circuits for General Two-Qubit Gates
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• A random compiler for fast Hamiltonian simulation
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Towards the solution of the many-electron problem in real materials: equation of state of the hydrogen chain with state-of-the-art many-body methods
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Chiral spin liquid phase of the triangular lattice Hubbard model: a density matrix renormalization group study
• Tapering off qubits to simulate fermionic Hamiltonians
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Tracking the Footprints of Spin Fluctuations: A MultiMethod, MultiMessenger Study of the Two-Dimensional Hubbard Model
• Faster quantum simulation by randomization
• Mott insulating states with competing orders in the triangular lattice Hubbard model
• A Compact Fermion to Qubit Mapping
• Lowering qubit requirements for quantum simulations of fermionic systems
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Operator Locality in Quantum Simulation of Fermionic Models
• Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
• Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
• Phase Gadget Synthesis for Shallow Circuits
• Fermions without fermi fields
• Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
• Generalized swap networks for near-term quantum computing
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• The Hubbard model on the honeycomb lattice: from static and dynamical mean-field theories to lattice quantum Monte Carlo simulations
• Iterative Quantum Assisted Eigensolver
• Algebraic Methods for Quantum Codes on Lattices
• Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
• Polynomial complexity despite the fermionic sign
• Jordan-Wigner Dualities for Translation-Invariant Hamiltonians in Any Dimension: Emergent Fermions in Fracton Topological Order
• Quantum time dynamics of 1D-Heisenberg models employing the Yang-Baxter equation for circuit compression
• Demonstrating NISQ Era Challenges in Algorithm Design on IBM's 20 Qubit Quantum Computer
• Auxiliary Field Quantum Monte Carlo for Multiband Hubbard Models: Controlling the Sign and Phase Problems to Capture Hund's Physics
• Second-quantized fermionic operators with polylogarithmic qubit and gate complexity
• Optimal local unitary encoding circuits for the surface code
• Variational solutions to fermion-to-qubit mappings in two spatial dimensions
• Bosonization based on Clifford algebras and its gauge theoretic interpretation
• Optimizing fermionic encodings for both Hamiltonian and hardware
• Stripe order in the doped Hubbard model on the honeycomb lattice
• A Compact Fermion to Qubit Mapping Part 2: Alternative Lattice Geometries
• Co-Design quantum simulation of nanoscale NMR
• Constraints of kinematic bosonization in two and higher dimensions
• Thermodynamic, magnetic and transport properties of the repulsive Hubbard model on the kagome lattice
• Sign-Free Determinant Quantum Monte Carlo Study of Excitonic Density Orders in a Two-Orbital Hubbard-Kanamori Model
• Simulating challenging correlated molecules and materials on the Sycamore quantum processor
• Quantum-enhanced quantum Monte Carlo: an industrial view
• Reducing the qubit requirement of Jordan-Wigner encodings of $N$-mode, $K$-fermion systems from $N$ to $\lceil {\log }_2\left(\genfrac{}{}{0ex}{}{N}{K}\right)\rceil$

Cited by in corpus (7)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
• Concurrent Fermionic Simulation Gate
• Local fermion-to-qudit mappings: a practical recipe for four-level systems
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation