Related papers: Two remarks on the local Hamiltonian problem
In this paper, some of formulations of Hamilton-Jacobi equations for Hamiltonian system and regular reduced Hamiltonian systems are given. At first, an important lemma is proved, and it is a modification for the corresponding result of…
In the context of loop quantum cosmology, we parametrise the lattice refinement by a parameter, $A$, and the matter Hamiltonian by a parameter, $\delta$. We then solve the Hamiltonian constraint for both a self-adjoint, and a…
We prove local in time well-posedness for a class of quasilinear Hamiltonian KdV-type equations with periodic boundary conditions, more precisely we show existence, uniqueness and continuity of the solution map. We improve the previous…
The eigenproblem for a class of Hamiltonians of the parametric down conversion process in the Kerr medium is solved. Some physical characteristics of the system are calculated.
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…
The inclusive and exclusive semileptonic decay distributions for b -> c decay are computed in the Shifman-Voloshin limit. The inclusive decay distributions (computed using an operator product expansion) depend on quark masses, and the…
This paper analyzes the optimal control problem of cubic polynomials on compact Lie groups from a Hamiltonian point of view and its symmetries. The dynamics of the problem is described by a presymplectic formalism associated with the…
What could happen if we pinned a single qubit of a system and fixed it in a particular state? First, we show that this can greatly increase the complexity of static questions -- ground state properties of local Hamiltonian problems with…
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…
The quantified constraint satisfaction problem $\mathrm{QCSP}(\mathcal{A})$ is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifiers and conjunction, is true on some fixed structure…
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently…
We give a new perspective on the existence of viscosity solutions for a stationary and a time-dependent first-order Hamilton-Jacobi equation. Following recent comparison principles, we work in a framework in which we consider a subsolution…
Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…
An extension of Riewe's fractional Hamiltonian formulation is presented for fractional constrained systems. The conditions of consistency of the set of constraints with equations of motion are investigated. Three examples of fractional…
In this note we show how canonical transformations reveal hidden convexity properties for deterministic optimal control problems, which in turn result in global existence of $C^{1,1}_{loc}$ solutions to first order Hamilton--Jacobi--Bellman…
In this paper, we continue the study of the existence problem of compact Clifford-Klein forms from a cohomological point of view, which was initiated by Kobayashi-Ono and extended by Benoist-Labourie and the author. We give an obstruction…
We investigate the local boundedness of solutions $u:\Omega_T\to\mathbb{R}$ to parabolic equations of the form \begin{equation*} \partial_tu-\mathrm{div}\,\mathcal{A}(x,t,Du)=0 \qquad\mbox{in }\Omega_T=\Omega\times(0,T) \end{equation*} that…
The use of local single-pass methods (like, e.g., the Fast Marching method) has become popular in the solution of some Hamilton-Jacobi equations. The prototype of these equations is the eikonal equation, for which the methods can be applied…
StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem. Although error reduction is commonplace for many complexity classes, such as…
This note is concerned with the nonlinear Ky Fan $k$-norm matrix conic optimization problems, which include the nuclear norm regularized minimization problem as a special case. For this class of nonpolyhedral matrix conic optimization…