Related papers: Experimental Demonstration of Break-Even for the C…
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity…
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…
We show how to absorb fermionic quantum simulation's expensive fermion-to-qubit mapping overhead into the overhead already incurred by surface-code-based fault-tolerant quantum computing. The key idea is to process information in…
Understanding the physics of strongly correlated materials is one of the grand challenge problems for physics today. A large class of scientifically interesting materials, from high-$T_c$ superconductors to spin liquids, involve medium to…
The Fermi-Hubbard model is the starting point for the simulation of many strongly correlated materials, including high-temperature superconductors, whose modelling is a key motivation for the construction of quantum simulation and computing…
By using a modulated magnetic field in a Feshbach resonance for ultracold fermionic atoms in optical lattices, we show that it is possible to engineer a class of models usually referred to as correlated-hopping models. These models differ…
Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit…
We propose a method for the efficient quantum simulation of fermionic systems with superconducting circuits. It consists in the suitable use of Jordan-Wigner mapping, Trotter decomposition, and multiqubit gates, be with the use of a quantum…
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid evolution of quantum hardware, it is increasingly important…
Fermion-to-qubit mappings play a crucial role in representing fermionic interactions on a quantum computer. Efficient mappings translate fermionic modes of a system to qubit interactions with a high degree of locality while using few…
Simulating quantum many-body systems represents a fundamental challenge where classical machine learning methods are severely bottlenecked by the exponential curse of dimensionality. Variational Quantum Algorithms (VQAs) offer a native…
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…
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…
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 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…
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…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging…