Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.04791

Sector-memory obstruction to probe-level bath emergence in finite programmable qubit environments

Gaurav Sarmah, Ramakrishna Podila

quant-phcond-mat.stat-mechSubmitted Jul 6, 2026• Announced Jul 7, 2026• 0 citations
arXivHTMLPDF

Abstract

Finite quantum environments can relax local probes without acting as canonical baths. We study this distinction for a probe qubit coupled to a programmable bath of ($N$) qubits under excitation-number-conserving dynamics. The conserved charge partitions the Hilbert space into sectors. We characterize probe-level bath emergence using the sector-resolved late-time population ($p_e^{(q)}$), the sector-memory variance ($M_N$), and a global Gibbs-fit error ($Δ_G^{\mathrm{global}}$). Exact simulations with Haar-random pure states in each complete fixed-charge sector yield sector-dependent populations close to the maximally mixed-sector benchmark ($p_e^{(q)}=q/(N+1)$), producing a nonzero Gibbs obstruction. We then construct charge-preserving Floquet circuits using ($R_z$) phases and ($XX+YY$) exchange gates, validate them with ideal and noisy Qiskit simulations, and implement finite-depth experiments on IBM Fez. For ($N=4$) and ($ε=0$), the hardware data give ($M_N \simeq 0.044$), ($Δ_G^{\mathrm{global}} \simeq 0.558$), and charge preservation near 0.90 after readout mitigation. A paired symmetry-breaking scan using bath ($R_x(ε)$) rotations reduces both diagnostics while increasing charge leakage, but does not erase sector ordering over the accessible depths. These results show that equilibration within constrained sectors is insufficient to produce a single sector-independent Gibbs state for the probe.

Comments
12 pages, 5 figures

Related papers

Slow thermalization and subdiffusion in U(1) conserving Floquet random circuits

Cheryne Jonay, Joaquin F. Rodriguez-Nieva, Vedika Khemani

Random quantum circuits are paradigmatic models of minimally structured and analytically tractable chaotic dynamics. We study a family of Floquet unitary circuits with Haar random $U(1)$ charge conserving dynamics; the minimal such model has nearest-neighbor gates acting on spin-1/2 qubits, and a single layer of even/odd gates repeated periodically in time. We find that this minimal model is not robustly thermalizing at numerically accessible system sizes, and displays slow subdiffusive dynamics for long times. We map out the thermalization dynamics in a broader parameter space of charge conserving circuits, and understand the origin of the slow dynamics in terms of proximate localized and integrable regimes in parameter space. In contrast, we find that small extensions to the minimal model are sufficient to achieve robust thermalization; these include (i) increasing the interaction range to three-site gates, (ii) increasing the local Hilbert space dimension by appending an additional unconstrained qubit to the conserved charge on each site, or (iii) using a larger Floquet period comprised of two independent layers of gates. Our results should inform future studies of charge conserving circuits, which are relevant for a wide range of topical theoretical questions.

arXiv:2210.13429•Physical review. B./Physical review. B•Jan 22, 2024•10 citations

Localized charges, reset noise, and boundary memory in matrix-product-conserving quantum chains

Ron Rubin

