Related papers: Fermionic systems for quantum information people
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
Local interactions among electrons underlie many complex properties of correlated materials. While the Jordan-Wigner transformation can preserve this locality along one spatial dimension, interactions along the remaining dimensions…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that…
We examine the interplay of symmetry and topological order in $2+1$ dimensional fermionic topological phases of matter. We define fermionic topological symmetries acting on the emergent topological effective theory described using braided…
We introduce creation and annihilation operators of pseudo-Hermitian fermions for two-level systems described by pseudo-Hermitian Hamiltonian with real eigenvalues. This allows the generalization of the fermionic coherent states approach to…
The Jordan-Wigner transformation maps a one-dimensional spin-1/2 system onto a fermionic model without spin degree of freedom. A double chain of quantum bits with XX and ZZ couplings of neighboring qubits along and between the chains,…
This paper introduces the FermiFab toolbox for many-particle quantum systems. It is mainly concerned with the representation of (symbolic) fermionic wavefunctions and the calculation of corresponding reduced density matrices (RDMs). The…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Many electromagnetic properties of graphene can be described by the Hubbard model on a honeycomb lattice. However, this system suffers strongly from the sign problem if a chemical potential is included. Tensor network methods are not…
We discuss quantum correlations in systems of indistinguishable particles in relation to entanglement in composite quantum systems consisting of well separated subsystems. Our studies are motivated by recent experiments and theoretical…
The objective of this series of papers is to recover information regarding the behaviour of FQ operations in the case $n=2$, and FQ conform-operations in the case $n=3$. In this first part we study how the basic invariance properties of FQ…
Fractional supersymmetric quantum mechanics of order $\lambda$ is realized in terms of the generators of a generalized deformed oscillator algebra and a Z$_{\lambda}$-grading structure is imposed on the Fock space of the latter. This…
We present a reduced density operator for electronically open molecules by explicitly averaging over the environmental degrees of freedom of the composite Hamiltonian. Specifically, we include the particle-number non-conserving…
This paper introduces the quantum deep sets model, expanding the quantum machine learning tool-box by enabling the possibility of learning variadic functions using quantum systems. A couple of variants are presented for this model. The…
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 show that the metric operator for a pseudo-supersymmetric Hamiltonian that has at least one negative real eigenvalue is necessarily indefinite. We introduce pseudo-Hermitian fermion (phermion) and abnormal phermion algebras and provide a…
Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic…
We study quantum spin chains solvable via hidden free fermionic structures. We study the algebras behind such models, establishing connections to the mathematical literature of the so-called ``graph-Clifford'' or ``quasi-Clifford''…
Since Fermions are based on anti-commutation relations, their entanglement can not be studied in the usual way, such that the available theory has to be modified appropriately. Recent publications consider in particular the structure of…