相关论文: Complexity is not Enough for Randomness
It has been shown by various authors under different assumptions that the diameter of a bounded non-trivial set $\gamma$ under the action of a stochastic flow grows linearly in time. We show that the asymptotic linear expansion speed if…
We develop Random Batch Methods for interacting particle systems with large number of particles. These methods use small but random batches for particle interactions, thus the computational cost is reduced from $O(N^2)$ per time step to…
Systems undergoing an equilibrium phase transition from a liquid state to an amorphous solid state exhibit certain universal characteristics. Chief among these are the fraction of particles that are randomly localized and the scaling…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
Now that Bayesian Networks (BNs) have become widely used, an appreciation is developing of just how critical an awareness of the sensitivity and robustness of certain target variables are to changes in the model. When time resources are…
We study the growth of entanglement and circuit complexity in random passive linear optical networks as a function of the circuit depth. For entanglement dynamics, we start with an initial Gaussian state with all $n$ modes squeezed. For…
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…
For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…
We demonstrate that the dynamics of an open quantum system can be calculated efficiently and with predefined error, provided a basis exists in which the system-environment interactions are local and hence obey the Lieb-Robinson bound. We…
We investigate a system of Brownian particles weakly bound by attractive parity-symmetric potentials that grow at large distances as $V(x) \sim |x|^\alpha$, with $0 < \alpha < 1$. The probability density function $P(x,t)$ at long times…
We consider processes which have the distribution of standard Brownian motion (in the forward direction of time) starting from random points on the trajectory which accumulate at $-\infty$. We show that these processes do not have to have…
It has been recently proposed that the naive semiclassical prediction of non-unitary black hole evaporation can be understood in the fundamental description of the black hole as a consequence of ignorance of high-complexity information.…
We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian,…
The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…
We present a theoretical method to generate a highly accurate {\em time-independent} Hamiltonian governing the finite-time behavior of a time-periodic system. The method exploits infinitesimal unitary transformation steps, from which…
We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…
While the impact of locality restrictions on quantum dynamics and algorithmic complexity has been well studied in the general case of time-dependent Hamiltonians, the capabilities of time-independent protocols are less well understood.…
We study how to construct a stochastic process on a finite interval with given `roughness' and finite joint moments of marginal distributions. We first extend Ciesielski's isomorphism along a general sequence of partitions, and provide a…
Locality is a fundamental feature of many physical time evolutions. Assumptions on locality and related structural properties also underlie recently proposed procedures for learning an unknown Hamiltonian from access to the induced time…