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:2611.16334

Collective information backflow from a local population record: Identifiability and learning

Yifan Shi, Pengju Chen, Duan Wang, Ding Quanzhen, Ting Yu

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

Abstract

Information backflow in a composite quantum system is defined through pairs of evolving states, whereas an experiment may provide only a restricted population record. We study this mismatch for two identical qubits coupled collectively to a vacuum reservoir with an exponential correlation function. An ideal bright-state population trajectory determines the bath-parameter combinations relevant to a finite-time trace-distance backflow diagnostic of the full two-qubit channel, evaluated on a fixed time grid and state-pair bank. The unresolved detuning sign leaves this diagnostic unchanged. This relation allows sparse population records to predict the diagnostic using support-vector learning or direct physical fitting. Finite measurement statistics impose a different restriction: a two-hypothesis bound identifies reservoirs with similar short population records but substantially different backflow. For one six-time protocol with 600 total shots, every estimator using those observations has expected absolute error at least approximately 0.13 at one of two specified reservoirs. Thus a population can be sufficient within a known bath family without permitting uniformly accurate inference from a short noisy record.

DOI
10.48550/arxiv.2611.16334

Related papers

Windowed Finite-Size Scaling of Reference-State Information Backflow in Disordered Quantum Reservoirs

Mitchell Smith

Abstract The suppression of information backflow is central to the emergence of effectively Markovian open-system dynamics, yet finite structured reservoirs need not approach this limit monotonically with increasing size. Here we introduce a windowed finite-size scaling diagnostic for reference-state trace-distance backflow in disordered quantum reservoirs. A two-qubit subsystem is coupled to a finite disordered XY spin-chain reservoir with reservoir-local leakage. For each reservoir size N, disorder strength ω, leakage strength γ res , and disorder realization, we evolve the composite system and compute the trace distance between the reduced subsystem state and a fixed Bell-state reference. The positive time derivative of this distance defines a reference-state backflow diagnostic 𝒩 ref . The leakage-dependent suppression of this diagnostic is fit to 𝒩ref(γres) = Ae−kγres + C, where k defines an emergent Markovianization rate. Using a completed ensemble of 34,560 simulations spanning reservoir sizes N = 2–6, eighteen disorder values in ω ∈ [0.34, 0.48], six leakage strengths, and sixty-four disorder seeds per parameter point, we find that unconstrained finite-size fits over N ≥ 2 are affected by a minimal-reservoir boundary regime. Windowed scaling over extended-reservoir subsets reveals a disorder-dependent transition structure. In the primary transition analysis, the extracted exponent crosses near ω c ≈ 0.417, while the windowed N ≥ 3 analysis identifies a closely related crossover near ω c ≈ 0.411. The deeper N ≥ 4 window remains memory-preserving across the sampled range but trends upward with increasing disorder. These results indicate that finite-reservoir Markovianization is window-dependent: the smallest reservoirs can behave as boundary-dominated auxiliary systems, while larger structured reservoirs exhibit distinct extended-reservoir scaling. This provides a reproducible finite-size diagnostic for separating boundary artifacts from reservoir-size effects in open quantum dynamics.

•Jun 30, 2026•0 citations

From Decoherence to Operationally Recoverable Records: Measurement, Dependence, and Finite-Sample Certification in a Minimal Quantum-Darwinism Model

David Reardon

Abstract Decoherence suppresses interference, but an observer’s ability to reconstruct a classical pointer value depends on additional resources: distinguishable conditional environmental states, an allowed measurement, sufficient accessible fragments, and sufficiently independent records. We provide an explicit minimal quantum-to-operational bridge that places these requirements in one chain. A system qubit is correlated with conditional environmental qubit states, permitting exact expressions for residual coherence, quantum mutual information, pointer Holevo information, accessible information, and Helstrom discrimination error. Full density-matrix calculations validate the formulas across 280 endpoint and interior cases. An accessible-sector/hidden-bath construction shows that coherence can fall below 2.3 × 10⁻⁵ while the observer’s record information and error remain fixed at 0.0803 bits and 0.4009. Measurement policies shift recovery thresholds: for record overlap 0.8 and error tolerance 0.05, collective or optimized adaptive-local discrimination requires four fragments, a fixed canonical-basis measurement requires six, and repeated one-fragment Helstrom measurements followed by classical decoding require seven. More importantly, records matched at the one-fragment level can have radically different collective behavior. For a binary pointer, the common-mode classical channel has an exact accessible-information ceiling of 1 − h₂(0.1) = 0.5310 bits, while the noncommuting hidden-memory ensemble approaches the same Holevo-information ceiling; matched independent records approach one bit and zero error. Disjoint observer counts and unanimous agreement likewise depend on shared error structure. Finally, declared local measurements induce classical record channels that are subjected to held-out model selection, predictive checks, abstention, and simultaneous finite-sample threshold certification. The resulting framework supplies the validated quantum-to-operational record model used in the companion analysis of operational capacity bounds for distinguishable decoherent histories.

