Related papers: On the Pure Quantum Polynomial Hierarchy and Quant…
This paper investigates symmetric composite binary quantum hypothesis testing (QHT), where the goal is to determine which of two uncertainty sets contains an unknown quantum state. While asymptotic error exponents for this problem are…
The quantum PCP (QPCP) conjecture states that all problems in QMA, the quantum analogue of NP, admit quantum verifiers that only act on a constant number of qubits of a polynomial size quantum proof and have a constant gap between…
We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem, which we call 'Guidable Local Hamiltonian' problems. Unlike their guided counterparts, these problems do not have a guiding state provided as a part of…
We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. The result builds upon the…
We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on…
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a general method to reduce NEXP-complete problems to DQBF. We…
Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a $k$-local Hamiltonian when provided with a description of a quantum state ('guiding state') that is guaranteed to have…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…
The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…
A Hamiltonian is said to be quasi-exactly solvable (QES) if some of the energy levels and the corresponding eigenfunctions can be calculated exactly and in closed form. An entirely new class of QES Hamiltonians having sextic polynomial…
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
The local Hamiltonian (LH) problem is the canonical $\mathsf{QMA}$-complete problem introduced by Kitaev. In this paper, we show its hardness in a very strong sense: we show that the 3-local Hamiltonian problem on $n$ qubits cannot be…
We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…
In this note we present two natural restrictions of the local Hamiltonian problem which are BQP-complete under Karp reduction. Restrictions complete for QCMA, QMA_1, and MA were demonstrated previously.
The pure-quantum self-consistent harmonic approximation (PQSCHA) permits to study a quantum system by means of an effective classical Hamiltonian - depending on quantum coupling and temperature - and classical-like expressions for the…
We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…
The "quantum duality principle" states that the quantization of a Lie bialgebra - via a quantum universal enveloping algebra (QUEA) - provides also a quantization of the dual Lie bialgebra (through its associated formal Poisson group) - via…