Related papers: Statistical Mechanics of the Quantum K-Satisfiabil…
We study possible advantages of randomized and quantum computing over deterministic computing for scalar initial-value problems for ordinary differential equations of order k. For systems of equations of the first order this question has…
In this paper we expand our previous investigation of a quantum particle subject to the action of a random potential plus a fixed harmonic potential at a finite temperature T. In the classical limit the system reduces to a well-known…
We use large deviation theory to obtain the free energy of the XY model on a fully connected graph on each site of which there is a randomly oriented field of magnitude $h$. The phase diagram is obtained for two symmetric distributions of…
We study the quenched disordered magnetic system, which is obtained from the 2D SO(3) quantum Heisenberg model, on a square lattice, with nearest neighbors interaction, by taking a Gaussian random distribution of couplings centered in an…
The functional defined as the squared modulus of the spatial average of the wave function squared, plays the role of an ``order parameter'' for the transition between Hamiltonian ensembles with orthogonal and unitary symmetry. Upon breaking…
We include spontaneous symmetry breaking into the functional renormalization group (RG) equations for the irreducible vertices of Ginzburg-Landau theories by augmenting these equations by a flow equation for the order parameter, which is…
We investigate the performance of a quantum algorithm for solving classical 3-SAT problems. A cycle of post-selected measurements drives the computer's register monotonically toward a steady state which is correlated to the classical…
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
A spin version of dynamical mean-field theory is extended for magnetically ordered states in the Heisenberg model. The self-consistency equations are solved with high numerical accuracy by means of the continuous-time quantum Monte Carlo…
We study the quantum version of a simplified model of optimization problems, where quantum fluctuations are introduced by a transverse field acting on the qubits. We find a complex low-energy spectrum of the quantum Hamiltonian,…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…
Using a combined analysis from Poisson-Dirichlet and symmetry-breaking calculations as well as quantum Monte Carlo simulations, we examine the ordered phase and the thermal phase transition of the three-dimensional spin-1 quantum magnet on…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
In this paper, we give random matrix theory approach to the quantum mechanics using the quantum Hamilton-Jacobi formalism. We show that the bound state problems in quantum mechanics are analogous to solving Gaussian unitary ensemble of…
We study local search algorithms to solve instances of the random $k$-satisfiabi lity problem, equivalent to finding (if they exist) zero-energy ground states of statistical models with disorder on random hypergraphs. It is well known that…
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT)…
The description of a three-dimensional Ising-like magnet in the presence of an external field in the vicinity of the critical point by the collective variables method is proposed. Using the renormalization group transformations, the scaling…
We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at…