相关论文: The Complexity of Stoquastic Local Hamiltonian Pro…

We prove that if $f:\mathbb{R}\to\mathbb{R}$ is Lipschitz continuous, then for every $H\in(0,1/4]$ there exists a probability space on which we can construct a fractional Brownian motion $X$ with Hurst parameter $H$, together with a process…

We introduce the notion of pseudo-Hermiticity and show that every Hamiltonian with a real spectrum is pseudo-Hermitian. We point out that all the PT-symmetric non-Hermitian Hamiltonians studied in the literature belong to the class of…

This paper is concerned with stochastic Hamiltonian systems which model a class of open dynamical systems subject to random external forces. Their dynamics are governed by Ito stochastic differential equations whose structure is specified…

We prove stochastic homogenization for a class of non-convex and non-coercive first-order Hamilton-Jacobi equations in a finite-range-dependence environment for Hamiltonians that can be expressed by a max-min formula. Exploiting the…

Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over…

We consider a nonlinear pendulum whose suspension point undergoes stochastic vibrations in its plane of motion. Stochastic vibrations are constructed by stochastic differential equations with random periodic solutions. Averaging over these…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

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…

The Hamiltonian formalism is extremely elegant and convenient to mechanics problems. However, its application to the classical field theories is a difficult task. In fact, you can set one to one correspondence between the Lagrangian and…

Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them,…

In recent years, there has been remarkable progress in theoretical justification of the complex Langevin method, which is a promising method for evading the sign problem in the path integral with a complex weight. There still remains,…

An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class P^QMA[log], and motivated its study by showing that the physical…

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 perturb with an additive Gaussian white noise the Hamiltonian system associated to a cubic anharmonic oscillator. The stochastic system is assumed to start from initial conditions that guarantee the existence of a periodic solution for…

In the Hamiltonian formalism, and in the presence of a symmetry Lie group, a variational reduction procedure has already been developed for Hamiltonian systems without constraints. In this paper we present a procedure of the same kind, but…

Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this…

Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…

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…

This paper studies the stochastic optimal control of jump-diffusion processes and the associated fully nonlinear backward stochastic Hamilton--Jacobi--Bellman (BSHJB) equations. We establish the dynamic programming principle (DPP) via…

Although stoquastic Hamiltonians are known to be simulable via sign-problem-free quantum Monte Carlo (QMC) techniques, the non-stoquasticity of a Hamiltonian does not necessarily imply the existence of a QMC sign problem. We give a…