Related papers: The Bonsai algorithm: grow your own fermion-to-qub…
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…
The simulation of quantum many-body systems, relevant for quantum chemistry and condensed matter physics, is one of the most promising applications of near-term quantum computers before fault-tolerance. However, since the vast majority of…
A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in…
Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our…
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…
We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected…
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…
Quantum tomography is an important tool for the characterisation of quantum operations. In this paper, we present a framework of quantum tomography in fermionic systems. Compared with qubit systems, fermions obey the superselection rule,…
In this paper we present a hybrid scheme for topological quantum computation in a system of cold atoms trapped in an atomic lattice. A topological qubit subspace is defined using Majorana fermions which emerge in a network of atomic Kitaev…
After a brief review of various mappings of fermion pairs to bosons, we rigorously derive a general approach. Following the methods of Marumori and Otsuka, Arima, and Iachello, our approach begins with mapping states and constructs boson…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators. Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms, increasing circuit…
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…
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…
The structure and dynamics of quantum many-body systems are the result of a delicate interplay between underlying interactions, which leads to intricate entanglement structures. Despite this apparent complexity, symmetries emerge and have…
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…
Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
In recent work [arXiv:2003.06939v2] a novel fermion to qubit mapping -- called the compact encoding -- was introduced which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators. There…
Quantum simulation of fermionic systems is a leading application of quantum computers. One promising approach is to represent fermions with qubits via fermion-to-qubit mappings. In this work, we present high-distance fermion-to-qubit…