相关论文: Quantum circuits with free fermions in disguise
We provide a systematic construction for local quantum circuits hosting free fermions in disguise, both with staircase and brickwork architectures. Similar to the original Hamiltonian model introduced by Fendley, these circuits are defined…
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…
I solve a quantum chain whose Hamiltonian is comprised solely of local four-fermi operators by constructing free-fermion raising and lowering operators. The free-fermion operators are both non-local and highly non-linear in the local…
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''…
We study brick wall quantum circuits enjoying a global fermionic symmetry. The constituent 2-qubit gate, and its fermionic symmetry, derive from a 2-particle scattering matrix in integrable, supersymmetric quantum field theory in 1+1…
An invaluable method for probing the physics of a quantum many-body spin system is a mapping to noninteracting effective fermions. We find such mappings using only the frustration graph $G$ of a Hamiltonian $H$, i.e., the network of…
We consider quantum spin chains with a hidden free fermionic structure, distinct from the Jordan-Wigner transformation and its generalizations. We express selected local operators with the hidden fermions. This way we can exactly solve the…
We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration graph of a spin model captures the pairwise anticommutation…
In this paper we analyze the ground state phase diagram of a class of fermionic Hamiltonians by looking at the fidelity of ground states corresponding to slightly different Hamiltonian parameters. The Hamiltonians under investigation can be…
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
In this article we outline the historical development and key results obtained to date for free parafermionic spin chains. The concept of free parafermions provides a natural N-state generalization of free fermions, which have long…
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…
We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to a…
We revisit the Jordan-Wigner transformation, showing that --rather than a non-local isomorphism between different fermionic and spin Hamiltonian operators-- it can be viewed in terms of local identities relating different realizations of…
The spectrum of the quantum Ising chain can be found by expressing the spins in terms of free fermions. An analogous transformation exists for clock chains with $Z_n$ symmetry, but is of less use because the resulting parafermionic…
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
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…
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…
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…