•Jul 31, 2026•0 citations

Stable Qubit Readout and the Identifiability of Population Change

Dongdong Zhang

Stable readout statistics are often taken as evidence for a well-defined physical response, but stability alone need not identify which state quantity has changed. We analyze this issue for finite collections of qubit states measured by binary readouts, focusing on changes in computational-basis population. The central question is when reproducible response data certify the sign or range of an underlying population change. We show that the answer is controlled by the calibrated measurement directions, not by loop consistency alone. For a fully calibrated finite readout family, we derive an exact closed-form interval of all compatible population changes. We also construct a same-record, jointly measurable example in which identical probabilities and accepted loop checks admit positive, zero, and negative population interpretations. When only a diagonal readout gain and a bound on coherence sensitivity are trusted, we obtain the sharp minimax interval and the necessary-and-sufficient sign condition $g>2χ$. These results separate implementation stability from population identifiability and provide analytic benchmarks for qubit readout calibration.

quant-pharXiv:2606.30462•Jun 30, 2026•0 citations

Reliable inference from replicated environmental records under sparse sampling and dependence

David Reardon

AbstractReplicated environmental records are often summarized by mutual information or by the number of fragments required to recover a target variable. Both summaries can be misleading when the observed joint alphabet is sparse, errors are dependent, or a selected channel model is used without predictive checking. We analyze a classical replicated-record framework motivated by quantum Darwinism. If every observed full record tuple is unique, plug-in mutual information equals empirical history entropy even at a zero-capacity endpoint. Miller–Madow correction retains the structural failure, whereas permutation subtraction removes spurious information at p=0.5 but can also remove genuine information as informative tuples become sample identifiers. Exact repeated-channel calculations provide a controlled baseline: at whole-history error tolerance 0.10, the IID threshold is 7 fragments for p=0.20 and M=3, 2,065 for p=0.48 and M=3, and 5,905 for p=0.48 and M=100. We distinguish population recovery from finite-sample certification and collective recovery from disjoint operational redundancy. In the exact IID control with K=48, six disjoint seven-fragment groups are population-sufficient, with six fragments unused. End-to-end access uncertainty was evaluated with 240 independently regenerated matrix-and-subset replications per family. The candidate library contains six explicitly defined families, including an interleaved four-group latent model distinct from consecutive blocks. Predictive cutoffs were calibrated from 220 of 300 independent null pipelines per family and evaluated on the remaining 80; each pipeline used 20,000 predictive-reference rows and 1,999 correlated Gaussian max-statistic draws. There were 19 rejections among 480 held-out null pipelines; family-specific counts ranged from 2/80 to 5/80. In 60 repetitions of each of six unseen in-family configurations, structural selection was correct in every run and 3.89% were rejected and abstained. Among 231 reachable, non-abstained runs, mean absolute threshold error was 0.31 fragments (median 0; 90th percentile 1; maximum 3). Predictive checks rejected 70% of 400 runs from ten out-of-family alternatives. Of 120 false negatives, 108 produced the exact reference threshold, seven differed by one fragment, and five by two; none reversed reachability. Near p=0.5, mapped confidence sets retained nominal coverage but remained wide. Recovery claims therefore require a controlled estimator, explicit access policy, dependence-aware scoring, separate population and certified quantities, calibrated abstention, and propagated threshold uncertainty. Keywords: replicated records; sparse alphabets; mutual information; correlated channels; recovery thresholds; redundancy certification; predictive checks; quantum Darwinism

