Related papers: Unitary k-designs from random number-conserving qu…
We study the universal structure of late-time ensembles obtained from unitary dynamics in quantum chaotic systems with symmetries, such as charge or energy conservation. We find that although quantum states do not ergodically explore the…
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these…
Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of research into random unitaries that "look" sufficiently Haar…
We develop the concept of a unitary t-design as a means of expressing operationally useful subsets of the stochastic properties of the uniform (Haar) measure on the unitary group U(2^n) on n qubits. In particular, sets of unitaries forming…
We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…
We investigate details of the chaotic dynamics of dual-unitary quantum circuits by evaluating all $2k$-point out-of-time-ordered correlators. For the generic class of circuits, by writing the correlators as contractions of a class of…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
We introduce an approach to compute reduced density matrices for local quantum unitary circuits of finite depth and infinite width. Suppose the time-evolved state under the circuit is a matrix-product state with bond dimension $D$; then the…
Quantum chaos in many-body systems provides a bridge between statistical and quantum physics with strong predictive power. This framework is valuable for analyzing properties of complex quantum systems such as energy spectra and the…
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the…
Conservation of symmetries plays a crucial role in both classical and quantum simulations of many-body systems, enabling the tracking of states with specific symmetry properties and leading to substantial reductions in the number of…
We introduce a model of non-unitary quantum dynamics that exhibits infinitely long-lived discrete spatiotemporal order robust against any unitary or dissipative perturbation. Ergodicity is evaded by combining a sequence of projective…
We investigate the spectral properties of all-to-all interacting spin Hamiltonians acting on exactly $k$ spins, whose coupling coefficients are drawn from a normal distribution with mean $\mu$ and variance $\sigma^2$. For $\mu = 0$, we…
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are…
The randomized linear combination of unitaries (LCU) method with many applications to early fault-tolerant quantum computing algorithms has been proposed. This quantum algorithm computes the same expectation values as the original, fully…
Finding cliques in a graph has several applications for its pattern matching ability. $k$-clique problem, a special case of clique problem, determines whether an arbitrary graph contains a clique of size $k$, has already been addressed in…
We show how local constraints can globally "shatter" Hilbert space into subsectors, leading to an unexpected dynamics with features reminiscent of both many body localization and quantum scars. A crisp example of this phenomenon is provided…
We propose and analyze a versatile and efficient multiparameter quantum sensing protocol, which simultaneously estimates many non-commuting and time-dependent signals that are coherently or incoherently coupled to sensing particles. Even in…