Related papers: 2-Local Hamiltonian with Low Complexity is QCMA
In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…
Quantum Hoare logic (QHL) is a formal verification tool specifically designed to ensure the correctness of quantum programs. There has been an ongoing challenge to achieve a relatively complete satisfaction-based QHL with while-loop since…
We study the computational complexity of the Guided Local Hamiltonian problem: given a local Hamiltonian $H$ together with a classical description of a guiding state that has non-negligible overlap with the ground state of $H$, estimate the…
We prove optimal regularity for the double obstacle problem when obstacles are given by solutions to Hamilton-Jacobi equations that are not $C^2$. When the Hamilton-Jacobi equation is not $C^2$ then the standard Bernstein technique fails…
It is well known that any port-Hamiltonian (pH) system is passive, and conversely, any minimal and stable passive system has a pH representation. Nevertheless, this equivalence is only concerned with the input-output mapping but not with…
The light-cone Hamiltonian is derived from the general gauge -- and Lorentz -- invariant expression for the $q\bar{q}$ Green's function, containing confinement via the area law for the Wilson loop.The resulting Hamiltonian contains in a…
We consider real analytic Hamiltonians whose flow depends linearly on time. Trivial examples are Hamiltonians $H(q,p)$ that do not depend on the coordinate $q$. By a theorem of Moser, every polynomial Hamiltonian of degree 3 reduces to such…
Finding the ground state energy of electrons subject to an external electric field is a fundamental problem in computational chemistry. We prove that this electronic-structure problem, when restricted to a fixed single-particle basis and…
A new description is given of all solutions to the relaxed commutant lifting problem. The method of proof is also different from earlier ones, and uses only an operator-valued version of a classical lemma on harmonic majorants.
According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa's; the internal state of a 2qcfa…
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
We study the `local entanglement' remaining after filtering operations corresponding to imperfect measurements performed by one or both parties, such that the parties can only determine whether or not the system is located in some region of…
$ \newcommand{\Xlin}{\mathcal{X}} \newcommand{\Zlin}{\mathcal{Z}} \newcommand{\C}{\mathbb{C}} $We give a quantum multiprover interactive proof system for the local Hamiltonian problem in which there is a constant number of provers,…
The quantum analogue of a constraint satisfaction problem is a sum of local Hamiltonians - each local Hamiltonian specifies a local constraint whose violation contributes to the energy of the given quantum state. Formalizing the intuitive…
We present a systematic hierarchy of approximations for {\it local} exact-decoupling of four-component quantum chemical Hamiltonians based on the Dirac equation. Our ansatz reaches beyond the trivial local approximation that is based on a…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
We study a class of weakly coupled Hamilton-Jacobi systems with a specific aim to perform a qualitative analysis in the spirit of weak KAM theory. Our main achievement is the definition of a family of related action functionals containing…
In the context of ground states of quantum many-body systems, the locality of entanglement between connected regions of space is directly tied to the locality of the corresponding entanglement Hamiltonian: the latter is dominated by local,…