Related papers: Scalable Simulation of Fermionic Encoding Performa…
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 noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
We address the task of compression of fermionic quantum information. Due to the parity superselection rule, differently from the case of encoding of quantum information in qubit states, part of the information carried by fermionic systems…
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 algebra on spins. The previously studied…
We present an encoding technique that reduces the effects of noise on quantum spin systems whose operation is driven by Hamiltonian evolution. This technique is widely applicable, being most relevant to the scenarios where there are…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
In this work we present a method for generating a fermionic encoding tailored to a set of target fermionic operators and to a target hardware connectivity. Our method uses brute force search, over the space of all encodings which map from…
Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to…
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…
Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme…
The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
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 and the Hilbert space of $m$ qubits,…
This work proposes a digital quantum simulation protocol for the linear scattering process of bosons, which provides a simple extension to partially distinguishable boson cases. Our protocol is achieved by combining the boson-fermion…
Variational algorithms are a promising paradigm for utilizing near-term quantum devices for modeling electronic states of molecular systems. However, previous bounds on the measurement time required have suggested that the application of…
Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed,…
Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed,…
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum…
We introduce a new method for representing the low energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the…
Scalable realisation of quantum computing is reliant on the development of fault tolerant devices. Analysis of quantum error correction protocols typically considers incoherent noise models or noise-free syndrome measurements. While this is…