Related papers: Hardness and Ease of Curing the Sign Problem for T…
We consider quantum algorithms for the unique sink orientation problem on cubes. This problem is widely considered to be of intermediate computational complexity. This is because there no known polynomial algorithm (classical or quantum)…
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying…
We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We…
We consider bipartite SU($N$) spin Hamiltonians with a fundamental representation on one sublattice and a conjugate to fundamental on the other sublattice. By mapping these antiferromagnets to certain classical loop models in one higher…
In recent years quantum simulation has made great strides culminating in experiments that operate in a regime that existing supercomputers cannot easily simulate. Although this raises the possibility that special purpose analog quantum…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…
We consider whether trainable quantum unitaries can be used to discover quantum speed-ups for classical problems. Using methods recently developed for training quantum neural nets, we consider Simon's problem, for which there is a known…
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non-local Hamiltonian simulation and non-local gate synthesis when only homogeneous local unitaries are performed in…
A particulare case of the three-body problem, in the PPN formalism, is presented. The Hamiltonian function is obtained and the problem is reduced to a perturbed two-body one.
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
The sign problem in Full Configuration Interaction Quantum Monte Carlo (FCIQMC) without annihilation can be understood as an instability of the psi-particle population to the ground state of the matrix obtained by making all off-diagonal…
The singularity structure of solutions of a class of Hamiltonian systems of ordinary differential equations in two dependent variables is studied. It is shown that for any solution, all movable singularities, obtained by analytic…
QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical…
The highly structured search algorithm proposed by Hogg[Phys.Rev.Lett. 80,2473(1998)] is implemented experimentally for the 1-SAT problem in a single search step by using nuclear magnetic resonance technique with two-qubit sample. It is the…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
It is shown that any two Hamiltonians H(t) and H'(t) of N dimensional quantum systems can be related by means of time-dependent canonical transformations (CT). The dynamical symmetry group of system with Hamiltonian H(t) coincides with the…
We show here that the Hamiltonian for an electronic system may be written exactly in terms of fluctuation operators that transition constituent fragments between internally correlated states, accounting rigorously for inter-fragment…
Simulating high-weight Hamiltonians can convert local noise on the original Hamiltonian into undesirable nonlocal noise on the simulated Hamiltonian. Here we show how starting from two-local Hamiltonian in the presence of non-Markovian…
We study the problem of learning a local quantum Hamiltonian $H$ given copies of its Gibbs state $\rho = e^{-\beta H}/\textrm{tr}(e^{-\beta H})$ at a known inverse temperature $\beta>0$. Anshu, Arunachalam, Kuwahara, and Soleimanifar…