Related papers: Transitions in entanglement complexity in random q…
We study random constant-depth quantum circuits in a two-dimensional architecture. While these circuits only produce entanglement between nearby qubits on the lattice, long-range entanglement can be generated by measuring a subset of the…
We study quantum information scrambling in a random unitary circuit that exchanges qubits with an environment at a rate $p$. As a result, initially localized quantum information not only spreads within the system, but also spills into the…
Decoherence induced by coupling a system with an environment may display universal features. Here we demostrate that when the coupling to the system drives a quantum phase transition in the environment, the temporal decay of quantum…
Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is…
By considering transition-metal (Shiba-Rusinov model) and rare-earth metal impurities (Abrikosov-Gor'kov theory) effect on a many-body system, i.e., a BCS s-wave superconductor, quantum bipartite entanglement of two electrons of the Cooper…
We review here some universal aspects of the physics of two-electron molecular transistors in the absence of strong spin-orbit effects. Several recent quantum dots experiments have shown that an electrostatic backgate could be used to…
We investigate the competition between pair entanglement of two spin qubits in double quantum dots attached to leads with various topologies and the separate entanglement of each spin with nearby electrodes. Universal behavior of…
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…
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…
In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially…
Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the…
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
We show that the interplay of geometric criticality and quantum fluctuations leads to a novel universality class for the percolation quantum phase transition in diluted magnets. All critical exponents involving dynamical correlations are…
The study of the boundary between classically simulable and computationally complex quantum dynamics is fundamental to understanding which physical resources may enable enhanced information-processing capabilities. We investigate this…
Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…
We study purity decay -- a measure of bipartite entanglement -- in a chain of $n$ qubits under the action of various geometries of nearest-neighbor random two-site unitary gates. We use a Markov chain description of average purity…
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…
Quantum Entanglement is a fundamentally important resource in Quantum Information Science; however, generating it in practice is plagued by noise and decoherence, limiting its utility. Entanglement distillation and forward error correction…
We study critical properties of the entanglement and charge-sharpening measurement-induced phase transitions in a non-unitary quantum circuit evolving with a U(1) conserved charge. Our numerical estimation of the critical properties of the…