Bravyi-Kitaev Superfast simulation of fermions on a quantum computer

Abstract

Present quantum computers often work with distinguishable qubits as their computational units. In order to simulate indistinguishable fermionic particles, it is first required to map the fermionic state to the state of the qubits. The Bravyi-Kitaev Superfast (BKSF) algorithm can be used to accomplish this mapping. The BKSF mapping has connections to quantum error correction and opens the door to new ways of understanding fermionic simulation in a topological context. Here, we present the first detailed exposition of BKSF algorithm for molecular simulation. We provide the BKSF transformed qubit operators and report on our implementation of the BKSF fermion-to-qubits transform in OpenFermion. In this initial study of the hydrogen molecule, we have compared BKSF, Jordan-Wigner and Bravyi-Kitaev transforms under the Trotter approximation. We considered different orderings of the exponentiated terms and found lower Trotter errors than previously reported for Jordan-Wigner and Bravyi-Kitaev algorithms. These results open the door to further study of the BKSF algorithm for quantum simulation.

13 pages, 5 figures

References in corpus (6)

• Simulated Quantum Computation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Digital quantum simulation of ${\mathbb{Z}}_2$ lattice gauge theories with dynamical fermionic matter
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• The Wavefunction of an Anyon

Cited by in corpus (66)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Error Mitigation
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum Simulation for High Energy Physics
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• A Quantum Computing View on Unitary Coupled Cluster Theory
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quantum Orbital-Optimized Unitary Coupled Cluster Methods in the Strongly Correlated Regime: Can Quantum Algorithms Outperform their Classical Equivalents?
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• Decoding quantum errors with subspace expansions
• Measurement reduction in variational quantum algorithms
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation
• Superfast encodings for fermionic quantum simulation
• Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Quantum Chemistry Simulations of Dominant Products in Lithium-Sulfur Batteries
• Tequila: A platform for rapid development of 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
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Matrix Model simulations using Quantum Computing, Deep Learning, and Lattice Monte Carlo
• Simulating Hadronic Physics on NISQ devices using Basis Light-Front Quantization
• Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach
• Compilation by stochastic Hamiltonian sparsification
• Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
• Quantum simulations of excited states with active-space downfolded Hamiltonians
• Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
• Quantum computing methods for electronic states of the water molecule
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Scaling Up Electronic Structure Calculations on Quantum Computers: The Frozen Natural Orbital Based Method of Increments
• The Basics of Quantum Computing for Chemists
• Higher-dimensional Jordan-Wigner Transformation and Auxiliary Majorana Fermions
• Molecular Quantum Circuit Design: A Graph-Based Approach
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Variational solutions to fermion-to-qubit mappings in two spatial dimensions
• Improved variational quantum eigensolver via quasi-dynamical evolution
• A unified framework of transformations based on the Jordan-Wigner transformation
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• Quantum Gaussian process model of potential energy surface for a polyatomic molecule
• Analysis of Superfast Encoding Performance for Electronic Structure Simulations
• How to define quantum mean-field solvable Hamiltonians using Lie algebras
• Block encoding bosons by signal processing
• Estimating molecular thermal averages with the quantum equation of motion and informationally complete measurements
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Geometric quantum adiabatic methods for quantum chemistry
• Parallelization techniques for quantum simulation of fermionic systems
• Basis set convergence of Wilson basis functions for electronic structure
• Local fermion-to-qudit mappings: a practical recipe for four-level systems
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Improved Strategies for Fermionic Quantum Simulation with Global Interactions
• Qubit encodings for lattices of dipolar planar rotors
• Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition