Related papers: Statistical Mechanics of the Quantum K-Satisfiabil…
We show that (in contrast to a rather common opinion) QM is not a complete theory. This is a statistical approximation of classical statistical mechanics on the {\it infinite dimensional phase space.} Such an approximation is based on the…
The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-$1/2$ Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and…
We consider the symmetric FEM-BEM coupling that connects two linear elliptic second order partial differential equations posed in a bounded domain $\Omega$ and its complement, where the exterior problem is restated by an integral equation…
The random K-satisfiability (K-SAT) problem is an important problem for studying typical-case complexity of NP-complete combinatorial satisfaction; it is also a representative model of finite-connectivity spin-glasses. In this paper we…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…
We construct a field theory to describe energy averaged quantum statistical properties of systems which are chaotic in their classical limit. An expression for the generating function of general statistical correlators is presented in the…
We present here our study of the adiabatic quantum dynamics of a random Ising chain across its quantum critical point. The model investigated is an Ising chain in a transverse field with disorder present both in the exchange coupling and in…
The paradigmatic example of a continuous quantum phase transition is the transverse field Ising ferromagnet. In contrast to classical critical systems, whose properties depend only on symmetry and the dimension of space, the nature of a…
The $k$-means method is an iterative clustering algorithm which associates each observation with one of $k$ clusters. It traditionally employs cluster centers in the same space as the observed data. By relaxing this requirement, it is…
We generalize the conformally invariant topological quantum mechanics of a particle propagating on a punctured plane by introducing a potential that breaks both the rotational and the conformal invariance down to a ${\bf Z}_2$…
We describe the formalism for optimally estimating and controlling both the state of a spin ensemble and a scalar magnetic field with information obtained from a continuous quantum limited measurement of the spin precession due to the…
We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the…
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…
We make use of the Quantum Hamilton-Jacobi (QHJ) theory to investigate conditional quasi-solvability of the quantum symmetric top subject to combined electric fields (symmetric top pendulum). We derive the conditions of quasi-solvability of…
Quantum annealing (QA) with a transverse field often fails to sample degenerate ground states fairly, limiting applicability to problems requiring diverse optimal solutions. Although Quantum Monte Carlo (QMC) is widely used to simulate QA,…
We present a general formalism to make the Replica-Symmetric and Replica-Symmetry-Breaking ansatz in the context of Kikuchi's Cluster Variational Method (CVM). Using replicas and the message-passing formulation of CVM we obtain a…