•Jul 31, 2026•0 citations

Reading Qubits with Sequential Weak Measurements: Limits of Information Extraction

Cesar Lema, Aleix Bou-Comas, Atithi Acharya +2 more

Quantum information processing and computation requires high accuracy qubit configuration readout. In many practical schemes, the initial qubit configuration has to be inferred from readout that is a time-dependent weak measurement record. However, a combination of the measurement scheme and intrinsic dynamics can end up scrambling the initial state and lose information irretrievably. Here, we study the information physics of quantum trajectories based on weak measurements in order to address the optimal achievable performance in qubit configuration readout for two realistic models of single qubit readout: (i) Model I is informationally complete, but without intrinsic dynamics; (ii) Model II is informationally incomplete weak measurements with intrinsic dynamics. We first use mutual information to characterize how much intrinsic information about the initial state is encoded in the measurement record. Using a fixed discrete time-step formulation, we compute the mutual information while varying the measurement strength, duration of measurement record, and the relative strength of intrinsic dynamics in our measurement schemes. We also exploit the emergence of continuum scaling and the Stochastic Master Equation in the weak measurement limit. We develop an asymptotic expansion in the measurement efficiency parameter to calculate mutual information, which captures qualitative and quantitative features of the numerical data. The bounds on information extraction are manifested as plateaux in mutual information, our analysis obtains these bounds and also optimal duration of measurement required to saturate them. Our results should be useful both for quantum device operation and optimization and also, possibly, for improving the performance of recent machine learning approaches for qubit and multiqubit configuration readout in current Noisy Intermediate-Scale Quantum (NISQ) experiment regimes.

quant-pharXiv:2512.14583•Quantum Science and Technology•Dec 17, 2025•2 citations

Local Access and Phase Recovery of Source-Tagged Quantum Records

Qingchun Zhang

A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.

