Related papers: Structured Clifford+T Circuits for Efficient Gener…
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$. Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results…
We study the emergence of complexity in deep random $N$-qubit $T$-gate doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer R\'enyi entropy distribution and the…
Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum…
Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the…
Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states, exhibiting quantum chaos, topological order and localisation. In this work, we investigate the stability of operator localisation and emergence of…
While classical chaos has been successfully characterized with consistent theories and intuitive techniques, such as with the use of Lyapunov exponents, quantum chaos is still poorly understood, as well as its relation with multi-partite…
How classical chaos emerges from the underlying quantum world is a fundamental problem in physics. The origin of this question is in the correspondence principle. Classical chaos arises due to non-linear dynamics, whereas quantum mechanics,…
Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in…
We explore quantum chaos diagnostics of variational circuit states at random parameters and study their correlation with the circuit expressibility and the optimization of control parameters. By measuring the operator spreading coefficient…
Understanding quantum chaos is of profound theoretical interest and carries significant implications for various applications, from condensed matter physics to quantum error correction. Recently, out-of-time ordered correlators (OTOCs) have…
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been successfully applied to verification, linear algebra, stochastic…
We introduce magic-augmented Clifford circuits -- architectures in which Clifford circuits are preceded and/or followed by constant-depth circuits of non-Clifford (``magic") gates -- as a resource-efficient way to realize approximate…
Chaotic dynamics have emerged as a versatile resource for neuromorphic and probabilistic computing, enabling high-dimensional nonlinear processing and classical analogues of quantum randomness. Exploiting chaos for computation requires…
Determining the quantum-classical boundary between quantum circuits which can be efficiently simulated classically and those which cannot remains a fundamental question. One approach to classical simulation is to represent the output of a…
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…
Random permutation circuits were recently introduced as minimal models for local many-body dynamics that can be interpreted both as classical and quantum. Standard dynamical complexity indicators such as damage spreading and…
We perform a detailed numerical study of the distribution of conductances $P(T)$ for quasi-one-dimensional corrugated waveguides as a function of the corrugation complexity (from rough to smooth). We verify the universality of $P(T)$ in…
Non-stabilizerness, alongside entanglement, is a crucial ingredient for fault-tolerant quantum computation and achieving a genuine quantum advantage. Despite recent progress, a complete understanding of the generation and thermalization of…
Random Clifford circuits doped with non Clifford gates exhibit transitions to universal entanglement spectrum statistics[1] and quantum chaotic behavior. In [2] we proved that the injection of $O(n)$ non Clifford gates into a $n$-qubit…
Quantum chaos refers to signatures of classical chaos found in the quantum domain. Recently, it has become common to equate the exponential behavior of out-of-time order correlators (OTOCs) with quantum chaos. The quantum-classical…