Superfast encodings for fermionic quantum simulation

Abstract

Simulation of fermionic many-body systems on a quantum computer requires a suitable encoding of fermionic degrees of freedom into qubits. Here we revisit the Superfast Encoding introduced by Kitaev and one of the authors. This encoding maps a target fermionic Hamiltonian with two-body interactions on a graph of degree $d$ to a qubit simulator Hamiltonian composed of Pauli operators of weight $O(d)$. A system of $m$ fermi modes gets mapped to $n=O(md)$ qubits. We propose Generalized Superfast Encodings (GSE) which require the same number of qubits as the original one but have more favorable properties. First, we describe a GSE such that the corresponding quantum code corrects any single-qubit error provided that the interaction graph has degree $d\ge 6$. In contrast, we prove that the original Superfast Encoding lacks the error correction property for $d\le 6$. Secondly, we describe a GSE that reduces the Pauli weight of the simulator Hamiltonian from $O(d)$ to $O(\log d)$. The robustness against errors and a simplified structure of the simulator Hamiltonian offered by GSEs can make simulation of fermionic systems within the reach of near-term quantum devices. As an example, we apply the new encoding to the fermionic Hubbard model on a 2D lattice.

arXiv comment9 pages, 4 figures

References in corpus (18)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Error mitigation for short-depth quantum circuits
• Fermionic quantum computation
• Extending the computational reach of a noisy superconducting quantum processor
• Efficient variational quantum simulator incorporating active error minimisation
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Practical Quantum Error Mitigation for Near-Future Applications
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Low-cost error mitigation by symmetry verification
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Error correcting codes for adiabatic quantum computation
• 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
• Fermions without fermi fields
• Recovering noise-free quantum observables

Cited by in corpus (43)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum algorithms for quantum chemistry and quantum materials science
• Quantum Error Mitigation
• Quantum Simulation for High Energy Physics
• Fermionic neural-network states for ab-initio electronic structure
• Emerging quantum computing algorithms for quantum chemistry
• Search for Efficient Formulations for Hamiltonian Simulation of non-Abelian Lattice Gauge Theories
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• A Compact Fermion to Qubit Mapping
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Simulating Quantum Materials with Digital Quantum Computers
• Quantum Chemistry Simulations of Dominant Products in Lithium-Sulfur Batteries
• Preparation of excited states for nuclear dynamics on a quantum computer
• Towards near-term quantum simulation of materials
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Free fermions behind the disguise
• Characterization of solvable spin models via graph invariants
• A variational quantum eigensolver for dynamic correlation functions
• Equivalence between fermion-to-qubit mappings in two spatial dimensions
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Higher-dimensional Jordan-Wigner Transformation and Auxiliary Majorana Fermions
• Optimal local unitary encoding circuits for the surface code
• Post-Hartree-Fock method in Quantum Chemistry for Quantum Computer
• Variational solutions to fermion-to-qubit mappings in two spatial dimensions
• A unified framework of transformations based on the Jordan-Wigner transformation
• Error-correcting codes for fermionic quantum simulation
• Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
• Ultrafast Hybrid Fermion-to-Qubit mapping
• On connectivity-dependent resource requirements for digital quantum simulation of $d$-level particles
• ChemiQ: A Chemistry Simulator for Quantum Computer
• Geometric quantum adiabatic methods for quantum chemistry
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Quantum simulation by qubitization without Toffoli gates
• Parallelization techniques for quantum simulation of fermionic systems
• Mitigating Errors in Local Fermionic Encodings
• Basis set generation and optimization in the NISQ era with Quiqbox.jl
• Optimal fermionic swap networks for Hubbard models
• Quantum Computation
• Quantum approximation algorithms for many-body and electronic structure problems