Related papers: Relating computational complexity and quantum spec…
Covariances and variances of linear statistics of a point process can be written as integrals over the truncated two-point correlation function. When the point process consists of the eigenvalues of a random matrix ensemble, there are often…
The recent high-energy QCD equations including the effects of fluctuations are solved numerically. We discuss their asymptotic properties and compare them with the corresponding behaviour without fluctuations as well as with the…
We have developed a new approach based on matrix product representations of ground states to study Quantum Phase Transitions (QPT). As confirmation of the power of our approach we have analytically analyzed the XXZ spin-one chain with…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Recent studies using the quantum information theoretic approach to thermodynamics show that the presence of coherence in quantum systems generates corrections to classical fluctuation theorems. To explicate the physical origins and…
While we have intuitive notions of structure and complexity, the formalization of this intuition is non-trivial. The statistical complexity is a popular candidate. It is based on the idea that the complexity of a process can be quantified…
In recent years there has been an increasing interest on the theoretical and experimental investigation of space-time dual quantum circuits. They exhibit unique properties and have applications to diverse fields. Periodic space-time dual…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r…
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…
In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
For $q\geq 3$, we let $\mathcal{S}_q$ denote the projectivization of the set of symmetric $q\times q$ matrices with coefficients in $\mathbb{C}$. We let $I(x)=(x_{i,j})^{-1}$ denote the matrix inversion, and we let $J(x)=(x_{i,j}^{-1})$ be…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
We analyze the response of a complex quantum-mechanical system (e. g., a quantum dot) to a time-dependent perturbation. Assuming the dot energy spectrum and the perturbation to be described by the Gaussian Orthogonal Ensemble of random…
We present a framework for quantum computation, similar to Adiabatic Quantum Computation (AQC), that is based on the quantum Zeno effect. By performing randomised dephasing operations at intervals determined by a Poisson process, we are…
The theory of stochastic processes impacts both physical and social sciences. At the molecular scale, stochastic dynamics is ubiquitous because of thermal fluctuations. The Fokker-Plank-Smoluchowski equation models the time evolution of the…
We consider the boundary driven Quantum Symmetric Simple Inclusion Process (QSSIP) which describes a one-dimensional system of bosonic particles with stochastic nearest-neighbor hopping, modeled as a Brownian motion, with gain/loss…