Related papers: N-representability is QMA-complete
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.…
Computing the ground-state energy of interacting electron (fermion) problems has recently been shown to be hard for QMA, a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to…
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…
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
In this work we investigate the computational complexity of the pure consistency of local density matrices (PureCLDM) and pure N-representability (Pure-N-Representability; analog of PureCLDM for bosonic or fermionic systems) problems. In…
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…
The $N$-representability problem is the problem of determining whether or not there exists $N$-particle states with some prescribed property. Here we report an affirmative solution to the fermion $N$-representability problem when both the…
The question of whether given density operators for subsystems of a multipartite quantum system are compatible to one common total density operator is known as the quantum marginal problem. We briefly review the solution of a subclass of…
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…
Systematic use of the infinite-dimensional spin representation simplifies and rigorizes several questions in Quantum Field Theory. This representation permutes ``Gaussian'' elements in the fermion Fock space, and is necessarily projective:…
It is well known that the ground state energy of many-particle Hamiltonians involving only 2-body interactions can be obtained using constrained optimizations over density matrices which arise from reducing an N-particle state. While…
QMA and QCMA are possible quantum analogues of the complexity class NP. In QCMA the verifier is a quantum program and the proof is classical. In contrast, in QMA the proof is also a quantum state. We show that two known QMA-complete…
In this paper the old problem of determining the discrete spectrum of a multi-particle Hamiltonian is reconsidered. The aim is to bring a fermionic Hamiltonian for large numbers N of particles by analytical means into a shape such that…
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it is natural to apply a different notion of complexity, namely…
We present a constructive solution to the N-representability problem---a full characterization of the conditions for constraining the two-electron reduced density matrix (2-RDM) to represent an N-electron density matrix. Previously known…
The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known…
The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algorithm exists for constructing a witness for a quantum circuit…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
The spinor representation of the quantum group $U_q(su(N))$ is given in terms of a set of fermion creation and annihilation operators. It is shown that the $q$-fermion operators introduced earlier can be identifi ed with the conventional…
Neural network quantum states emerge as a promising tool for solving quantum many-body problems. However, its successes and limitations are still not well-understood in particular for Fermions with complex sign structures. Based on our…