Related papers: Discovering optimal fermion-qubit mappings through…
A local transformation from fermionic operators to spin matrices is proposed and studied in this work. For this purpose, a system of fermions on a lattice is considered and one applies the scheme to replace the fermionic variables with spin…
Obtaining the expectation value of an observable on a quantum computer is a crucial step in the variational quantum algorithms. For complicated observables such as molecular electronic Hamiltonians, a common strategy is to present the…
Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to fermions via the Jordan-Wigner transformation (JW). The Hartree-Fock method is straightforward in the…
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…
A central challenge in quantum simulation is to prepare low-energy states of strongly interacting many-body systems. In this work, we study the problem of preparing a quantum state that optimizes a random all-to-all, sparse or dense, spin…
Representing massless Dirac fermions on a spatial lattice poses a potential challenge known as the Fermion Doubling problem. Addition of a quadratic term to the Dirac Hamiltonian circumvents this problem. We show that the modified…
We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of single-qubit rotations. We introduce estimators based on…
Utilizing the framework of $\mathbb{Z}_2$ lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic…
For quantum computing applications, the electronic Hamiltonian for the electronic structure problem needs to be unitarily transformed to a qubit form. We found that mean-field procedures on the original electronic Hamiltonian and on its…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and spin-$\frac{1}{2}$ systems. Here, we instead consider…
We consider quantum error-correcting subsystem codes whose gauge generators realize a translation-invariant, free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of…
The Jordan-Wigner transformation is frequently utilised to rewrite quantum spin chains in terms of fermionic operators. When the resulting Hamiltonian is bilinear in these fermions, i.e. the fermions are free, the exact spectrum follows…
Based on the standard many-fermion field theory, the authors construct models describing ultracold fermions in a 1D optical lattices by implementing a mode expansion of the fermionic field operator where modes, in addition to space…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
In this work, we address the problem of a resource-efficient formulation of non-Abelian LGTs by focusing on the difficulty of simulating fermionic degrees of freedom and the Hilbert space redundancy. First, we show a procedure that removes…
Proposed is a generalization of Jordan-Wigner transform that allows to exactly fermionize a large family of quantum spin Hamiltonians in dimensions higher than one. The key new steps are to enlarge the Hilbert space of the original model by…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
Quantum simulations before fault tolerance suffer from the intrinsic noise present in quantum computers. In this regime, extracting meaningful results greatly benefits from stability against that noise. This stability, defined as an error…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…