Related papers: Relating computational complexity and quantum spec…
Under appropriate conditions controllable two-level systems can be used to detect the third moment of current fluctuations. We derive a Master Equation for a quantum system coupled to a bath valid to the third order in the coupling between…
Relaxation in the time correlation between operators is studied. Quantized chaotic systems are shown to have distinct relaxation fluctuations that are universal and can be usefully modelled by Random Matrix Theory. Various quantized maps…
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical…
The Asymmetric Simple Exclusion Process is one of the most extensively studied models in non-equilibrium statistical mechanics. The macroscopic particle current produced in its steady state is directly related to the breaking of detailed…
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and characterize their computational complexity. In the quantum setting,…
A heuristic model procedure for determining satisfiability of CNF-formulae is set up and described by nonlinear recursion relations for m (number of clauses), n (number of variables) and clause filling k. The system mimicked by 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 investigate quantum phase transitions (QPTs) in spin chain systems characterized by local Hamiltonians with matrix product ground states. We show how to theoretically engineer such QPT points between states with predetermined properties.…
The theory of Gaussian quantum fluctuations around classical steady states in nonlinear quantum-optical systems (also known as standard linearization) is a cornerstone for the analysis of such systems. Its simplicity, together with its…
The random $k$-SAT problem serves as a model that represents the 'typical' $k$-SAT instances. This model is thought to undergo a phase transition as the clause density changes, and it is believed that the random $k$-SAT problem is primarily…
The spectral properties of interacting strongly chaotic systems are investigated for growing interaction strength. A very sensitive transition from Poisson statistics to that of random matrix theory is found. We introduce a new random…
The QSAT problem is the quantified version of the SAT problem. We show the existence of a threshold effect for the phase transition associated with the satisfiability of random quantified extended 2-CNF formulas. We consider boolean CNF…
We study the dynamics of the Mott insulator-superfluid quantum phase transition in a periodic 1D array of Josephson junctions. We show that crossing the critical point diabatically i.e. at a finite rate with a quench time $\tau_Q$ induces…
Through the Monte Carlo simulation of the three-dimensional, three-state Potts model, which is a paradigm of finite-temperature pure gauge QCD, we study the fluctuations of generalized susceptibilities near the temperatures of external…
We consider a topological Hamiltonian and establish a correspondence between its eigenstates and the resource for a causal order game introduced in Ref. [1] known as process matrix. We show that quantum correlations generated in the quantum…
We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines…
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists n-qubit pure state such that its k-qubit reduced density matrices have support on prescribed subspaces.…
Despite the fundamental role the Quantum Satisfiability (QSAT) problem has played in quantum complexity theory, a central question remains open: At which local dimension does the complexity of QSAT transition from "easy" to "hard"? Here, we…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
We numerically analyse quantum survival probability fluctuations in an open, classically chaotic system. In a quasi-classical regime, and in the presence of classical mixed phase space, such fluctuations are believed to exhibit a fractal…