Related papers: Quantum Complexity and Chaos in Many-Qudit Doped C…
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…
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…
We investigate the emergence of quantum chaos and unitary T-design behavior in derandomized Clifford+T circuits using causal cover architectures. Motivated by the need for deterministic constructions that can exhibit chaotic behavior across…
Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is…
We investigate the statistical properties of orthogonal, or real, Clifford circuits doped with magic and imaginary resources. By developing the Weingarten calculus for the real Clifford group, we derive the exact overlap distribution of…
Recent years have enjoyed a strong interest in exploring properties and applications of random quantum circuits. In this work, we explore the ensemble of $t$-doped Clifford circuits on $n$ qubits, consisting of Clifford circuits…
Quantum chaos is commonly assessed through probe-dependent signatures that need not coincide. Recently, a dissipative signature was proposed for chaotic Floquet systems, where infinitesimal bulk dissipation induces a non-zero constant…
Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space, leading to statistically uniform output probability distributions. In this work, we investigate the anticoncentration of random Clifford…
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…
Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…
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…
The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…
Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of…
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
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…
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…
Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error…
It is well known that a quantum circuit on $N$ qubits composed of Clifford gates with the addition of $k$ non Clifford gates can be simulated on a classical computer by an algorithm scaling as $\text{poly}(N)\exp(k)$[1]. We show that, for a…