Related papers: Equivalence between fermion-to-qubit mappings in t…
This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of Fermionic quantum systems, efficient Fermion-to-qubit…
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding is a crucial step in harnessing quantum computing for…
We construct a qubit regularization of the $O(3)$ non-linear sigma model in two and three spatial dimensions using a quantum Hamiltonian with two qubits per lattice site. Using a worldline formulation and worm algorithms, we show that in…
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…
Inspired by recent developments generalizing Jordan-Wigner dualities to higher dimensions, we develop a framework of such dualities using an algebraic formalism for translation-invariant Hamiltonians proposed by Haah. We prove that given a…
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…
Simulating the dynamical properties of large-scale many-fermion systems is a longstanding goal of quantum chemistry, material science and condensed matter. Local fermion-to-qubit encodings have opened a new path for practical fermionic…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode…
Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state…
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…
Using N=1 Supersymmetric QCD (SQCD) as a prototype model, this work presents a formulation of overlap quarks and gluinos on the lattice, with particular emphasis on the construction of chirally symmetric Yukawa terms. By incorporating the…
We construct an explicit local operator realization that reproduces Dirac fermion correlation functions in three spacetime dimensions within an Abelian Chern-Simons framework and use it to examine the conjectured operator and deformation…
Simulations of supersymmetric field theories with spontaneously broken supersymmetry require in addition to the ultraviolet regularisation also an infrared one, due to the emergence of the massless Goldstino. The intricate interplay between…
We establish a unified framework for Majorana-based fault-tolerant quantum computation with Majorana surface codes and Majorana color codes. All logical Clifford gates are implemented with zero time overhead. This is done by introducing a…
In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…
L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…
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…
We consider a (2+1) dimensional Wilson-Fisher boson coupled to a (3+1) dimensional U(1) gauge field. This theory possesses a strong-weak duality in terms of the coupling constant e, and is self-dual at a particular value of $e$. We derive…
We apply the coordinate-space method by Luescher and Weisz to the computation of two-loop diagrams in full QCD with Wilson fermions on the lattice. The essential ingredient is the high-precision determination of mixed fermionic-bosonic…