Lowering qubit requirements for quantum simulations of fermionic systems.

@article{Steudtner2017LoweringQR,
  title={Lowering qubit requirements for quantum simulations of fermionic systems.},
  author={Mark Steudtner and Stephanie Wehner},
  journal={arXiv: Quantum Physics},
  year={2017}
}
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. One challenge in realizing simulations on near-term quantum devices is the large number of qubits required by such mappings. In this work, we develop… 

Figures and Tables from this paper

Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
TLDR
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.
Improving Hamiltonian encodings with the Gray code
TLDR
This encoding is applied to the commonly-studied problem of finding the ground state energy of a deuteron with a simulated variational quantum eigensolver (VQE), and various trade-offs that arise are analyzed.
Simulating molecules on a cloud-based 5-qubit IBM-Q universal quantum computer
Simulating the behaviour of complex quantum systems is impossible on classical supercomputers due to the exponential scaling of the number of quantum states with the number of particles in the
Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and
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
Improved techniques for preparing eigenstates of fermionic Hamiltonians
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We
Variational Quantum Simulation for Quantum Chemistry
Variational quantum‐classical hybrid algorithms are emerging as important tools for simulating quantum chemistry with quantum devices. These algorithms can be applied to evaluate various molecular
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science.
TLDR
In this review, a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal-state simulation is taken and their strengths and weaknesses for future developments are analyzed.
Analysis of superfast encoding performance for electronic structure simulations
In our recent work, we have examined various fermion to qubit mappings in the context of quantum simulation including the original Bravyi-Kitaev Superfast encoding (OSE) as well as a generalized
A Comparison of the Bravyi–Kitaev and Jordan–Wigner Transformations for the Quantum Simulation of Quantum Chemistry
TLDR
This paper uses 86 molecular systems to demonstrate that the use of the Bravyi–Kitaev transformation is typically at least approximately as efficient as the canonical Jordan–Wigner transformation and results in substantially reduced gate count estimates when performing limited circuit optimizations.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the Fermionic problem in a system of qubits. By exploiting the block diagonality of a Fermionic
Operator locality in the quantum simulation of fermionic models
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli
The Bravyi-Kitaev transformation for quantum computation of electronic structure.
TLDR
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.
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
Adiabatic Quantum Simulation of Quantum Chemistry
TLDR
A procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings with precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size is described.
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 LFMs
Exponentially more precise quantum simulation of fermions in second quantization
We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically more efficient than those based on the Lie–Trotter–Suzuki decomposition. We present the first
Trading Classical and Quantum Computational Resources
TLDR
A purely classical algorithm is proposed that can simulate a Pauli-based computation (PBC) on n qubits in a time $2^{c n} poly(n)$ where $c\approx 0.94$.
The theory of variational hybrid quantum-classical algorithms
TLDR
This work develops a variational adiabatic ansatz and explores unitary coupled cluster where it is shown how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
On the Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
TLDR
It is argued that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation.
...
...