The competition between noncommuting projective measurements in discrete quantum circuits can give rise to entanglement transitions. It separates a regime where initially stored quantum information survives the time evolution from a regime where the measurements destroy the quantum information. Here we study one such system---the projective transverse field Ising model---with a focus on its capabilities as a quantum error correction code. The idea is to interpret one type of measurement as an error and the other type as a syndrome measurement. We demonstrate that there is a finite threshold below which quantum information encoded in an initially entangled state can be retrieved reliably. In particular, we implement the maximum likelihood decoder to demonstrate that the error correction threshold is distinct from the entanglement transition. This implies that there is a finite regime where quantum information is protected by the projective dynamics, but cannot be retrieved by using syndrome measurements.
The competition between noncommuting projective measurements in discrete quantum circuits can give rise to entanglement transitions. It separates a regime where initially stored quantum information survives the time evolution from a regime where the measurements destroy the quantum information. Here we study one such system---the projective transverse field Ising model---with a focus on its capabilities as a quantum error correction code. The idea is to interpret one type of measurement as an error and the other type as a syndrome measurement. We demonstrate that there is a finite threshold below which quantum information encoded in an initially entangled state can be retrieved reliably. In particular, we implement the maximum likelihood decoder to demonstrate that the error correction threshold is distinct from the entanglement transition. This implies that there is a finite regime where quantum information is protected by the projective dynamics, but cannot be retrieved by using syndrome measurements.
Random quantum circuits have emerged as useful toy models for entanglement transitions in quantum many-body systems. Here, the authors study a projective version of the transverse-field Ising model without unitary dynamics where the competition between two noncommuting measurements drives an entanglement transition. The authors identify a nonlocal classical process that captures the entanglement dynamics and relate the model to bond percolation in space-time. This leads to a conformal field theory description of the system at criticality which they verify numerically for large systems.
Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and errors leads to sharp magic phase transitions. However, the microscopic mechanism behind these critical phenomena is still an open question, especially since early empirical evidence showed conflicting results regarding their universality classes. In this work, we provide a comprehensive picture of magic phase transitions for the class of encoding-decoding quantum circuits to resolve these ambiguities. We analytically show that the behavior of magic resources is fundamentally dictated by the chosen measurement protocol. When we fix, or post-select, the class of measurement syndromes, the magic transition inherits the universal features of the error-resilience phase transition in the circuits. Interestingly, this clean transition survives even for fully random Haar encoders showing that it is a consequence of initial's state retrieval, and not an artifact of the Clifford encoders. On the other hand, if we consider realistic Born-rule sampling, the intrinsic statistical fluctuations of a given syndrome measurement act as a relevant perturbation. This brings in strong finite-size drifts and an apparent multifractality, which end up altering the critical behavior of the system. We reveal that magic phase transitions are actually direct manifestations of error-resilience thresholds, rather than independent critical phenomena, reconciling conflicting observations from the earlier literature. Ultimately, our framework clarifies how the quantum computational power can survive, or be irreversibly destroyed, due to the competition between scrambling, measurements, and errors.
We introduce a novel type of quantum error correcting code, called the spinor code, based on spaces defined by total spin. The code is a nonstabilizer code, and is also a nonlinear quantum error correcting code, meaning that quantum information is encoded in a parameterized family of quantum states, rather than a linear superposition of code words. Syndrome measurements are performed by projecting on states with differing total spin, with an associated correction to map states back to the maximum total spin space. We show that the code is asymptotically capable of protecting against any single qubit Pauli error for Gaussian distributed states such as spin coherent state. We directly evaluate the performance under the depolarizing channel, considering various cases, with and without initialization and measurement errors, as well as two qubit errors. We estimate the code-capacity threshold to be in the range of 32-75%, while the phenomenological threshold is in the range 9-75%.
We propose a scalable and noise-resilient protocol for the detection of the entanglement transition in a projective version of the transverse field Ising model. Entanglement transitions are experimentally difficult to observe due to the inherent randomness of projective measurements and noise in large-scale experimental settings. Our approach combines error correction algorithms with classical shadow tomography to overcome both problems. This allows for experimentally accessible upper and lower bounds on the entanglement transition without postselection or full state tomography. These bounds remain robust under noise and their sharpness is a measure of the noise rate.
We analyze the dynamics of entanglement entropy in a generic quantum many-body open system from the perspective of quantum information and error corrections. We introduce a random unitary circuit model with intermittent projective measurements, in which the degree of information scrambling by the unitary and the rate of projective measurements are independently controlled. This model displays two stable phases, characterized by the volume-law and area-law scaling entanglement entropy in steady states. The transition between the two phases is understood from the point of view of quantum error correction: the chaotic unitary evolution protects quantum information from projective measurements that act as errors. A phase transition occurs when the rate of errors exceeds a threshold that depends on the degree of information scrambling. We confirm these results using numerical simulations and obtain the phase diagram of our model. Our work shows that information scrambling plays a crucial role in understanding the dynamics of entanglement in an open quantum system and relates the entanglement phase transition to changes in quantum channel capacity.
Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.