Related papers: Relating computational complexity and quantum spec…
We analyze the eigenvalue statistics of the staggered Dirac operator above $T_{c}$ in QCD with 2+1 flavors of dynamical quarks. We use physical quark masses in our simulations. We compare the eigenvalue statistics from several parts of the…
Quantum Phase Transition (QPT) is a phase transition between different quantum states by adjusting some control parameters. Based on the Principle of Hamilton Dynamics (PHD) and the Principle of Lagrangian Dynamics (PLD), a general QPT…
We study and solve some variations of the random K-satisfiability problem - balanced K-SAT and biased random K-SAT - on a regular tree, using techniques we have developed earlier(arXiv:1110.2065). In both these problems, as well as…
We introduce a prime number generator in the form of a stochastic algorithm. The character of such algorithm gives rise to a continuous phase transition which distinguishes a phase where the algorithm is able to reduce the whole system of…
We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability…
Quantum fluctuations concerning the shape of nuclei are treated within the framework of covariant density functional theory. Long range correlations beyond mean field are taken into account by configuration mixing of wave functions with…
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all…
Corroborating a prediction from statistical physics, we prove that the Belief Propagation message passing algorithm approximates the partition function of the random $k$-SAT model well for all clause/variable densities and all inverse…
A thermal model of kinetic friction is assigned to a classical loaded particle moving on a fluctuating smooth surface. A sinusoidal wave resembles surface fluctuations with a relaxation time. The Hamiltonian is approximated to the mean…
Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for…
In this work we study how quantum fluctuations modify the quantum evolution of an initially classical field theory. We consider a scalar $\phi^4$ theory coupled to an external source as a toy model for the Color Glass Condensate description…
We calculate the system-size-over-wave-length ($M$) dependence of sample-to-sample conductance fluctuations, using the open kicked rotator to model chaotic scattering in a ballistic quantum dot coupled by two $N$-mode point contacts to…
It has been demonstrated that the critical point of the phase transition in scalar quantum field theory with a quartic interaction in one space dimension can be approximated via a Gaussian Effective Potential (GEP). We discuss how this…
A quantum system can undergo a continuous phase transition at the absolute zero of temperature as some parameter entering its Hamiltonian is varied. These transitions are particularly interesting for, in contrast to their classical finite…
Correspondence in quantum chaotic systems is lost in short time scales. Introducing some noise we study the spectrum of the resulting coarse grained propagaor of density matrices. Some differen methods to compute the spectrum are reviewed.…
We study the thermodynamics of the linear sigma model with constituent quarks beyond the mean-field approximation. By integrating out the quark degrees of freedom we derive an effective action for the meson fields which is then linearized…
The fluctuations in the particle size distribution for processes of fragmentation and aggregation are studied for stationary state regimes. The system is described in terms of a stochastic process over an adequate tree structure. The RMS…
We present a phase formalism that passes the Barnett-Pegg acid test, i.e. phase fluctuations for a number state are the expected value $\pi^2/3$ which are the fluctuations for a classical random phase distribution. The formalism is shown to…
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…