We construct boundary observables that retain memory for a quantified time window in quantum chains whose basis configurations carry a conserved ordered product of matrix labels. Under strong-irreducibility and proximality hypotheses on the label matrices, projective contraction of random matrix products localizes a conserved charge in the root-mean-square over uniform basis configurations. A finite-time inequality then converts readout overlap and reset leakage into a correlation bound: for a conserved reference observable $H$, a readout $F$, accumulated squared leakage $\mathcal B$, and the normalized Hilbert-Schmidt inner product, $\langle F,Φ(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2$. Here $Φ$ is a sequence of conserving channels and partial resets. The bound holds for each such circuit, without averaging its gates. It yields an exponential memory window in the distance from the noisy region, with quantitative corrections for spatially distributed noise and imperfect conservation. For a thirteen-state elementary-matrix model, exact polynomial certificates give root-mean-square localization error $e^{-r/1400}$ between the charge and its restriction to the last $r$ sites, and limiting variance at least $1/19$ for a rational charge. A related normalized-Gram charge gives an eight-site certificate retaining more than half the specified readout correlation through two boundary-reset rounds. Uniform depolarization imposes an inverse-noise-rate lifetime ceiling. A two-qubit IBM experiment illustrates the general reset inequality; it does not realize the matrix-product chain. We provide proofs, exact certificate programs, and an independent recount of the archived experimental outcomes.

quant-pharXiv:2609.23195•Sep 22, 2026•0 citations

Diffusive Speed Limits for U(1)-Covariant Quantum Error Correction

Jianqi Sheng

Fast preparation of quantum error-correcting codes is essential for scalable quantum memories, but geometric locality and $U(1)$ charge conservation impose an unavoidable transport constraint. We combine exact complementary-channel geometry, charge-sector Haar analysis, and a gate-resolved connected-moment expansion to study one-dimensional covariant encoders under flagged erasure. Charge-Haar codes attain the universal adjacent-charge lower bound up to exponentially small corrections, yielding an exact $n^{-1/2}$ extensive-erasure law and a sharp half-erasure transition. For local number-conserving brickwork circuits, diffusion of the logical charge enforces an $Ω(n^2)$ encoding-time lower bound; we also prove an $O(n^3)$ mixing bound for the classical component and reduce the remaining full-channel upper bound to a source-restricted low-support operator-spreading problem. These results identify diffusion as an operational limit on symmetry-constrained quantum coding and establish a route to its exact formation time.

quant-pharXiv:2608.04953•Aug 6, 2026•0 citations

Loop charges and fragmentation in pairwise difference conserving circuits

Anonymous, Cheryne Jonay, Tomaž Prosen

In this work, we introduce a broad class of circuits, or quantum cellular automata, which we call pairwise difference conserving (PDC) circuits. These models are characterized by local gates that preserve the pairwise difference of local operators (e.g., particle number). Such circuits can be defined on arbitrary graphs in arbitrary dimensions for both quantum and classical degrees of freedom. A key consequence of PDC construction is the emergence of an extensive set of loop charges associated with closed walks of even length on the graph. These charges exhibit a one-dimensional character reminiscent of 1-form symmetries and lead to strong Hilbert space fragmentation. As a case study, we analyze a quasi-one-dimensional ladder geometry, where we characterize all dynamically disconnected sectors by the loop-charge symmetries, providing a complete decomposition of the Hilbert space. For the ladder geometry, we observe clear signatures of nonergodic dynamics even within the largest symmetry sector.

arXiv:2510.18992•Physical review. B./Physical review. B•Aug 12, 2026•1 citation

Measurement Backaction, Selective Reset, and Stability of M-Event Memory

Xianwei Meng

Can a measurement cycle stabilize an observation response without erasing the event memory carried through it? We address this question in the classical variational event layer of a physical– observation dual-axis model. An explicit canonical record coupling preserves the selector angle but disturbs its conjugate charge, which also controls the subsequent response. We prove an obstruction to informative readout that preserves the complete selector pair on an open phase-space domain, and derive a resolution–backaction bound for smooth binary event cells. The free benchmark orbit is hyperbolic, with Floquet multipliers 2.408265755267 and 0.415236565073. A meridional reset generated by a response potential and selective dissipation adds no selector phase. At fixed selector charge and with pair-transparent readout, its isotropic contraction factor stabilizes the response precisely when a < 0.415236565073. The attracting response circle retains a neutral phase direction; a convergent asymptotic-phase correction reduces the nearby dynamics to the original rotation. For independent Gaussian cycle noise, an exact Fourier law determines recurrence broadening. Unrestored martingale charge kicks instead produce cubic accumulated phase variance in the linear response regime. The resulting theory separates response stabilization, instantaneous phase preservation, and conservation of the coupling that carries memory into the next event. It supplies calculable readout and reset mechanisms while preserving the original ideal M-event phase.

•Sep 8, 2026•0 citations

Quantum state randomization constrained by non-Abelian symmetries

Yuhan Wu, Joaquin F. Rodriguez-Nieva

The emergence of randomness from unitary quantum dynamics is a central problem across diverse disciplines, ranging from the foundations of statistical mechanics to quantum algorithms and quantum computation. Physical systems are invariably subject to constraints -- from simple scalar symmetries to more complex non-Abelian ones -- that restrict the accessible regions of Hilbert space and obstruct the generation of pure random states. In this work, we show that for systems with noncommuting symmetries such as SU(2), the degree of Haar-like randomization achievable under unitary dynamics is strongly constrained by experimental limitations on state initialization, in particular low-entanglement initial states, rather than by the symmetry-constrained dynamics themselves. Specifically, we show that time-evolved states can, in principle, reproduce Haar-like behavior at the level of finite statistical moments (i.e., those accessible under realistic experimental conditions with a finite number of state copies) provided that the initial state matches the corresponding moments of the conserved operators in the Haar ensemble. However, for the unentangled initial states commonly used in programmable quantum systems, this condition cannot be satisfied. Consequently, even at asymptotically long times in strongly quantum-chaotic regimes, late-time states remain distinguishable from Haar-random states in probes such as entanglement entropy, with deviations from Haar behavior that remain finite with increasing system size. We quantify the maximal entanglement entropy achievable and identify the unentangled initial conditions that yield the most entropic late-time states. Our results show that the combination of non-Abelian symmetry structure and experimental constraints on state preparation can strongly limit the degree of Haar-like randomization achievable at late times.

cond-mat.stat-mechCross-listedarXiv:2604.05043•Apr 8, 2026•0 citations
Finite quantum environments can relax local probes without acting as canonical baths. We study this distinction for a probe qubit coupled to a programmable bath of (NNN) qubits under excitation-number-conserving dynamics. The conserved charge partitions the Hilbert space into sectors. We characterize probe-level bath emergence using the sector-resolved late-time population (pe(q)p_e^{(q)}pe(q)​), the sector-memory variance (MNM_NMN​), and a global Gibbs-fit error (ΔGglobalΔ_G^{\mathrm{global}}ΔGglobal​). Exact simulations with Haar-random pure states in each complete fixed-charge sector yield sector-dependent populations close to the maximally mixed-sector benchmark (pe(q)=q/(N+1)p_e^{(q)}=q/(N+1)pe(q)​=q/(N+1)), producing a nonzero Gibbs obstruction. We then construct charge-preserving Floquet circuits using (RzR_zRz​) phases and (XX+YYXX+YYXX+YY) exchange gates, validate them with ideal and noisy Qiskit simulations, and implement finite-depth experiments on IBM Fez. For (N=4N=4N=4) and (ε=0ε=0ε=0), the hardware data give (MN≃0.044M_N \simeq 0.044MN​≃0.044), (ΔGglobal≃0.558Δ_G^{\mathrm{global}} \simeq 0.558ΔGglobal​≃0.558), and charge preservation near 0.90 after readout mitigation. A paired symmetry-breaking scan using bath (Rx(ε)R_x(ε)Rx​(ε)) rotations reduces both diagnostics while increasing charge leakage, but does not erase sector ordering over the accessible depths. These results show that equilibration within constrained sectors is insufficient to produce a single sector-independent Gibbs state for the probe.
Random quantum circuits are paradigmatic models of minimally structured and analytically tractable chaotic dynamics. We study a family of Floquet unitary circuits with Haar random U(1)U(1)U(1) charge conserving dynamics; the minimal such model has nearest-neighbor gates acting on spin-1/2 qubits, and a single layer of even/odd gates repeated periodically in time. We find that this minimal model is not robustly thermalizing at numerically accessible system sizes, and displays slow subdiffusive dynamics for long times. We map out the thermalization dynamics in a broader parameter space of charge conserving circuits, and understand the origin of the slow dynamics in terms of proximate localized and integrable regimes in parameter space. In contrast, we find that small extensions to the minimal model are sufficient to achieve robust thermalization; these include (i) increasing the interaction range to three-site gates, (ii) increasing the local Hilbert space dimension by appending an additional unconstrained qubit to the conserved charge on each site, or (iii) using a larger Floquet period comprised of two independent layers of gates. Our results should inform future studies of charge conserving circuits, which are relevant for a wide range of topical theoretical questions.
We construct boundary observables that retain memory for a quantified time window in quantum chains whose basis configurations carry a conserved ordered product of matrix labels. Under strong-irreducibility and proximality hypotheses on the label matrices, projective contraction of random matrix products localizes a conserved charge in the root-mean-square over uniform basis configurations. A finite-time inequality then converts readout overlap and reset leakage into a correlation bound: for a conserved reference observable HHH, a readout FFF, accumulated squared leakage B\mathcal BB, and the normalized Hilbert-Schmidt inner product, ⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22+B)−∥F∥22\langle F,Φ(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22​+B)−∥F∥22​. Here ΦΦΦ is a sequence of conserving channels and partial resets. The bound holds for each such circuit, without averaging its gates. It yields an exponential memory window in the distance from the noisy region, with quantitative corrections for spatially distributed noise and imperfect conservation. For a thirteen-state elementary-matrix model, exact polynomial certificates give root-mean-square localization error e−r/1400e^{-r/1400}e−r/1400 between the charge and its restriction to the last rrr sites, and limiting variance at least 1/191/191/19 for a rational charge. A related normalized-Gram charge gives an eight-site certificate retaining more than half the specified readout correlation through two boundary-reset rounds. Uniform depolarization imposes an inverse-noise-rate lifetime ceiling. A two-qubit IBM experiment illustrates the general reset inequality; it does not realize the matrix-product chain. We provide proofs, exact certificate programs, and an independent recount of the archived experimental outcomes.
Fast preparation of quantum error-correcting codes is essential for scalable quantum memories, but geometric locality and U(1)U(1)U(1) charge conservation impose an unavoidable transport constraint. We combine exact complementary-channel geometry, charge-sector Haar analysis, and a gate-resolved connected-moment expansion to study one-dimensional covariant encoders under flagged erasure. Charge-Haar codes attain the universal adjacent-charge lower bound up to exponentially small corrections, yielding an exact n−1/2n^{-1/2}n−1/2 extensive-erasure law and a sharp half-erasure transition. For local number-conserving brickwork circuits, diffusion of the logical charge enforces an Ω(n2)Ω(n^2)Ω(n2) encoding-time lower bound; we also prove an O(n3)O(n^3)O(n3) mixing bound for the classical component and reduce the remaining full-channel upper bound to a source-restricted low-support operator-spreading problem. These results identify diffusion as an operational limit on symmetry-constrained quantum coding and establish a route to its exact formation time.
In this work, we introduce a broad class of circuits, or quantum cellular automata, which we call pairwise difference conserving (PDC) circuits. These models are characterized by local gates that preserve the pairwise difference of local operators (e.g., particle number). Such circuits can be defined on arbitrary graphs in arbitrary dimensions for both quantum and classical degrees of freedom. A key consequence of PDC construction is the emergence of an extensive set of loop charges associated with closed walks of even length on the graph. These charges exhibit a one-dimensional character reminiscent of 1-form symmetries and lead to strong Hilbert space fragmentation. As a case study, we analyze a quasi-one-dimensional ladder geometry, where we characterize all dynamically disconnected sectors by the loop-charge symmetries, providing a complete decomposition of the Hilbert space. For the ladder geometry, we observe clear signatures of nonergodic dynamics even within the largest symmetry sector.
Can a measurement cycle stabilize an observation response without erasing the event memory carried through it? We address this question in the classical variational event layer of a physical– observation dual-axis model. An explicit canonical record coupling preserves the selector angle but disturbs its conjugate charge, which also controls the subsequent response. We prove an obstruction to informative readout that preserves the complete selector pair on an open phase-space domain, and derive a resolution–backaction bound for smooth binary event cells. The free benchmark orbit is hyperbolic, with Floquet multipliers 2.408265755267 and 0.415236565073. A meridional reset generated by a response potential and selective dissipation adds no selector phase. At fixed selector charge and with pair-transparent readout, its isotropic contraction factor stabilizes the response precisely when a < 0.415236565073. The attracting response circle retains a neutral phase direction; a convergent asymptotic-phase correction reduces the nearby dynamics to the original rotation. For independent Gaussian cycle noise, an exact Fourier law determines recurrence broadening. Unrestored martingale charge kicks instead produce cubic accumulated phase variance in the linear response regime. The resulting theory separates response stabilization, instantaneous phase preservation, and conservation of the coupling that carries memory into the next event. It supplies calculable readout and reset mechanisms while preserving the original ideal M-event phase.
The emergence of randomness from unitary quantum dynamics is a central problem across diverse disciplines, ranging from the foundations of statistical mechanics to quantum algorithms and quantum computation. Physical systems are invariably subject to constraints -- from simple scalar symmetries to more complex non-Abelian ones -- that restrict the accessible regions of Hilbert space and obstruct the generation of pure random states. In this work, we show that for systems with noncommuting symmetries such as SU(2), the degree of Haar-like randomization achievable under unitary dynamics is strongly constrained by experimental limitations on state initialization, in particular low-entanglement initial states, rather than by the symmetry-constrained dynamics themselves. Specifically, we show that time-evolved states can, in principle, reproduce Haar-like behavior at the level of finite statistical moments (i.e., those accessible under realistic experimental conditions with a finite number of state copies) provided that the initial state matches the corresponding moments of the conserved operators in the Haar ensemble. However, for the unentangled initial states commonly used in programmable quantum systems, this condition cannot be satisfied. Consequently, even at asymptotically long times in strongly quantum-chaotic regimes, late-time states remain distinguishable from Haar-random states in probes such as entanglement entropy, with deviations from Haar behavior that remain finite with increasing system size. We quantify the maximal entanglement entropy achievable and identify the unentangled initial conditions that yield the most entropic late-time states. Our results show that the combination of non-Abelian symmetry structure and experimental constraints on state preparation can strongly limit the degree of Haar-like randomization achievable at late times.