•Oct 20, 2026•0 citations
Information backflow in a composite quantum system is defined through pairs of evolving states, whereas an experiment may provide only a restricted population record. We study this mismatch for two identical qubits coupled collectively to a vacuum reservoir with an exponential correlation function. An ideal bright-state population trajectory determines the bath-parameter combinations relevant to a finite-time trace-distance backflow diagnostic of the full two-qubit channel, evaluated on a fixed time grid and state-pair bank. The unresolved detuning sign leaves this diagnostic unchanged. This relation allows sparse population records to predict the diagnostic using support-vector learning or direct physical fitting. Finite measurement statistics impose a different restriction: a two-hypothesis bound identifies reservoirs with similar short population records but substantially different backflow. For one six-time protocol with 600 total shots, every estimator using those observations has expected absolute error at least approximately 0.13 at one of two specified reservoirs. Thus a population can be sufficient within a known bath family without permitting uniformly accurate inference from a short noisy record.
Abstract The suppression of information backflow is central to the emergence of effectively Markovian open-system dynamics, yet finite structured reservoirs need not approach this limit monotonically with increasing size. Here we introduce a windowed finite-size scaling diagnostic for reference-state trace-distance backflow in disordered quantum reservoirs. A two-qubit subsystem is coupled to a finite disordered XY spin-chain reservoir with reservoir-local leakage. For each reservoir size N, disorder strength ω, leakage strength γ res , and disorder realization, we evolve the composite system and compute the trace distance between the reduced subsystem state and a fixed Bell-state reference. The positive time derivative of this distance defines a reference-state backflow diagnostic 𝒩 ref . The leakage-dependent suppression of this diagnostic is fit to 𝒩ref(γres) = Ae−kγres + C, where k defines an emergent Markovianization rate. Using a completed ensemble of 34,560 simulations spanning reservoir sizes N = 2–6, eighteen disorder values in ω ∈ [0.34, 0.48], six leakage strengths, and sixty-four disorder seeds per parameter point, we find that unconstrained finite-size fits over N ≥ 2 are affected by a minimal-reservoir boundary regime. Windowed scaling over extended-reservoir subsets reveals a disorder-dependent transition structure. In the primary transition analysis, the extracted exponent crosses near ω c ≈ 0.417, while the windowed N ≥ 3 analysis identifies a closely related crossover near ω c ≈ 0.411. The deeper N ≥ 4 window remains memory-preserving across the sampled range but trends upward with increasing disorder. These results indicate that finite-reservoir Markovianization is window-dependent: the smallest reservoirs can behave as boundary-dominated auxiliary systems, while larger structured reservoirs exhibit distinct extended-reservoir scaling. This provides a reproducible finite-size diagnostic for separating boundary artifacts from reservoir-size effects in open quantum dynamics.
Abstract Decoherence suppresses interference, but an observer’s ability to reconstruct a classical pointer value depends on additional resources: distinguishable conditional environmental states, an allowed measurement, sufficient accessible fragments, and sufficiently independent records. We provide an explicit minimal quantum-to-operational bridge that places these requirements in one chain. A system qubit is correlated with conditional environmental qubit states, permitting exact expressions for residual coherence, quantum mutual information, pointer Holevo information, accessible information, and Helstrom discrimination error. Full density-matrix calculations validate the formulas across 280 endpoint and interior cases. An accessible-sector/hidden-bath construction shows that coherence can fall below 2.3 × 10⁻⁵ while the observer’s record information and error remain fixed at 0.0803 bits and 0.4009. Measurement policies shift recovery thresholds: for record overlap 0.8 and error tolerance 0.05, collective or optimized adaptive-local discrimination requires four fragments, a fixed canonical-basis measurement requires six, and repeated one-fragment Helstrom measurements followed by classical decoding require seven. More importantly, records matched at the one-fragment level can have radically different collective behavior. For a binary pointer, the common-mode classical channel has an exact accessible-information ceiling of 1 − h₂(0.1) = 0.5310 bits, while the noncommuting hidden-memory ensemble approaches the same Holevo-information ceiling; matched independent records approach one bit and zero error. Disjoint observer counts and unanimous agreement likewise depend on shared error structure. Finally, declared local measurements induce classical record channels that are subjected to held-out model selection, predictive checks, abstention, and simultaneous finite-sample threshold certification. The resulting framework supplies the validated quantum-to-operational record model used in the companion analysis of operational capacity bounds for distinguishable decoherent histories.
Stable readout statistics are often taken as evidence for a well-defined physical response, but stability alone need not identify which state quantity has changed. We analyze this issue for finite collections of qubit states measured by binary readouts, focusing on changes in computational-basis population. The central question is when reproducible response data certify the sign or range of an underlying population change. We show that the answer is controlled by the calibrated measurement directions, not by loop consistency alone. For a fully calibrated finite readout family, we derive an exact closed-form interval of all compatible population changes. We also construct a same-record, jointly measurable example in which identical probabilities and accepted loop checks admit positive, zero, and negative population interpretations. When only a diagonal readout gain and a bound on coherence sensitivity are trusted, we obtain the sharp minimax interval and the necessary-and-sufficient sign condition g>2χg>2χg>2χ. These results separate implementation stability from population identifiability and provide analytic benchmarks for qubit readout calibration.
AbstractReplicated environmental records are often summarized by mutual information or by the number of fragments required to recover a target variable. Both summaries can be misleading when the observed joint alphabet is sparse, errors are dependent, or a selected channel model is used without predictive checking. We analyze a classical replicated-record framework motivated by quantum Darwinism. If every observed full record tuple is unique, plug-in mutual information equals empirical history entropy even at a zero-capacity endpoint. Miller–Madow correction retains the structural failure, whereas permutation subtraction removes spurious information at p=0.5 but can also remove genuine information as informative tuples become sample identifiers. Exact repeated-channel calculations provide a controlled baseline: at whole-history error tolerance 0.10, the IID threshold is 7 fragments for p=0.20 and M=3, 2,065 for p=0.48 and M=3, and 5,905 for p=0.48 and M=100. We distinguish population recovery from finite-sample certification and collective recovery from disjoint operational redundancy. In the exact IID control with K=48, six disjoint seven-fragment groups are population-sufficient, with six fragments unused. End-to-end access uncertainty was evaluated with 240 independently regenerated matrix-and-subset replications per family. The candidate library contains six explicitly defined families, including an interleaved four-group latent model distinct from consecutive blocks. Predictive cutoffs were calibrated from 220 of 300 independent null pipelines per family and evaluated on the remaining 80; each pipeline used 20,000 predictive-reference rows and 1,999 correlated Gaussian max-statistic draws. There were 19 rejections among 480 held-out null pipelines; family-specific counts ranged from 2/80 to 5/80. In 60 repetitions of each of six unseen in-family configurations, structural selection was correct in every run and 3.89% were rejected and abstained. Among 231 reachable, non-abstained runs, mean absolute threshold error was 0.31 fragments (median 0; 90th percentile 1; maximum 3). Predictive checks rejected 70% of 400 runs from ten out-of-family alternatives. Of 120 false negatives, 108 produced the exact reference threshold, seven differed by one fragment, and five by two; none reversed reachability. Near p=0.5, mapped confidence sets retained nominal coverage but remained wide. Recovery claims therefore require a controlled estimator, explicit access policy, dependence-aware scoring, separate population and certified quantities, calibrated abstention, and propagated threshold uncertainty. Keywords: replicated records; sparse alphabets; mutual information; correlated channels; recovery thresholds; redundancy certification; predictive checks; quantum Darwinism
Quantum information processing and computation requires high accuracy qubit configuration readout. In many practical schemes, the initial qubit configuration has to be inferred from readout that is a time-dependent weak measurement record. However, a combination of the measurement scheme and intrinsic dynamics can end up scrambling the initial state and lose information irretrievably. Here, we study the information physics of quantum trajectories based on weak measurements in order to address the optimal achievable performance in qubit configuration readout for two realistic models of single qubit readout: (i) Model I is informationally complete, but without intrinsic dynamics; (ii) Model II is informationally incomplete weak measurements with intrinsic dynamics. We first use mutual information to characterize how much intrinsic information about the initial state is encoded in the measurement record. Using a fixed discrete time-step formulation, we compute the mutual information while varying the measurement strength, duration of measurement record, and the relative strength of intrinsic dynamics in our measurement schemes. We also exploit the emergence of continuum scaling and the Stochastic Master Equation in the weak measurement limit. We develop an asymptotic expansion in the measurement efficiency parameter to calculate mutual information, which captures qualitative and quantitative features of the numerical data. The bounds on information extraction are manifested as plateaux in mutual information, our analysis obtains these bounds and also optimal duration of measurement required to saturate them. Our results should be useful both for quantum device operation and optimization and also, possibly, for improving the performance of recent machine learning approaches for qubit and multiqubit configuration readout in current Noisy Intermediate-Scale Quantum (NISQ) experiment regimes.
A quantum record can have locally accessible populations while its distinguishing phase remains correlated with a distant source. We study this access boundary in a specified finite recording apparatus with a returning, vacuum/one-excitation source. Source-position weights give finite-time cutoff bounds without removing any physical hopping or return coupling. For an initially far-tagged record and its incoherent mixture, every reader in a declared position-preserving local-control class obeys a phase-visibility envelope and a necessary access-time inequality. A separate finite local probe shows why that state-discrimination limit is not an unrestricted limit on distinguishing two dynamical laws: fresh local coherence can reveal a stipulated added dephaser without recovering the old record phase. We construct a bounded, degree-three reader accessing only source positions 1–32. With the initial tag fixed at position 65, exact finite-source arrival certificates and an analytical tail comparison yield recovery uniformly over every finite total source length at least 65. Accessible control faults are charged against the arrived signed-phase norm, while source-moving drift is charged against the full norm. At the fixed deadline 25.02/J, the matched phase-dependent difference between coherent and archive-gated dynamics exceeds 0.005, including the stated simultaneous control faults and four additional absolute response allowances of 0.008 each. Complementary results cover a vacuum-ready source and a stronger endpoint-prepared finite example. The conclusions are conditional on the supplied model, preparations, common realized controls and calibration bounds. They are not a switchable-fundamental-law experiment, a nuisance-independent classifier, an optimal-speed theorem or an end-to-end formal verification. The supporting Lean companion contains 59 declarations in eight modules with accepted returned Mac compilation, type and axiom evidence; physical analytical interfaces remain explicit hypotheses or outside that subset. The deposit files include the main manuscript, technical supplement and full research/reproduction package.