arXiv subjects

Emanuel Dallas

Publications and source records attributed to Emanuel Dallas.

7 recordsLinked to original sources

arXiv2025

Mereological Quantum Phase Transitions

We introduce the novel concept of mereological quantum phase transition (m-QPTs). Our framework is based on a variational family of operator algebras defining generalized tensor product structures (g-TPS), a parameter-dependent Hamiltonian, and a quantum scrambling functional. By minimizing the scrambling functional, one selects a g-TPS, enabling a pullback of the natural information-geometric metric on the g-TPS manifold to the parameter space. The singularities of this induced metric -- so-called algebra susceptibility -- in the thermodynamic limit characterize the m-QPTs. We illustrate this framework through analytical examples involving quantum coherence and operator entanglement. Moreover, spin-chains numerical simulations show susceptibility sharp responses at an integrability point and strong growth across disorder-induced localization, suggesting critical reorganizations of emergent subsystem structure aligned with those transitions.

quant-ph↗

arXiv2025

Nonlocal Magic Generation and Information Scrambling in Noisy Clifford Circuits

In this work, we investigate the average information scrambling and nonlocal magic generation properties of random Clifford encoding-decoding circuits perturbed by local noise. We quantify these with the bipartite algebraic out-of-time order correlator ($\mathcal{A}$-OTOC) and average Pauli-entangling power (APEP) respectively. Using recent advances in the representation theory of the Clifford group, we compute both quantities' averages in the limit that the circuits become infinitely large. We observe that both display a ``butterfly effect" whereby noise occurring on finitely many qubits leads to macroscopic information scrambling and nonlocal magic generating power. Finally, we numerically study the relationship between the magic capacity, an operator-level magic monotone, of the noise channel and the APEP of the resulting circuit, which may provide insight for designing efficient nonlocal magic factories.

quant-ph↗

arXiv2024

A Butterfly Effect in Encoding-Decoding Quantum Circuits

The study of information scrambling has profoundly deepened our understanding of many-body quantum systems. Much recent research has been devote to understanding the interplay between scrambling and decoherence in open systems. Continuing in this vein, we investigate scrambling in a noisy encoding-decoding circuit model. Specifically, we consider an $L$-qubit circuit consisting of a Haar-random unitary, followed by noise acting on a subset of qubits, and then by the inverse unitary. Scrambling is measured using the bipartite algebraic out-of-time-order correlator ($\mathcal{A}$-OTOC), which allows us to track information spread between extensively sized subsystems. We derive an analytic expression for the $\mathcal{A}$-OTOC that depends on system size and noise strength. In the thermodynamic limit, this system displays a \textit{butterfly effect} in which infinitesimal noise induces macroscopic information scrambling. We also perform numerical simulations while relaxing the condition of Haar-randomness, which preliminarily suggest that this effect may manifest in a larger set of circuits.

quant-ph↗

arXiv2024

Operator Space Entangling Power of Quantum Dynamics and Local Operator Entanglement Growth in Dual-Unitary Circuits

Operator entanglement is a well-established measure of operator complexity across a system bipartition. In this work, we introduce a measure for the ability of a unitary channel to generate operator entanglement, representing an operator-level generalization of the state-space entangling power. This operator space entangling power is demonstrated to be linked to the scrambling properties of the unitary channel via the recently introduced concept of mutual averaged non-commutativity of quantum operator algebras. An upper bound for the operator space entangling power is identified, corresponding to unitary channels with scrambling properties akin to those of typical unitaries. Additionally, for Hamiltonian dynamics, we find that the short-time growth rate of the operator space entangling power matches the Gaussian scrambling rate of the bipartite out-of-time-order-correlator, establishing a direct link between information scrambling and operator entanglement generation for short time scales. Finally, we examine the average growth of local operator entanglement across a symmetric bipartition of a spin-chain. For dual-unitary circuits, a combination of analytical and numerical investigations demonstrates that the average growth of local operator entanglement exhibits two distinct regimes in relation to the operator space entangling power of the building-block gate.

quant-ph↗

arXiv2023

Long-time Quantum Scrambling and Generalized Tensor Product Structures

Much recent work has been devoted to the study of information scrambling in quantum systems. In this paper, we study the long-time properties of the algebraic out-of-time-order-correlator ("$\mathcal{A}$-OTOC") and derive an analytical expression for its long-time average under the non-resonance condition. The $\mathcal{A}$-OTOC quantifies quantum scrambling with respect to degrees of freedom described by an operator subalgebra $\mathcal{A}$, which is associated with a partitioning of the corresponding system into a generalized tensor product structure. Recently, the short-time growth of the $\mathcal{A}$-OTOC was proposed as a criterion to determine which partition arises naturally from the system's unitary dynamics. In this paper, we extend this program to the long-time regime where the long-time average of the $\mathcal{A}$-OTOC serves as the metric of subsystem emergence. Under this framework, natural system partitions are characterized by the tendency to minimally scramble information over long time scales. We consider several physical examples, ranging from quantum many-body systems and stabilizer codes to quantum reference frames, and perform the minimization of the $\mathcal{A}$-OTOC long-time average both analytically and numerically over relevant families of algebras. For simple cases subject to the non-resonant condition, minimal $\mathcal{A}$-OTOC long-time average is shown to be related to minimal entanglement of the Hamiltonian eigenstates across the emergent system partition. Finally, we conjecture and provide evidence for a general structure of the algebra that minimizes the average for non-resonant Hamiltonians.

quant-ph↗

arXiv2022

Operational Quantum Mereology and Minimal Scrambling

In this paper we will attempt to answer the following question: what are the natural quantum subsystems which emerge out of a system's dynamical laws? To answer this question we first define generalized tensor product structures (gTPS) in terms of observables, as dual pairs of an operator subalgebra $\cal A$ and its commutant. Second, we propose an operational criterion of minimal information scrambling at short time scales to dynamically select gTPS. In this way the emergent subsystems are those which maintain the longest informational identity. This strategy is made quantitative by defining a Gaussian scrambling rate in terms of the short-time expansion of an algebraic version of the Out of Time Order Correlation (OTOC) function i.e., the $\cal A$-OTOC. The Gaussian scrambling rate is computed analytically for physically important cases of general division into subsystems, and is shown to have an intuitive and compelling physical interpretation in terms of minimizing the interaction strength between subsystems.

quant-ph↗

arXiv2022

No ((n, k, d < 127)) code can violate the quantum Hamming bound

It is well-known that pure quantum error correcting codes (QECCs) are constrained by a quantum version of the Hamming bound. Whether impure codes also obey such a bound, however, remains a long-standing question with practical implications for the efficacy of QECCs. We employ a combination of previously derived bounds on QECCs to demonstrate that a subset of all codes must obey the quantum Hamming bound. Specifically, we combine an analytical bound due to Rains with a numerical bound due to Li and Xing to show that no ((n,k,d < 127)) code can violate the quantum Hamming bound.

quant-ph↗