相关论文: Constructing Fermionic Hamiltonians with Non-Gauss…
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a…
By combining the continuous matrix product state (cMPS) representation for quantum fields in the continuum with standard optimization techniques for matrix product states (MPS) on the lattice, we obtain an approximation $|\Psi\rangle$,…
The mean field composite Fermion (CF) picture successfully predicts angular momenta of multiplets forming the lowest energy band in fractional quantum Hall (FQH) systems. This success cannot be attributed to a cancellation between Coulomb…
Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We…
We analyze the error of approximating Gibbs states of local quantum spin Hamiltonians on lattices with Projected Entangled Pair States (PEPS) as a function of the bond dimension ($D$), temperature ($\beta^{-1}$), and system size ($N$).…
Valiant-Vazirani showed in 1985 [VV85] that solving NP with the promise that "yes" instances have only one witness is powerful enough to solve the entire NP class (under randomized reductions). We are interested in extending this result to…
QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most notably the ``Local Hamiltonian'' problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems.…
Without wasting time and effort on philosophical justifications and implications, we write down the conditions for the Hamiltonian of a quantum system for rendering it mathematically equivalent to a deterministic system. These are the…
Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. We give the first randomized polynomial-time algorithm for finding ground states of gapped one-dimensional Hamiltonians: it outputs an…
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC…
The Quantum Lov\'asz Local Lemma (QLLL) [AKS12] establishes non-constructively that any quantum system constrained by a local Hamiltonian has a zero-energy ground state, if the local Hamiltonian terms overlap only in a certain restricted…
A field theory is proposed where the regular fermionic matter and the dark fermionic matter can be different states of the same "primordial" fermion fields. In regime of the fermion densities typical for normal particle physics, the…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
A supersymmetric Hamiltonian is constructed for the edge excitations of the Moore-Read (Pfaffian) like state, which is a realization of the N=2 supersymmetric CS model. Fermionic generators and their conjugates are introduced to deal with…
An effective Hamiltonian for spinless electrons in the lowest Landau level (LLL) close to half filling is derived. As opposed to the treatment in standard Chern-Simons theories (CS) we first project to the LLL and only then apply a…
Given an initial quantum state |psi_I> and a final quantum state |psi_F> in a Hilbert space, there exist Hamiltonians H under which |psi_I> evolves into |psi_F>. Consider the following quantum brachistochrone problem: Subject to the…
Clifford circuits Augmented Matrix Product States (CAMPS) was recently proposed to leverage the advantages of both Clifford circuits and Matrix Product States (MPS). Clifford circuits can support large entanglement and can be efficiently…
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…
Fermionic Gaussian Projected Entangled Pair States are fermionic tensor network state constructions which describe the physics of ground states of non-interacting fermionic Hamiltonians. As non-interacting states, one may study and analyze…
Quantum pseudorandomness has found applications in many areas of quantum information, ranging from entanglement theory, to models of scrambling phenomena in chaotic quantum systems, and, more recently, in the foundations of quantum…