Related papers: The k-local Pauli Commuting Hamiltonians Problem i…
In this paper, we discuss the quantum dynamics of a nonlinear system that admits temporally localized solutions at the classical level. We consider a general ordered position-dependent mass Hamiltonian in which the ordering parameters of…
MA is a class of decision problems for which `yes'-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This…
Many-body wavefunctions usually lie in high-dimensional Hilbert spaces. However, physically relevant states, i.e, the eigenstates of the Schr\"odinger equation are rare. For many-body systems involving only pairwise interactions, these…
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman problem (TSP) is developed. We then define the so-called…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
Schroedinger equation on a Hilbert space ${\cal H}$, represents a linear Hamiltonian dynamical system on the space of quantum pure states, the projective Hilbert space $P {\cal H}$. Separable states of a bipartite quantum system form a…
This work is devoted to the study of some exactly solvable quantum problems of four, five and six bodies moving on the line. We solve completely the corresponding stationary Schr\"odinger equation for these systems confined in an harmonic…
Hamiltonian Learning (HL) is essential for validating quantum systems in quantum computing. Not all Hamiltonians can be uniquely recovered from a steady state. HL success depends on the Hamiltonian model and steady state. Here, we analyze…
We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical mechanics and optimization. We show these problems belong…
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…
Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size…
We introduce a quantum generalization of classical kinetic Ising models, described by a certain class of quantum many body master equations. Similarly to kinetic Ising models with detailed balance that are equivalent to certain Hamiltonian…
Hybrid quantum-classical algorithms can help mitigating the physical limitations of current quantum devices, particularly the low qubit count and the reduced topological connectivity. In this paper, we propose a hybrid technique to solve a…
A generic procedure is proposed to construct many-body quantum Hamiltonians with partial dynamical symmetry. It is based on a tensor decomposition of the Hamiltonian and allows the construction of a hierarchy of interactions that have…
We consider whether or not Hamiltonians which are sums of commuting projectors have "trivial" ground states which can be constructed by a local quantum circuit of bounded depth and range acting on a product state. While the toric code only…
The partition function and free energy of a quantum many-body system determine its physical properties in thermal equilibrium. Here we study the computational complexity of approximating these quantities for $n$-qubit local Hamiltonians.…
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even…
The growing field of quantum computing is based on the concept of a q-bit which is a delicate superposition of 0 and 1, requiring cryogenic temperatures for its physical realization along with challenging coherent coupling techniques for…
The quantum many-body bound-state problem in its computationally successful coupled cluster method (CCM) representation is reconsidered. In conventional practice one factorizes the ground-state wave functions $|\Psi\rangle= e^S…
For families of Hamiltonians defined by parts that are local, the most general definition of a symmetry algebra is the commutant algebra, i.e., the algebra of operators that commute with each local part. Thinking about symmetry algebras as…