Related papers: Fermionic quantum computation
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic…
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…
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
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…
We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and…
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…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved, as in the electronic structure problem. When the number $F$ of fermions is much smaller than the number $M$ of modes,…
Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of…
We present a classical algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates. We achieve the promotion…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
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…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
Simulating a fermionic system on a quantum computer requires encoding the anti-commuting fermionic variables into the operators acting on the qubit Hilbert space. The most familiar of which, the Jordan-Wigner transformation, encodes…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
Number-conserved subspace encoding reduces resources needed for quantum simulations, but scalable complexity trade-off bounds for $M$ modes and $N$ particles with $\mathcal{O}(N\log M)$ qubits have remained unknown. We study…