Related papers: A diagrammatic calculus of fermionic quantum circu…
Dirac notation is the most common way to describe quantum states and operations on states. It is very convenient and allows for quick visual distinction between vectors, scalars and operators. For quantum processes that involve interactions…
Fermions are the building blocks of matter, forming atoms and nuclei, complex materials and neutron stars. Our understanding of many-fermion systems is however limited, as classical computers are often insufficient to handle the intricate…
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
We give a mathematically precise review of a diagrammatic language introduced by Friedrichs in order to simplify computations with creation and annihilation operator products. In that language, we establish explicit formulas and algorithms…
This work provides a quantum-computing-first derivation of the Unitary Coupled Cluster ansatz, showing that its structure emerges naturally from fermionic algebra under unitary constraints. By explicitly connecting second quantization,…
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…
The worldline casting of a gauge field system with spin-1/2 matter fields has provided a, particle-based, first quantization formalism in the framework of which the Bern-Kosower algorithms for efficient computations in QCD acquire a simple…
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…
Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding…
Nonlinear $\sigma$ models (NLSM) with topological terms, i.e., Wess-Zumino-Witten (WZW) terms, or topological NLSM, are potent descriptions of many critical points and phases beyond the Landau paradigm. These critical systems include the…
We explore the possibility of computing fermionic correlators on the lattice by combining a domain decomposition with a multi-level integration scheme. The quark propagator is expanded in series of terms with a well defined hierarchical…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
We introduce the Scalable ZX-calculus (SZX-calculus for short), a formal and compact graphical language for the design and verification of quantum computations. The SZX-calculus is an extension of the ZX-calculus, a powerful framework that…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polynomials as sums of products of q-binomial coefficients. We consider the fermionic formulae associated with general…
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…
In this paper, we study the diagrammatic categorification of the fermion algebra. We construct a graphical category corresponding to the one-dimensional fermion algebra, and we investigate the properties of this category. The categorical…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
Wilson fermion (WF) is a fundamental particle in the theory of quantum chromodynamics, originally proposed by Kenneth Wilson to solve the fermion doubling problem, i.e., more fermions than expected when one puts fermionic fields on a…