arXiv subjects

Mircea Bejan

Publications and source records attributed to Mircea Bejan.

5 recordsLinked to original sources

arXiv2026

Spreading of Magic Resource under Unitary Clifford Dynamics

Nonstabilizerness, or quantum magic resource, presents a valuable resource in quantum error correction and computation. We study the dynamics of locally injected nonstabilizerness in unitary Clifford circuits, where the total nonstabilizerness is conserved. However, the absence of physical observables quantifying nonstabilizerness precludes a direct microscopic or hydrodynamic description of its local distribution and dynamics. Using insights from stabilizer quantum error correcting codes, we rigorously show that the spatial distribution of nonstabilizerness can be inferred from a canonical representation of low-magic states, dubbed the bipartite magic gauge. Moreover, we propose two operationally relevant magic length scales. We numerically establish that, at early times, both length scales grow ballistically at distinct velocities set by the entanglement velocity, after which nonstabilizerness delocalizes. Our work sheds light on the spatiotemporal structure of quantum resources and complexity in many-body dynamics, opening up avenues for investigating their transport properties and further connections with quantum error correction.

quant-ph↗

arXiv2026

Projected logical ensembles in surface codes via the random-matrix theory of quantum dots

Measurements underpin active quantum error correction (QEC) and have been recognized as a source of novel measurement-induced many-body phenomena. Here, we study the statistical properties of post-measurement logical states arising in QEC on topological codes subject to deterministic transversal unitary gates. Upon syndrome extraction followed by maximum-likelihood decoding, a Born-weighted ensemble arises which we dub the "projected logical ensemble" (PLE). Focusing on surface codes subject to uniform single-qubit Pauli-$X$ rotations, we characterize the measurement-induced randomness of the PLE. To this end, we show that for a code with a single logical qubit, the PLE is isomorphic to an ensemble of scattering matrices describing mesoscopic quantum dots obtained from a 2D Majorana network model with suitable boundary conditions. We uncover regimes where these quantum dots are chaotic such that their scattering matrices are well-described by random matrix theory. In these regimes, the PLE approaches a universal ensemble that is maximally random up to symmetry and decoder-induced constraints. The symmetry constraints, set by stabilizer and logical operator weights, realize Altland-Zirnbauer classes D or DIII, which we both illustrate. Our results establish a fundamental connection between emergent universality concepts in mesoscopic physics, quantum many-body systems, and QEC.

quant-ph↗

arXiv2025

Matchgate circuits deeply thermalize

We study the ensemble of states generated by performing projective measurements on the output of a random matchgate (or free-fermionic) quantum circuit. We rigorously show that this `projected ensemble' exhibits deep thermalization: For large system sizes, it converges towards a universal ensemble that is uniform over the manifold of Gaussian fermionic states. As well as proving moment-wise convergence of these ensembles, we demonstrate that the full distribution of any physical observable in the projected ensemble is close to its universal form in Wasserstein-1 distance, which we argue is an appropriate and efficiently computable measure of convergence when studying deep thermalization. Using this metric, we also numerically find that local matchgate circuits deeply thermalize after a timescale $t \sim L^2$ set by the diffusive spreading of quantum information. Our work opens up new avenues to experimentally accessible protocols to probe the emergence of quantum statistical mechanics and benchmark quantum simulators.

quant-ph↗

arXiv2024

Dynamical Magic Transitions in Monitored Clifford+T Circuits

The classical simulation of highly-entangling quantum dynamics is conjectured to be generically hard. Thus, recently discovered measurement-induced transitions between highly entangling and low-entanglement dynamics are phase transitions in classical simulability. Here, we study simulability transitions beyond entanglement: noting that some highly-entangling dynamics (e.g., integrable systems or Clifford circuits) are easy to classically simulate, thus requiring "magic"--a subtle form of quantum resource--to achieve computational hardness, we ask how the dynamics of magic competes with measurements. We study the resulting "dynamical magic transitions" focusing on random monitored Clifford circuits doped by T gates (injecting magic). We identify dynamical "stabilizer-purification"--the collapse of a superposition of stabilizer states by measurements--as the mechanism driving this transition. We find cases where transitions in magic and entanglement coincide, but also others with a magic and simulability transition in a highly (volume-law) entangled phase. In establishing our results, we use Pauli-based computation, a scheme distilling the quantum essence of the dynamics to a magic state register subject to mutually commuting measurements. We link stabilizer-purification to "magic fragmentation" wherein these measurements separate into disjoint, O(1)-weight blocks, and relate this to the spread of magic in the original circuit becoming arrested.

quant-ph↗

arXiv2021

Quantum computing critical exponents

We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain. The order parameter only collapses on one side of the transition due to a slowdown of the quantum algorithm when crossing the phase transition. In order to assess performance of the quantum algorithm and compute correlations in a system of up to 752 qubits, we use techniques from integrability to derive closed-form analytical expressions for expectation values with respect to the output of the quantum circuit. We also reduce a conjecture made by Ho and Hsieh about the exact preparation of the transverse field Ising ground state to a system of equations.

quant-ph↗