Quantum algorithms to simulate many-body physics of correlated fermions.

  title={Quantum algorithms to simulate many-body physics of correlated fermions.},
  author={Zhang Jiang and Kevin Sung and Kostyantyn Kechedzhi and Vadim N. Smelyanskiy and Sergio Boixo},
  journal={arXiv: Quantum Physics},
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic systems. We focus specifically on 2D and linear geometry with nearest neighbor qubit-qubit couplings, typical for superconducting transmon qubit arrays. We improve an existing algorithm to prepare an arbitrary Slater determinant by exploiting a unitary… 
Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological
Variational quantum eigensolver with fewer qubits
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network
Quantum simulation of fermionic systems using hybrid digital–analog quantum computing approach
We consider a hybrid digital–analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction
Qubit-efficient encoding scheme for quantum simulations of electronic structure
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of N spin-orbitals into an N -qubit
Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
A framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system is presented, and a suite of generalized transformations of fermion to qubit operators are explored to show that resource-requirement savings of up to nearly $20\% is possible.
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
It is shown that Hamiltonian simulation of certain spin models known as free fermions can be performed in a quantum circuit with a depth that is independent of simulation time and that grows linearly in the number of spins.
Hartree-Fock on a superconducting qubit quantum computer
Several quantum simulations of chemistry with up to one dozen qubits are performed, including modeling the isomerization mechanism of diazene, and error-mitigation strategies based on N-representability that dramatically improve the effective fidelity of the experiments are demonstrated.
Majorana-Based Fermionic Quantum Computation.
The scheme has a lower overhead for implementing both unitary coupled cluster variational quantum eigensolver and quantum phase estimation algorithms, allowing for simulation of the Trotterized Hubbard Hamiltonian in O(1) time per unitary step.
Roadmap for quantum simulation of the fractional quantum Hall effect
A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems. In this paper, we present a detailed roadmap on how to
Resource Estimation for Quantum Variational Simulations of the Hubbard Model
This Article outlines the details about the gate sequence, the measurement scheme and the relevant error mitigation techniques for the implementation of the Hubbard VQE on a NISQ platform, and performs resource estimation on Hubbard VZE using silicon spin qubits as an example platform.


The Bravyi-Kitaev transformation for quantum computation of electronic structure.
An alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev, is developed that reduces the simulation cost to O(log n) qubit operations for one fermionic operation and demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure.
Fermionic quantum computation
We define a model of quantum computation with local fermionic modes (LFMs) — sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of m
Quantum circuits for strongly correlated quantum systems
The method allows one to uncover the exact circuits corresponding to models that exhibit topological order and to stabilizer states, and opens up the possibility of experimentally producing strongly correlated states, their time evolution at zero time, and even thermal superpositions at zero temperature.
Hybrid quantum-classical approach to correlated materials
This work shows that by using a hybrid quantum-classical algorithm that incorporates the power of a small quantum computer into a framework of classical embedding algorithms, the electronic structure of complex correlated materials can be efficiently tackled using a quantum computer.
Digitized adiabatic quantum computing with a superconducting circuit.
The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems.
Local spin operators for fermion simulations
Digital quantum simulation of fermionic systems is important in the context of chemistry and physics. Simulating fermionic models on general purpose quantum computers requires imposing a fermionic
Quantum Simulation of Electronic Structure with Linear Depth and Connectivity.
It is conjecture that no explicit Trotter step of the electronic structure Hamiltonian is possible with fewer entangling gates, even with arbitrary connectivities, which represents significant practical improvements on the cost of mostTrotter-based algorithms for both variational and phase-estimation-based simulation of quantum chemistry.
Quantum algorithms for fermionic simulations
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems,
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2.
Improving quantum algorithms for quantum chemistry
Improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer by modifying how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant.