Related papers: Improving fermionic variational quantum eigensolve…
We propose a general approach to find an optimal representation of a quantum many body wave function for a given error margin via global fermionic mode optimization. The stationary point on a fixed rank matrix product state manifold is…
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several…
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…
In this paper, we present a new set of local fermion-to-qudit mappings for simulating fermionic lattice systems. We focus on the use of multi-level qudits, specifically ququarts. Traditional mappings, such as the Jordan-Wigner…
Qubits built out of Majorana zero modes (MZMs) have long been theorized as a potential pathway toward fault-tolerant topological quantum computation. Almost unavoidable in these processes is Majorana wavefunction overlap, known as…
We propose an efficient variation of the fermionic swap network scheme used to efficiently simulate n-dimensional Fermi-Hubbard-model Hamiltonians encoded using the Jordan-Wigner transform. For the two-dimensional versions, we show that our…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…
We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to a…
Fault-tolerant quantum computing in systems composed of both Majorana fermions and topologically unprotected quantum systems, e.g. superconducting circuits or quantum dots, is studied in this paper. Errors caused by topologically…
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most…
Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic…
Among the list of major threats to quantum computation, quantum decoherence poses one of the largest because it generates losses to the environment within a computational system which cannot be recovered via error correction methods. These…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…
Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources. Finding exact numerical solutions to…
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation…
We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approximate Optimization Algorithm (QAOA) on a one-dimensional…
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic…
Simulating fermionic systems on qubit hardware involves many nonlocal interactions, and efficient routing of these interactions is critical to the overall cost of fermionic simulation algorithms. Recent works reduce this Jordan-Wigner…