Related papers: On the Pure Quantum Polynomial Hierarchy and Quant…
Quantum chemistry has been viewed as one of the potential early applications of quantum computing. Two techniques have been proposed for electronic structure calculations: (i) the variational quantum eigensolver and (ii) the…
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the…
The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a unified framework to describe most quantum algorithms discovered so far, and may lead to the development of novel quantum algorithms. In this paper we…
In this paper, we propose two new methods for solving Set Constraint Problems, as well as a potential polynomial solution for NP-Complete problems using quantum computation. While current methods of solving Set Constraint Problems focus on…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
The problem of estimating the spectral gap of a local Hamiltonian is known to be contained in the class $P^{QMA[log]}$: polynomial time with access to a logarithmic number of QMA queries. The problem was shown to be hard for…
Here we present a problem related to the local Hamiltonian problem (identifying whether the ground state energy falls within one of two ranges) which is restricted to being translationally invariant. We prove that for problems with a fixed…
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…
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…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
It is well known that the validity of the so called Lenard-Magri scheme of integrability of a bi-Hamiltonian PDE can be established if one has some precise information on the corresponding 1st variational Poisson cohomology for one of the…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
We propose a more direct approach to constructing differential operators that preserve polynomial subspaces than the one based on considering elements of the enveloping algebra of sl(2). This approach is used here to construct new exactly…
We study a variant of QMA where quantum proofs have no relative phase (i.e. non-negative amplitudes, up to a global phase). If only completeness is modified, this class is equal to QMA [arXiv:1410.2882]; but if both completeness and…
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as…
The local Hamiltonian problem is famously complete for the class QMA, the quantum analogue of NP. The complexity of its semi-classical version, in which the terms of the Hamiltonian are required to commute (the CLH problem), has attracted…
We consider the problem of characterizing states of a multipartite quantum system from restricted, quasi-local information, with emphasis on uniquely determined pure states. By leveraging tools from dissipative quantum control theory, we…