相关论文: Fermionic Hamiltonians without trivial low-energy …

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 the real-time dynamics of lattice gauge theories, underlying the Standard Model of particle physics, is a notoriously difficult problem where quantum simulators can provide a practical advantage over classical approaches. In this…

Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this…

We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits,…

A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…

What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is non-trivial, i.e., not a multiple of the identity, and L-local, in the sense of containing interaction terms involving at most L…

Trial wavefunctions that can be represented by summing over locally-coupled degrees of freedom are called tensor network states (TNSs); they have seemed difficult to construct for two-dimensional topological phases that possess protected…

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…

We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and…

Thermal density matrices can be described by a pure quantum state within the thermofield formalism. Here we show how to construct a class of Hamiltonians realizing a thermofield state as their ground state. These Hamiltonians are…

In this paper the entanglement of multi-qubit fermionic pseudo Hermitian coherent states (FPHCS) described by anticommutative Grassmann numbers is studied. The pseudo-Hermitian versions of the well known maximally entangled pure states such…

We describe a class of neuralized fermionic tensor network states (NN-fTNS) that introduce non-linearity into fermionic tensor networks through configuration-dependent neural network transformations of the local tensors. The construction…

We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…

It is shown that an arbitrary Fermion hopping hamiltonian can be represented by a system with no fermion fields, generalising earlier results by M. Levin & X.G. Wen [Phys Rev B 67, 245316 (2003)]. All the operators in the hamiltonian of…

We analyze fermionic modes as fundamental entities for quantum information processing. To this end we construct a density operator formalism on the underlying Fock space and demonstrate how it can be naturally and unambiguously equipped…

Tensor networks states allow to find the low energy states of local lattice Hamiltonians through variational optimization. Recently, a construction of such states in the continuum was put forward, providing a first step towards the goal of…

As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the…

We introduce the quantum complexity class FQMA. This class describes the complexity of generating a quantum state that serves as a witness for a given QMA problem. In a certain sense, FQMA is the quantum analogue of FNP (function problems…

This paper is devoted to the construction of what we will call {\em exactly solvable models}, i.e. of quantum mechanical systems described by an Hamiltonian $H$ whose eigenvalues and eigenvectors can be explicitly constructed out of some…

Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…