Related papers: Average-case quantum complexity from glassiness
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
Aspects of the dynamical glass transition are considered within a mean field spin glass model. At the dynamical transition the the system condenses in a state of lower entropy. The difference, the information entropy or complexity, is…
We start with a rather detailed, general discussion of recent results of the replica approach to statistical mechanics of a single classical particle placed in a random $N (\gg 1)$-dimensional Gaussian landscape and confined by a…
Recently probabilistic hysteresis in isolated Hamiltonian systems of ultracold atoms has been studied in the limit of large particle numbers, where a semiclassical treatment is adequate. The origin of irreversibility in these sweep…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
We reformulate the interpretation of the mean-field glass transition scenario for finite dimensional systems, proposed by Wolynes and collaborators. This allows us to establish clearly a temperature dependent length xi* above which the…
Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant…
Average-case analysis computes the complexity of an algorithm averaged over all possible inputs. Compared to worst-case analysis, it is more representative of the typical behavior of an algorithm, but remains largely unexplored in…
In open quantum systems, a basic question at the interface of quantum information, statistical physics, and many-body dynamics is how well can one infer the structure of noise and dissipation generators from finite-time measurement…
Stability against perturbation is a highly nontrivial property of quantum systems and is often a requirement to define new phases. In most systems where stability can be rigorously established, only static perturbations are considered;…
We provide a noisy intermediate-scale quantum framework for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithm does not require any…
In this article, we study the problem of sampling from distributions whose densities are not necessarily smooth nor logconcave. We propose a simple Langevin-based algorithm that does not rely on popular but computationally challenging…
Gaussian building blocks are essential for photonic quantum information processing, and universality can be practically achieved by equipping Gaussian circuits with adaptive measurement and feedforward. The number of adaptive steps then…
An ensemble of classical subsystems interacting with surrounding particles has been considered. In general case, a phase volume of the subsystems ensemble was shown to be a function of time. The evolutional equations of the ensemble are…
We consider an arbitrary quantum system coupled non perturbatively to a large arbitrary and fully quantum environment. In [G. Ithier and F. Benaych-Georges, Phys. Rev. A 96, 012108 (2017)] the typicality of the dynamics of such an embedded…
We introduce a class of dissipative quantum spin models with local interactions and without quenched disorder that show glassy behaviour. These models are the quantum analogs of the classical facilitated spin models. Just like their…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to…
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear…