betaFeedback

WorksPhysics and Astronomy

The Structure of Shared Classical Facts in Quantum Systems

Abstract

Perfectly matching local outcomes need not constitute a nondisturbing shared classical record. For finite-dimensional multipartite states, we prove that nontrivial exact records are equivalent to a spectrum sharing structure with a unique finest decomposition into locally distinguishable sectors, where entanglement may persist. For a fixed complete pointer, exact sharing is equivalent to strong quantum Darwinism together with global nondisturbance, while spectrum broadcast structure additionally requires conditional independence. Arbitrarily weak full-rank admixtures eliminate exact sharing, but two-sided distance bounds quantify robustness through disturbance and disagreement, while information bounds connect accurate local readouts to observer consensus.

Introduction

A photograph, a detector click, and a memory register may all convey the same fact even though they occupy different physical systems. Explaining how such independently accessible records emerge from quantum mechanics is a central problem in the quantum-to-classical transition. Decoherence shows how interactions with an environment suppress interference between preferred pointer alternatives in a reduced state [1, 2, 3, 4, 5]. Yet local decoherence alone does not identify which fragments store the information, whether separate observers can access it, or whether reading it changes the larger state.

Quantum Darwinism (QD) addresses the proliferation of information into environmental fragments [6, 7, 8, 9, 10]. Its characteristic mutual-information plateau indicates that many fragments correlate strongly with the same system [11, 12, 13, 14, 15]. A plateau is not, however, a direct certificate of readable classical records: quantum mutual information also counts correlations that local measurements cannot turn into classical information about a specified pointer [16, 17, 18, 19]. Strong quantum Darwinism (SQD) remedies this by requiring the relevant information to be classically accessible and excluding discord from the system–fragment correlations [20, 21].

Spectrum broadcast structure (SBS) gives a complementary state-level description [21, 22, 23, 24]. In an SBS state, distinct system-pointer values occupy orthogonal conditional supports in every observed fragment, allowing independent nondisturbing readout. SBS additionally requires those fragments to be uncorrelated conditional on the pointer value. That product assumption is stronger than the existence of a shared classical record. Indeed, SQD supplemented by a suitable multipartite independence condition yields SBS [20, 25, 26]. These approaches illuminate information redundancy, local accessibility, and conditional independence, but do not make them interchangeable.

Nondisturbance is not new to structural accounts of objectivity: Bohr’s requirement was used to derive the form of objective pointer records in a system–environment setting [23, 27]. A complementary line of work uses quantum error correction and recoverable logical algebras to describe classical information available on multiple fragments [28, 29, 30]. These results motivate a distinction between the local recoverability of encoded information and a nondisturbing measurement of a particular full state. Measuring a locally represented logical observable can still dephase a coherent encoded state when its outcome is ignored.

Here we fix a multipartite density operator and a partition into disjoint observers’ laboratories, without designating a privileged system or a pointer in advance. We ask whether some nonconstant classical label admits locally calibrated readouts that agree with certainty and whose outcome-forgotten action preserves the entire tested state. Both the label and the readouts are allowed to depend on that state, while the observer partition remains fixed. This state-dependent operational question differs from identifying which logical observables are representable on a code subspace, and global nondisturbance cannot be inferred from reduced system–fragment states alone.

The distinction already appears for two qubits. Both the classical mixture

ρcl=12∣00⟩⟨00∣+12∣11⟩⟨11∣(1)\rho_{\mathrm{cl}}=\tfrac{1}{2}|00\rangle\langle00|+\tfrac{1}{2}|11\rangle\langle11| \tag*{(1)}

and the Bell state ∣Φ+⟩=(∣00⟩+∣11⟩)/2|\Phi^{+}\rangle=(|00\rangle+|11\rangle)/\sqrt{2} yield perfectly matching computational-basis outcomes. But only the mixture is preserved by either en route local measurement: measuring the Bell state instead removes its in-branch coherence and produces ρcl\rho_{\mathrm{cl}}. Agreement alone therefore does not establish an already available, nondisturbing shared fact.

Our contributions follow this operational question. First, Sec. II proves that exact shared records are precisely the nontrivial spectrum sharing structures: locally distinguishable orthogonal record sectors, with a unique finest decomposition of the occupied state space. Here “spectrum” denotes record sectors, not necessarily eigenspaces of the density operator. Conditional entanglement is allowed. Second, Sec. III characterizes the extra full-state nondisturbance requirement for a prescribed complete pointer and distinguishes the resulting state family from SQD and SBS. Third, Sec. IV derives two-sided distance bounds for a fixed local readout in terms of its disturbance and disagreement, and connects reliable readout to observer consensus. The proofs and counterexamples are collected in the appendices. Finally, Sec. V discusses the physical interpretation and the open problem of record-formation dynamics.

Structure of exact shared facts

Two requirements for a shared record

Consider a finite-dimensional multipartite state ρ\rho on H=⨂a=1mHa\mathcal{H} = \bigotimes_{a=1}^{m} \mathcal{H}_a, where m≥2m \ge2 and V={1,…,m}V = \{1,\ldots,m\} labels the observers. Each observer controls only its own tensor factor. Any inaccessible environment has already been traced out, and the partition into observers’ laboratories is held fixed throughout the test.

To ask whether one classical label is already available to everyone, let observer aa perform a projective readout {Px(a)}x∈X\{P_x^{(a)}\}_{x\in X}, with ∑xPx(a)=Ia\sum_x P_x^{(a)} = I_a, from a common finite set of calibrated outcomes XX. Calibration specifies which detector outcomes represent the same event, without requiring identical physical detectors. Write Πx(a)=Px(a)⊗I‾a\Pi_x^{(a)} = P_x^{(a)} \otimes\overline{I}_a for the projector on the complete system, where I‾a\overline{I}_a acts as the identity outside laboratory aa.

The readouts define an exact shared record if (i) forgetting the outcome of any one local measurement leaves the entire tested state unchanged and (ii) any two observers obtain the same calibrated answer with probability one. For projective measurements these requirements are

[Πx(a),ρ]=0for every a,x,Tr⁡ ⁣(ρΠx(a)Πy(b))=0for a≠b, x≠y.(2)\begin{aligned} [\Pi_x^{(a)},\rho] &= 0 \quad\text{for every } a,x,\\ \operatorname{Tr}\!\left(\rho\Pi_x^{(a)}\Pi_y^{(b)}\right) &= 0 \quad\text{for } a\ne b,\ x\ne y. \tag*{(2)} \end{aligned}

The first condition is equivalent to ∑xΠx(a)ρΠx(a)=ρ\sum_x \Pi_x^{(a)}\rho\Pi_x^{(a)}=\rho for each observer. It concerns the full state, not only the observer’s reduced state or the probabilities of the measured outcomes. The second line gives the probability of contradictory reports because measurements on disjoint laboratories commute. It also implies that the probability px=Tr⁡(ρΠx(a))p_x=\operatorname{Tr}(\rho\Pi_x^{(a)}) is independent of aa.

A nontrivial exact shared fact is an exact shared record with at least two outcomes of strictly positive probability. For the fixed observer partition VV, let R\mathcal{R} be the class of states that admit some nontrivial exact shared record. In defining R\mathcal{R}, neither the local measurements nor their calibrated label set is prescribed in advance.

The two requirements play different roles. The Bell state in the Introduction gives perfectly matching ZZ outcomes, but either unread local measurement removes the coherence between ∣00⟩\lvert00\rangle and ∣11⟩\lvert11\rangle. Conversely, local measurements can preserve a state yet produce occasional disagreements, as in the noisy example of Sec. IV. Exact sharing requires both nondisturbance and agreement [23, 27, 31, 32].

Locally distinguishable sectors and their characterization

The operational conditions in Eq. (2) have a state-level counterpart: the state decomposes into orthogonal sectors, and the label of each sector is locally readable in every laboratory. For each occupied label xx (so px>0p_x>0), define

Qx=∏a=1mΠx(a)=⨂a=1mPx(a),ρx=QxρQxpx,Q_x=\prod_{a=1}^{m}\Pi_x^{(a)}=\bigotimes_{a=1}^{m}P_x^{(a)},\qquad \rho_x=\frac{Q_x\rho Q_x}{p_x},
Ha,x=ran⁡Px(a).(3)\mathcal{H}_{a,x}=\operatorname{ran}P_x^{(a)}. \tag*{(3)}

Here QxQ_x is the joint projector for unanimous outcome xx, ρx\rho_x is the normalized state conditioned on that outcome, and Ha,x\mathcal{H}_{a,x} is the local subspace associated with xx in laboratory aa. Perfect agreement gives px=Tr⁡(ρQx)p_x=\operatorname{Tr}(\rho Q_x).

The corresponding state-level condition is formalized as follows.

Definition 1 (Spectrum sharing structure). A finite-dimensional multipartite state ρ\rho on H=⨂a=1mHa\mathcal{H}=\bigotimes_{a=1}^{m}\mathcal{H}_a has a spectrum sharing structure if there exist a finite label set XX, positive numbers pxp_x with ∑xpx=1\sum_x p_x=1, normalized states ρx\rho_x, and subspaces Ha,x⊆Ha\mathcal{H}_{a,x}\subseteq\mathcal{H}_a such that

ρ=⨁x∈Xpxρx,supp⁡ρx⊆⨂a=1mHa,x,(4)\rho=\bigoplus_{x\in X}p_x\rho_x,\qquad \operatorname{supp}\rho_x\subseteq\bigotimes_{a=1}^{m}\mathcal{H}_{a,x}, \tag*{(4)}

and, for each observer aa,

Ha,x⊥Ha,y,x≠y.(5)\mathcal{H}_{a,x}\perp\mathcal{H}_{a,y},\qquad x\ne y. \tag*{(5)}

The direct sum means that different labels occupy orthogonal global blocks, with no coherence between them. The state ρ\rho has no support outside their sum. The structure is nontrivial if ∣X∣≥2|X|\ge2.

This definition expresses the operational requirements as conditions on the state alone. The following theorem shows that the two descriptions are equivalent and, moreover, identifies the unique finest decomposition into shared support sectors.

Theorem 1 (Exact shared facts and spectrum sharing). For a finite-dimensional multipartite state with at least two disjoint observer subsystems, the following statements are equivalent:

  1. The state admits a nontrivial exact shared record satisfying Eq. (2).

  1. The state has a nontrivial spectrum sharing structure in the sense of Definition 1.

Moreover, for the fixed observer partition, there is a unique finest decomposition into shared support sectors,

up to relabeling. If {Eλ}\{E_\lambda\} denotes the orthogonal projections onto these nonzero sectors, then

pλ=Tr⁡(ρEλ),ρλ=EλρEλpλ.(6)p_\lambda= \operatorname{Tr}(\rho E_\lambda), \qquad\rho_\lambda= \frac{E_\lambda\rho E_\lambda}{p_\lambda}. \tag*{(6)}

Every other exact shared record is obtained by combining some of these finest labels. The projectors EλE_\lambda act on the support of ρ\rho, so their sum is the projector onto supp⁡ρ\operatorname{supp}\rho. When no nontrivial shared fact exists, this finest decomposition has only one occupied sector.

Both Eqs. (4) and (5) are essential. Eq. (4) gives globally orthogonal blocks and confines each block to the product of its local record subspaces, whereas Eq. (5) makes different labels orthogonal within every individual laboratory. Thus, global orthogonality alone does not ensure that each observer can distinguish the sectors. Here “spectrum” refers to these record sectors, not necessarily to eigenspaces of ρ\rho. The conditional states ρx\rho_x need not factorize and may remain entangled across laboratories.

Conversely, suppose the state has the structure in Eqs. (4) and (5). In each laboratory, measure the orthogonal subspaces Ha,x\mathcal{H}_{a,x}, assigning any unused orthogonal complement to one of the outcomes. The support condition ensures that every state ρx\rho_x gives outcome xx with certainty in every laboratory. The absence of coherence between different sectors then ensures that forgetting any one outcome leaves ρ\rho unchanged. These readouts consequently satisfy Eq. (2).

Finally, each exact readout induces the same projector on supp⁡ρ\operatorname{supp}\rho in every laboratory. Projectors associated with two different readouts can therefore be represented in different laboratories and commute. Their common refinement gives the unique finest decomposition, and every other exact record is a coarse-graining of it. The projector argument is given in Appendix A.

Scope and implications of the characterization

The Bell-state example in the Introduction illustrates that perfectly correlated local outcomes do not necessarily constitute a nondisturbing shared fact: an unread local measurement may still disturb the joint state. Thus, the theorem characterizes shared records, not correlated measurement statistics alone [17, 19, 33].

A related distinction is that recovering an observable’s outcome statistics is not the same as reading an existing record without disturbing the state. Consider the repetition encoding ∣0⟩L↦∣00⟩|0\rangle_L \mapsto|00\rangle and ∣1⟩L↦∣11⟩|1\rangle_L \mapsto|11\rangle. Either physical qubit reveals the logical ZZ distribution. However, for an encoded superposition

∣ψ⟩=α∣00⟩+β∣11⟩,αβ≠0,|\psi\rangle= \alpha|00\rangle+ \beta|11\rangle, \qquad\alpha\beta\ne0,

an unread measurement of either qubit produces

∣α∣2∣00⟩⟨00∣+∣β∣2∣11⟩⟨11∣,|\alpha|^2|00\rangle\langle00| + |\beta|^2|11\rangle\langle11|,

destroying the coherence between the two logical branches. Recovering the logical ZZ statistics is therefore weaker than the exact-record criterion established here. In operator-algebra quantum error correction, local representatives of encoded observables, including central elements of recoverable algebras, are studied at the level of a code subspace [28, 29, 30]. Our test instead asks whether the actual state is invariant under an unread local projective measurement. The two notions should not be identified merely because the same classical outcome can be obtained locally. This is consistent with the no-broadcasting theorem: the logical ZZ label is classical, whereas an arbitrary quantum superposition is not redundantly readable without disturbing its coherence [32, 34].

The theorem identifies which nonconstant classical labels are already locally readable by all observers. It does not require the entire quantum state, or even a complete pointer basis of a designated subsystem, to be shared. To compare this general shared-record criterion with frameworks based on a designated system pointer, Sec. III fixes such a pointer and examines its relation to quantum Darwinism and spectrum broadcast structure.

Shared facts and quantum objectivity

For comparison with quantum Darwinism, fix one finite-dimensional state ρSF1⋯Fm\rho_{SF_1\cdots F_m}, a designated system SS, and m≥2m \ge2 disjoint environmental fragments FaF_a. Abbreviate the collection of fragments as F=F1⋯FmF = F_1\cdots F_m. For our shared-record test, SS and each FaF_a count as separate observers, so V={S,F1,…,Fm}V = \{S,F_1,\ldots,F_m\}. All exact criteria below refer to the same full state and this fixed partition. Write H(A)H(A) for von Neumann entropy and I(A:B)=H(A)+H(B)−H(AB)I(A:B) = H(A) + H(B) - H(AB) for quantum mutual information. For a transparent fixed-partition comparison, we use the idealized exact equality below as the QD criterion for every displayed fragment. This is not the same as testing an approximate or fragment-size-averaged mutual-information plateau in a dynamical model. Conventional quantum Darwinism (QD) is represented here by

QD:I(S:Fa)=H(S)(∀a).(7)\mathrm{QD}: \qquad I(S:F_a) = H(S) \qquad(\forall a). \tag*{(7)}

To compare complete-pointer records, fix a rank-one orthonormal basis X={∣x⟩S}xX = \{|x\rangle_S\}_x of SS and restrict the state families to states whose ρS\rho_S is diagonal in this basis. Thus XX is an eigenbasis of ρS\rho_S (including any degenerate eigenspaces), px=⟨x∣ρS∣x⟩p_x = \langle x|\rho_S|x\rangle, and only labels with px>0p_x > 0 need be distinguished. We consider states with at least two occupied pointer labels (H(S)>0H(S)>0), consistently with the nontrivial-record convention of Sec. II. These assumptions are important when translating entropic criteria into an exact state form and comparing the state families below. Strong quantum Darwinism (SQD) requires all the correlation to be accessible as classical information about this complete pointer:

SQDX:I(S:Fa)=Iacc(S:Fa)=χ(X:Fa)=H(S)(∀a).(8)\mathrm{SQD}_{X}: \quad I(S:F_a)=I_{\mathrm{acc}}(S:F_a) =\chi(X:F_a)=H(S)\qquad(\forall a). \tag*{(8)}

Here Iacc(S:Fa)I_{\mathrm{acc}}(S:F_a) maximizes the classical mutual information over local measurements on SS and FaF_a. The Holevo quantity is χ(X:Fa)=H(ρFa)−∑x:px>0pxH(τx(a))\chi(X:F_a)=H(\rho_{F_a})-\sum_{x:p_x>0}p_xH(\tau_x^{(a)}), with τx(a)=px−1⟨x∣ρSFa∣x⟩S\tau_x^{(a)}=p_x^{-1}\langle x|\rho_{SF_a}|x\rangle_S the conditional fragment state [35]. We use H(X)=−∑x:px>0pxlog⁡2pxH(X)=-\sum_{x:p_x>0}p_x\log_2p_x for the Shannon entropy of the pointer outcomes. By the diagonal-pointer assumption, H(X)=H(S)H(X)=H(S). Under this assumption, ideal SQD is equivalent to the pairwise state form

ρSFa=∑xpx∣x⟩⟨x∣S⊗τx(a),(9)\rho_{SF_a}=\sum_xp_x|x\rangle\langle x|_S\otimes\tau_x^{(a)}, \tag*{(9)}
τx(a)τy(a)=0(x≠y, pxpy>0).\tau_x^{(a)}\tau_y^{(a)}=0\qquad(x\ne y,\ p_xp_y>0).

Thus each pairwise S:FaS:F_a state records the full pointer, but none of these marginals by itself tests whether the complete SFSF state retains coherence between distinct pointer branches [20, 21]. Classical accessibility in each pairwise marginal and nondisturbance of the global state are therefore separate requirements. The equivalence between the entropic and state-based forms is derived in Appendix C.

Spectrum broadcast structure (SBS) further requires independence of the fragments conditioned on the pointer value:

ρSFSBS=∑xpx∣x⟩⟨x∣S⊗⨂a=1mτx(a),(10)\rho_{SF}^{\mathrm{SBS}}=\sum_xp_x|x\rangle\langle x|_S\otimes\bigotimes_{a=1}^{m}\tau_x^{(a)}, \tag*{(10)}
τx(a)τy(a)=0(x≠y, pxpy>0).\tau_x^{(a)}\tau_y^{(a)}=0\qquad(x\ne y,\ p_xp_y>0).

The standard SQD–SBS relation is therefore an implication from conditional product structure to locally accessible information [20, 25, 26].

For this fixed partition and complete pointer XX, let RXR_X denote the class of states for which the prescribed rank-one projective measurement {∣x⟩⟨x∣S}x\{|x\rangle\langle x|_S\}_x and matching, calibrated projective readouts on every fragment FaF_a satisfy both conditions of Eq. (2) on the full state. Thus RXR_X requires nondisturbing access to every occupied value of the specified complete system pointer. By contrast, RR requires only some nonconstant exact shared event, which may be a coarser observable of SS and need not correspond to the chosen pointer XX. The definition of RR does not single out a designated system. Equivalently, it only requires a nontrivial spectrum sharing structure by Theorem 1. Consequently, RX⊆RR_X\subseteq R on this fixed observer partition, but a state in RR need not belong to RXR_X. All comparisons between SQDX\mathrm{SQD}_X, RXR_X, and SBSX\mathrm{SBS}_X use this fixed pointer and the diagonal-pointer state family.

Proposition 1 (Exact pointer-record overlap). For this nontrivial complete rank-one pointer XX and fixed fragments,

RX=SQDX∩NDX(11)R_X=\mathrm{SQD}_X\cap N\mathrm{D}_X \tag*{(11)}

where NDXN\mathrm{D}_X means [∣x⟩⟨x∣S⊗IF,ρ]=0[|x\rangle\langle x|_S\otimes I_F,\rho]=0 for each occupied xx. Equivalently, the global state has the form

ρSF=∑xpx∣x⟩⟨x∣S⊗τx,\rho_{SF}=\sum_xp_x|x\rangle\langle x|_S\otimes\tau_x,
supp⁡τx⊆⨂aHFa,x,(12)\operatorname{supp}\tau_x\subseteq\bigotimes_a\mathcal{H}_{F_a,x}, \tag*{(12)}
HFa,x⊥HFa,y(x≠y, pxpy>0).\mathcal{H}_{F_a,x}\perp\mathcal{H}_{F_a,y}\qquad(x\ne y,\ p_xp_y>0).

No factorization of τx\tau_x is required. Within this family SBS holds precisely when τx=⨂aτx(a)\tau_x=\bigotimes_a\tau_x^{(a)} for each occupied label.

The proposition (proved in Appendix C) separates local readability from global nondisturbance: SQDX\mathrm{SQD}_X certifies the former in the S:FaS:F_a marginals, while NDXN\mathrm{D}_X excludes coherence between pointer sectors in the full tested state. Earlier identifications of SQD with pointer objectivity [20] are thus not being contradicted: the present criterion explicitly tests a stronger, full-state outcome-forgotten readout on a specified multipartite partition. For instance, a coherent GHZ state has the ideal SQD pairwise marginals, although reading any one pointer record dephases the complete pure state (Example C in Appendix D). The fixed-pointer hierarchy is therefore

SBSX⊆RX⊆SQDX⊆QD.(13)\mathrm{SBS}_X\subseteq R_X\subseteq\mathrm{SQD}_X\subseteq\mathrm{QD}. \tag*{(13)}

The general shared-event class RR is broader than RXR_X and has no general inclusion relation with QD or SQD.

The strict distinction between RXR_X and SBS is already visible in a simple example. Let Fa=LaKaF_a=L_aK_a, where each LaL_a holds an orthogonal copy of a pointer bit, and let the two KK registers share ∣ϕθ⟩=cos⁡θ∣00⟩+sin⁡θ∣11⟩|\phi_\theta\rangle=\cos\theta|00\rangle+\sin\theta|11\rangle. The state

ρD(θ)=12∑x=01∣x⟩⟨x∣S⊗∣xx⟩⟨xx∣L1L2⊗∣ϕθ⟩⟨ϕθ∣K1K2\rho_D(\theta)=\frac{1}{2}\sum_{x=0}^{1}|x\rangle\langle x|_S\otimes|xx\rangle\langle xx|_{L_1L_2} \otimes|\phi_\theta\rangle\langle\phi_\theta|_{K_1K_2}

has perfectly readable, nondisturbing pointer copies in L1L_1 and L2L_2. Yet for 0<θ≤π/40<\theta\le\pi/4, the conditional K1K2K_1K_2 state is entangled, so the fragments are not conditionally independent and the state is not SBS. The explicit verification is in Example D of Appendix D. Figure 1 summarizes the full hierarchy and its other witnesses.

Figure 1. Fixed-partition hierarchy and its generalization. The outer Euler sets compare exact shared facts R with QD and SQDX_X. Distinct boundary styles also distinguish the sets in grayscale reproduction. The nested sets distinguish SBSX⊊_X \subsetneq RX⊊_X \subsetneq SQDX_X. Here A denotes an incomplete shared label, B two Bell pairs, C a coherent GHZ state, D an exact pointer record with conditional entanglement, and E a shared tag accompanying two Bell pairs. The state families are compared for a common observer partition and, when specified, the same complete pointer XX. The diagram does not represent a random-partition consensus probability.

Examples A–E in Figure 1 show how the boundaries differ. A and B separate general shared records from QD in both directions. C satisfies SQD but fails global nondisturbance. D is an exact pointer record that is not SBS. E belongs to R∩QDR\cap\mathrm{QD} but not SQD.

Conditional correlations explain the gap between RXR_X and SBS. For the conditional states τx\tau_x in Eq. (12), define

J(F1:⋯:Fm∣S)=∑xpx[∑aH(τx(a))−H(τx)]=∑xpxD(τx∥⨂aτx(a))≥0.(14)\begin{aligned} J(F_1:\cdots:F_m|S)=\sum_xp_x\left[\sum_aH(\tau_x^{(a)})-H(\tau_x)\right] \\ &=\sum_xp_xD\left(\tau_x\middle\|\bigotimes_a\tau_x^{(a)}\right)\ge0. \tag*{(14)} \end{aligned}

where D(α∥β)=Tr⁡[α(log⁡2α−log⁡2β)]D(\alpha\Vert\beta)=\operatorname{Tr}[\alpha(\log_{2}\alpha-\log_{2}\beta)] is quantum relative entropy, with the usual support convention. Within RX_X, J=0J=0 if and only if the state is SBS. Otherwise, conditional correlations, including entanglement, may remain despite exact local access to the pointer.

These comparisons depend on the tested state and the chosen observer partition. For fixed disjoint laboratories, a record shared by all members of a group is also shared by any subgroup with at least two observers. Adding observers can only restrict the set of shared records. We assume local projective readouts and nondisturbance of the full state, rather than arbitrary decoding instruments. Randomly sampled fragment partitions are considered separately in Sec. IV C.

From exact shared facts to robust records

Exactness and rank-changing noise

Suppose the shared classical bit in Eq. (1) is contaminated by a small amount of completely random two-qubit noise:

ρη=(1−η)ρcl+ηI4/4,0≤η≤1.(15)\rho_{\eta}=(1-\eta)\rho_{\mathrm{cl}}+\eta I_{4}/4,\qquad0\leq\eta\leq1. \tag*{(15)}

Here η\eta is the noise strength. With probability 1−η1-\eta we prepare the perfectly matched bit, while with probability η\eta we prepare a uniformly random two-bit string. The probability of disagreement is therefore η/2\eta/2. Both observers can still read in the computational basis without disturbing the state, because it is diagonal in that basis.

Yet the exact-record property changes abruptly. At η=0\eta=0, the two observers share one exact bit. For every η>0\eta>0, even if extremely small, ρη\rho_{\eta} has nonzero weight on all four computational-basis strings. In particular, mismatched outcomes are now possible, so no nontrivial exact shared fact remains. A more general statement follows.

Corollary 1 (No nontrivial exact shared fact at full rank). If a multipartite state has full rank on the tensor product of two or more disjoint observer subsystems, then it admits no nontrivial exact shared record for that observer partition.

The reason is elementary. At full rank, every pair of nonzero local projectors on distinct laboratories has strictly positive joint probability. If two different shared labels both occur, some pair of mismatched outcomes must then have positive probability, contradicting Eq. (2). A proof is given in Appendix A. When the support is smaller, several different local projectors may agree on the part of Hilbert space that is actually occupied.

It would be misleading to conclude that a tiny η\eta suddenly erases a macroscopic memory. A detector with a one-in-a-million disagreement probability is nearly as useful as a perfect detector, despite failing an exact all-or-nothing test. To describe real records, we therefore keep the proposed local measurements fixed and quantify their imperfections.

Operational errors and distance to ideal records

Let each observer attempt to read the same finite label xx using projectors {Px(a)}x∈X\{P_{x}^{(a)}\}_{x\in X}. We do not assume that these measurements are nondisturbing or that they agree. Two directly interpretable errors are enough for our bound.

First, imagine that all observers make their measurements and then throw away the recorded outcomes. The resulting state is

Δ(ρ)=∑xΠxρΠx,Πx=⨂a=1mPxa(a).(16)\Delta(\rho)=\sum_{x}\Pi_{x}\rho\Pi_{x},\qquad\Pi_{x}=\bigotimes_{a=1}^{m}P_{x_{a}}^{(a)}. \tag*{(16)}

The tuple x=(x1,…,xm)x=(x_{1},\ldots,x_{m}) lists the outcomes in all laboratories. The map Δ\Delta removes coherence between alternatives distinguished by the complete set of local measurements. We quantify its disturbance by δ=∥ρ−Δ(ρ)∥1\delta=\lVert\rho-\Delta(\rho)\rVert_{1}.

Second, let Qx=⨂aPx(a)Q_{x}=\bigotimes_{a}P_{x}^{(a)} project onto the event that every observer reports the same particular value xx, and let Q=∑xQxQ=\sum_{x}Q_{x} collect all such events. The disagreement probability is ϵ=1−Tr⁡(Qρ)\epsilon=1-\operatorname{Tr}(Q\rho). In summary,

δ=∥ρ−Δ(ρ)∥1,ϵ=1−Tr⁡(Qρ).(17)\delta=\lVert\rho-\Delta(\rho)\rVert_{1},\qquad\epsilon=1-\operatorname{Tr}(Q\rho). \tag*{(17)}

For a Hermitian operator, ∥⋅∥1\lVert\cdot\rVert_{1} means the sum of the absolute values of its eigenvalues. We use the unhalved trace norm throughout. The conventional trace distance between density operators is often defined with an extra factor 1/21/2. Thus δ=0\delta= 0 means no disturbance, and ϵ=0\epsilon= 0 means perfect agreement. The noisy shared bit has δ=0\delta= 0 and ϵ=η/2\epsilon= \eta/2.

What do small values of these errors guarantee? Define SQ\mathcal{S}_{Q} as the family of ideal states that give only matching local outcomes and have no coherence between different values of the shared label:

SQ={σ≥0:Tr⁡σ=1,σ=∑xQxσQx}.(18)\mathcal{S}_{Q}=\left\{\sigma\ge0:\operatorname{Tr}\sigma=1,\quad\sigma=\sum_{x}Q_{x}\sigma Q_{x}\right\}. \tag*{(18)}

For this specified choice of local measurements, the quantity

dQ(ρ)=inf⁡σ∈SQ∥ρ−σ∥1(19)d_{Q}(\rho)=\inf_{\sigma\in\mathcal{S}_{Q}}\lVert\rho-\sigma\rVert_{1} \tag*{(19)}

is the distance to the nearest ideal shared-record state. It asks how much the physical state would need to change before the proposed records became perfect. The optimization does not alter which measurements the observers are allowed to perform.

Theorem 2 (Accuracy of a fixed shared readout). For any family of local projective measurements with ϵ<1\epsilon< 1, the distance to the ideal shared-record states satisfies

max⁡{δ/2,2ϵ}≤dQ(ρ)≤δ+2ϵ.(20)\max\{\delta/2,2\epsilon\}\le d_{Q}(\rho)\le\delta+2\epsilon. \tag*{(20)}

In particular, both errors vanish exactly if and only if ρ∈SQ\rho\in\mathcal{S}_{Q}.

This bound has a useful reading without the proof. If the unread measurement strongly changes the state, or if the observers frequently disagree, the state cannot be close to a perfect shared record. This is the lower bound. Conversely, when both effects are small, there is an ideal state nearby that makes the same local projectors into a perfect, nondisturbing record. This is the upper bound.

The upper estimate can be understood as a two-step repair procedure. First perform the unread local measurement, producing Δ(ρ)\Delta(\rho). This costs at most δ\delta in trace norm. Then keep only the subspace in which all observers agree and normalize the remaining state. Because the first step has already removed coherence between different outcome strings, this second correction costs exactly 2ϵ2\epsilon, not a term proportional to ϵ\sqrt{\epsilon}. Appendix B gives the proof and explains why the coefficient cannot be improved in general.

This result has a different target from earlier geometric bounds on proximity to spectrum broadcast structure, which use pointer dephasing and distinguishability of conditional environmental states [20, 36]. The ideal set SQ\mathcal{S}_{Q} here fixes the observers’ proposed projectors but does not require conditional independence of the fragments. Moreover, Eq. (20) supplies both a lower and an upper estimate using directly interpretable errors of that same readout. It therefore quantifies nondisturbing agreement rather than proximity to the more restrictive SBS family.

For the noisy bit in Eq. (15), the bound is particularly transparent:

δ=0,ϵ=η/2,dQ(ρη)=η.(21)\delta=0,\qquad\epsilon=\eta/2,\qquad d_{Q}(\rho_{\eta})=\eta. \tag*{(21)}

The distance from a perfect shared record goes smoothly to zero as the noise vanishes, even though no exact shared fact remains for any positive η\eta.

The errors are also stable if the prepared state changes slightly while the detector settings remain fixed. If two states are separated by an unhalved trace-norm distance ss, their disagreement parameters differ by at most 2s2s and their disagreement probabilities by at most s/2s/2. Thus the easily evaluated expression δ+2ϵ\delta+2\epsilon changes by no more than 3s3s. The estimates follow directly from the fact that quantum measurements cannot increase trace distance. Details are in Appendix B. We are not claiming that the identity of an optimal detector remains unchanged when it is reoptimized after each perturbation.

Accessible information and observer consensus

The fixed-pointer inclusion in Eq. (13) concerns exact states for one partition. The errors above also give one-sided statements for approximate records. Suppose the specified local measurements include a complete rank-one pointer XX on SS. Let YaY_a be the calibrated outcome at fragment FaF_a and ea=Pr⁡(Ya≠X)≤ϵe_a=\Pr(Y_a\ne X)\le\epsilon. Write h2(u)=−ulog⁡2u−(1−u)log⁡2(1−u)h_2(u)=-u\log_2u-(1-u)\log_2(1-u), with 0log⁡20=00\log_2 0=0, for binary entropy. For kk pointer labels, Fano’s inequality [37] yields

Iacc(S:Fa)≥I(X:Ya)≥H(X)−h2(ea)−ealog⁡2(k−1).(22)I_{\mathrm{acc}}(S:F_a)\ge I(X:Y_a) \ge H(X)-h_2(e_a)-e_a\log_2(k-1). \tag*{(22)}

If ρS\rho_S is diagonal in XX, then H(X)=H(S)H(X)=H(S). For ϵ≤1−1/k\epsilon\le1-1/k, eae_a may be replaced by ϵ\epsilon in the lower bound. The qualification about the full pointer matters: an incomplete tag as in Eq. (50) of Appendix D is not enough to certify SQD of the entire system.

There is also a geometric implication. Let SQDX\mathrm{SQD}_{X} denote the global states for which every S:FaS:F_a marginal has the ideal form of Eq. (9). Every ideal complete-pointer record belongs to this family, so Theorem 2 gives

inf⁡ω∈SQDX∥ρ−ω∥1≤dQ(ρ)≤δ+2ϵ.(23)\inf_{\omega\in\mathrm{SQD}_{X}}\lVert\rho-\omega\rVert_{1}\le d_{Q}(\rho)\le\delta+2\epsilon. \tag*{(23)}

The converse fails for the coherent GHZ state ρC\rho_C of Appendix D: its SQD marginals are ideal, but the unread ZZ measurement gives δ=1\delta=1, ϵ=0\epsilon=0, and dQ(ρC)=1d_{Q}(\rho_C)=1. Conversely, dQ(ρD(θ))=0d_{Q}(\rho_D(\theta))=0 in that appendix even when the fragments are conditionally entangled, so exact sharing does not require SBS.

The question then shifts from which event is shared for a fixed cover to how often different covers reveal it. Following the distinction between redundancy (existence of a suitable partition) and consensus (success under a distribution of partitions) [38, 39], let Pm\mathfrak{P}_m be a family of partitions of the environment into mm disjoint equally sized fragments, sampled from a probability distribution μm\mu_m. For an allowed accessible-information deficit ζ≥0\zeta\ge0, define the success probability

Pacc(ρ,m,ζ)=Pr⁡π∼μm[∀a, Iacc(S:Faπ)≥H(S)−ζ].(24)P_{\mathrm{acc}}(\rho,m,\zeta)=\Pr_{\pi\sim\mu_m}\left[\forall a,\ I_{\mathrm{acc}}(S:F_a^\pi)\ge H(S)-\zeta\right]. \tag*{(24)}

For the same complete pointer and tested full state, fix a nonnegative error tolerance tt and require local readouts to satisfy δπ+2ϵπ≤t\delta_\pi+2\epsilon_\pi\le t. Define

Prec(ρ,m,t)=Pr⁡π∼μm[∃ local readouts: δπ+2ϵπ≤t].(25)P_{\mathrm{rec}}(\rho,m,t)=\Pr_{\pi\sim\mu_m}\left[\exists\ \text{local readouts}:\ \delta_\pi+2\epsilon_\pi\le t\right]. \tag*{(25)}

Readouts may be optimized separately for each partition, but the pointer, full state, and sampling distribution remain fixed.

Proposition 2 (Shared-record success bounds accessible-information consensus). Let XX be a complete rank-one eigenbasis of ρS\rho_S with k≥2k\ge2 labels, and let 0≤t≤2(1−1/k)0\le t\le2(1-1/k). With

fk(u)=h2(u)+ulog⁡2(k−1),(26)f_k(u)=h_2(u)+u\log_2(k-1), \tag*{(26)}

any distribution over the partitions satisfies

Prec(ρ,m,t)≤Pacc(ρ,m,fk(t/2)).(27)P_{\mathrm{rec}}(\rho,m,t)\le P_{\mathrm{acc}}(\rho,m,f_k(t/2)). \tag*{(27)}

The same one-way implication holds for the largest successful partition size and for any prescribed probability threshold.

The proof in Appendix C applies the Fano bound to each successful partition before averaging over μm\mu_m. It uses no conditional independence. The reverse implication is false: the GHZ state ρC\rho_C of Appendix D has full accessible pointer information on its natural partition, yet an unread measurement disturbs its global coherence. This is why a fixed-partition hierarchy must not be confused with a random-partition consensus score. A partition engineered to expose the available records may be rare under a different sampling distribution [38, 39].

Finally, the number of possible shared labels is not the same as the information usually carried by them. If the finest shared-sector decomposition contains nn occupied labels, a uniformly distributed sector label carries log⁡2n\log_2 n bits of Shannon information. The actual average information is the Shannon entropy H(X)=−∑xpxlog⁡2pxH(X)=-\sum_x p_x\log_2 p_x. A record with many possible outcomes may carry little information if one outcome occurs almost every time. For imperfect readouts it is therefore useful to report the outcome probabilities together with δ\delta and ϵ\epsilon [40, 41].

Discussion and outlook

The state-level results obtained here have three complementary parts. Theorem 1 gives a unique finest locally readable record-sector structure without prescribing a pointer. Proposition 1 locates complete-pointer sharing relative to SQD and SBS by adding a full-state nondisturbance condition. Theorem 2 bounds approximate sharing through disturbance and disagreement. These conclusions neither require conditional fragment independence nor identify accessible information with nondisturbing readout. In particular, the loss of exact sharing under full-rank noise need not imply an abrupt loss of practical reliability, and Proposition 2 relates reliable records to consensus only in one direction.

These statements concern the properties of a state at a given time, not the interaction that prepared it. In the usual decoherence and quantum Darwinism picture, a system pointer becomes correlated with the environment [4, 6, 8, 42], schematically as

∣Ψ⟩=∑xcx∣x⟩S∣Ex⟩.(28)|\Psi\rangle=\sum_x c_x|x\rangle_S|E_x\rangle. \tag*{(28)}

Tracing out inaccessible degrees of freedom may suppress interference between pointer values, but this does not by itself ensure that the fragments available to separate observers can distinguish those values. Suppression of pointer coherence and local readability are distinct requirements [43, 44, 45].

A useful bridge from this physical picture to approximate records can be stated without specifying a dynamical model. Let ρSF\rho_{SF} be the state of the system and its accessible fragments, and define the system-pointer dephasing map by

ΔS(ρ)=∑xΠx(S)ρΠx(S),Πx(S)=∣x⟩⟨x∣S⊗IF.\Delta_S(\rho)=\sum_x\Pi_x^{(S)}\rho\Pi_x^{(S)},\qquad\Pi_x^{(S)}=|x\rangle\langle x|_S\otimes\mathbb{I}_F.

The residual pointer coherence is

Dcoh=∥ρSF−ΔS(ρSF)∥1.(29)D_{\mathrm{coh}}=\lVert\rho_{SF}-\Delta_S(\rho_{SF})\rVert_1. \tag*{(29)}

For orthogonal fragment readout projectors {Px(a)}x\{P_x^{(a)}\}_x, set Qx=∣x⟩⟨x∣S⊗⨂aPx(a)Q_x=|x\rangle\langle x|_S\otimes\bigotimes_aP_x^{(a)} and Q=∑xQxQ=\sum_xQ_x. The probability that at least one fragment fails to identify the pointer after dephasing is r=1−Tr⁡[QΔS(ρSF)]r=1-\operatorname{Tr}[Q\Delta_S(\rho_{SF})]. If r<1r<1, then σ=QΔS(ρSF)Q/(1−r)\sigma=Q\Delta_S(\rho_{SF})Q/(1-r) is an ideal shared-record state for these readouts, and

∥ρSF−σ∥1≤Dcoh+2r+r.(30)\lVert\rho_{SF}-\sigma\rVert_1\le D_{\mathrm{coh}}+2\sqrt{r}+r. \tag*{(30)}

Thus small residual pointer coherence and small fragment-identification error suffice to place the state close to an ideal shared record, without requiring conditional independence. The square-root term accounts for the possible disturbance caused by projecting the fragments onto the matching-outcome subspace. A proof is given in Appendix B.

If pxp_x denotes the pointer probabilities and ρx(a)\rho_x^{(a)} the conditional state of fragment aa, the mean local identification error is

ra=∑xpxTr⁡[(I−Px(a))ρx(a)].r_a=\sum_xp_x\operatorname{Tr}\left[(\mathbb{I}-P_x^{(a)})\rho_x^{(a)}\right].

The union bound gives

r≤∑ara,(31)r \le\sum_a r_a, \tag*{(31)}

regardless of correlations or entanglement between fragments. This estimate and Eq. (30) complement, rather than replace, the fixed-readout bound in Eq. (20): the former uses pointer coherence and fragment-identification errors, whereas the latter uses the disturbance δ\delta of the complete local readout and its disagreement probability ϵ\epsilon. These are state-level sufficient conditions, not equations governing the time evolution of records.

Neither bound determines how quickly records form. In particular, decoherence of the system pointer alone need not make information accessible to individual fragments [43, 44, 46, 47, 48]. In environments with memory, the quality of a record can vary with time [49, 50, 51, 52]. For fixed detectors, δ(t)\delta(t) and ϵ(t)\epsilon(t) can track such changes, but nondisturbance at one instant does not establish nondisturbance in a multitime experiment [53, 54].

A natural direction for future work is therefore a dynamical theory of shared-record formation under specified system–environment interactions [36, 55, 56, 57, 58, 59]. Such a study could track Dcoh(t)D_{\mathrm{coh}}(t), r(t)r(t), δ(t)\delta(t), and ϵ(t)\epsilon(t) for physically motivated fragment partitions, determine when local readability develops relative to decoherence, and investigate record-formation rates, persistence, and memory-dependent effects. These are questions about the production and temporal stability of records, distinct from the state-level existence and robustness criteria established here. The present results provide a quantitative benchmark for addressing them.

Acknowledgments

AI-assisted scientific reasoning, literature organization and drafting were used in preparing this manuscript with OpenAI GPT-6. The author is responsible for all the contents.

Proof of the shared-sector structure

Proof of the spectrum sharing characterization

Let the local projective measurements satisfy Eq. (2). Since [Πx(a),ρ]=0[\Pi_x^{(a)},\rho]=0, sequential unread measurements in the different laboratories leave ρ\rho unchanged. Their projectors commute because the laboratories are disjoint, so the resulting state is

ρ=∑x1,…,xm(⨂aPxa(a))ρ(⨂aPxa(a)).(32)\rho=\sum_{x_1,\ldots,x_m}\left(\bigotimes_a P_{x_a}^{(a)}\right)\rho\left(\bigotimes_a P_{x_a}^{(a)}\right). \tag*{(32)}

If the outcome string has two unequal entries, its projector is bounded by the product of the corresponding two local projectors. The probability of that string therefore vanishes by the second condition of Eq. (2). A positive density matrix with zero probability on a projector has no support on that projector. Only the strings (x,…,x)(x,\ldots,x) remain, which gives the block decomposition in Eq. (4).

For each occupied label xx, put

px=Tr⁡(ρQx),ρx=QxρQxpx,Ha,x=ran⁡Px(a).(33)p_x=\operatorname{Tr}(\rho Q_x),\qquad\rho_x=\frac{Q_x\rho Q_x}{p_x},\qquad\mathcal{H}_{a,x}=\operatorname{ran}P_x^{(a)}. \tag*{(33)}

The Ha,x\mathcal{H}_{a,x} are orthogonal as xx varies, and supp⁡ρx⊆⨂aHa,x\operatorname{supp}\rho_x\subseteq\bigotimes_a\mathcal{H}_{a,x}. This establishes the nontrivial spectrum sharing structure whenever the original record is nontrivial.

Conversely, suppose ρ\rho has a nontrivial decomposition satisfying both Eqs. (4) and (5). Let Ra,xR_{a,x} be the orthogonal projector onto Ha,x\mathcal{H}_{a,x}. Because these subspaces are pairwise orthogonal, Ra,⊥=Ia−∑xRa,xR_{a,\perp}=\mathbb{I}_a-\sum_xR_{a,x} is also a projector. Fix one label x0x_0 and define a complete local readout by

Px(a)={Ra,x+Ra,⊥,x=x0,Ra,x,x≠x0.(34)P_x^{(a)}= \begin{cases} R_{a,x}+R_{a,\perp}, & x=x_0,\\ R_{a,x}, & x\ne x_0. \end{cases} \tag*{(34)}

The arbitrary assignment of unused local subspaces cannot affect any outcome on the support of ρ\rho. For all x,yx,y,

Πx(a)ρy=ρyΠx(a)=δxyρy.(35)\Pi_x^{(a)}\rho_y=\rho_y\Pi_x^{(a)}=\delta_{xy}\rho_y. \tag*{(35)}

It follows that every local measurement commutes with the full ρ\rho and that all observers obtain the same label with certainty. Because at least two pxp_x are positive, the resulting record is nontrivial. This completes the proof of the principal equivalence without using operator algebras.

Uniqueness of the finest shared-sector decomposition

We now prove the uniqueness claim without introducing an operator algebra. Let PP project onto supp⁡ρ\operatorname{supp}\rho. Any local projector Πx(a)\Pi_x^{(a)} of an exact shared readout commutes with ρ\rho and therefore with PP. By the first part of the proof, the occupied part of the state lies entirely in the matching-outcome subspaces Qx=∏aΠx(a)Q_x=\prod_a\Pi_x^{(a)}. Hence

Πx(a)P=QxP≡Exfor every observer a.(36)\Pi_x^{(a)}P=Q_xP\equiv E_x\qquad\text{for every observer }a. \tag*{(36)}

Thus every observer implements the same projector ExE_x on the occupied state space, even if their physical projectors differ on subspaces that are never occupied. The ExE_x are orthogonal projections summing to PP.

Consider two possibly different exact shared readouts, with projectors ExE_x and FyF_y on the support. Choose different observers aa and bb. According to Eq. (36), ExE_x can be represented on the support by a local projector in laboratory aa, and FyF_y by one in laboratory bb. Local projectors acting on disjoint tensor factors commute. Since both commute with PP, we get

ExFy=FyEx.(37)E_xF_y=F_yE_x. \tag*{(37)}

This argument applies to every pair of projectors belonging to any exact shared readouts, not just to projectors from a single measurement.

A family of commuting Hermitian projectors on a finite-dimensional space has a common orthogonal eigenspace decomposition. Let {Eλ}\{E_\lambda\} be its nonzero joint-eigenspace projectors on PH\mathcal{P}\mathcal{H}. These subspaces are uniquely determined by the outcomes of all exact shared readouts. There are at most dim⁡(PH)\dim(\mathcal{P}\mathcal{H}) nonzero subspaces. Consequently a finite list of shared projectors, call it E1,…,ENE_1,\ldots,E_N, suffices to distinguish all the joint eigenspaces. Each EλE_\lambda is the projector onto one definite binary pattern of eigenvalues of this finite list.

It remains to show that this common refinement can itself be read locally. For each jj, select a local projector Πj(a)\Pi_j^{(a)} in each laboratory whose restriction to PH\mathcal{P}\mathcal{H} is EjE_j, as in Eq. (36). Define the Hermitian local observable

Ba=∑j=1N2j−1Pj(a),Πj(a)=Pj(a)⊗I‾a.(38)B_a=\sum_{j=1}^{N}2^{j-1}P_j^{(a)}, \qquad\Pi_j^{(a)}=P_j^{(a)}\otimes\overline{\mathbb{I}}_a. \tag*{(38)}

Each Ba⊗I‾aB_a\otimes\overline{\mathbb{I}}_a commutes with ρ\rho because every summand does. On PH\mathcal{P}\mathcal{H} its eigenvalue is the binary code of the joint eigenvalues of E1,…,ENE_1,\ldots,E_N. Different occupied sectors have different codes, and the code is identical for all observers. Measuring the spectral projectors of BaB_a therefore identifies the same sector λ\lambda in every laboratory without disturbing ρ\rho. Any eigenvalues occurring only outside PH\mathcal{P}\mathcal{H} can be assigned to an arbitrary existing outcome. This produces a complete projective readout of the finest shared sectors.

Every projector of every other exact shared readout is a sum of some EλE_\lambda, by their construction as common joint eigenspaces. Thus all such records are coarse-grainings of this unique finest one, up to relabeling. Since all EλE_\lambda commute with ρ\rho, the sectors give Eq. (6).

Proof of the full-rank corollary

If ρ\rho is full rank, every nonzero positive projector TT has Tr⁡(ρT)>0\operatorname{Tr}(\rho T)>0. Suppose two different labels xx and yy both have nonzero probability in an exact shared readout. Choose any two distinct laboratories aa and bb. Then Px(a)P_x^{(a)} and Py(b)P_y^{(b)} are nonzero, so their product on the full Hilbert space is a nonzero projector. Consequently

Tr⁡(ρΠx(a)Πy(b))>0,x≠y,(39)\operatorname{Tr}\left(\rho\Pi_x^{(a)}\Pi_y^{(b)}\right)>0, \qquad x\ne y, \tag*{(39)}

contrary to the perfect-agreement requirement in Eq. (2). This proves Corollary 1.

Robustness and branching-state estimates

Fixed-readout bounds and stability

Let τ=Δ(ρ)\tau=\Delta(\rho) and write p=Tr⁡(Qτ)=1−ϵp=\operatorname{Tr}(Q\tau)=1-\epsilon. The equality of the probabilities follows because QQ is a sum of complete measurement blocks, so Δ\Delta does not change its expectation. Also [Q,τ]=0[Q,\tau]=0. If p>0p>0, define

σ∗=QτQp∈SQ.(40)\sigma_*=\frac{Q\tau Q}{p}\in\mathcal{S}_Q. \tag*{(40)}

The difference τ−σ∗\tau-\sigma_* is block diagonal with respect to QH⊕(I−Q)HQ\mathcal{H}\oplus(\mathbb{I}-Q)\mathcal{H}. On the first block it is negative and has trace −ϵ-\epsilon. On the second it is positive and has trace ϵ\epsilon. Thus ∥τ−σ∗∥1=2ϵ\lVert\tau-\sigma_*\rVert_1=2\epsilon. The triangle inequality gives

dQ(ρ)≤∥ρ−σ∗∥1≤δ+2ϵ.(41)d_Q(\rho)\le\lVert\rho-\sigma_*\rVert_1\le\delta+2\epsilon. \tag*{(41)}

This explains why the upper error is linear in ϵ\epsilon: the pinched state has no off-diagonal terms connecting the matching and mismatching outcomes. If we instead projected an arbitrary coherent state directly, a standard gentle-measurement estimate would yield a weaker square-root correction.

For the lower bound, take any σ∈SQ\sigma\in\mathcal{S}_Q. By definition Δ(σ)=σ\Delta(\sigma)=\sigma. Contractivity of the trace norm under the quantum channel Δ\Delta gives

δ≤∥ρ−σ∥1+∥Δ(ρ)−Δ(σ)∥1≤2∥ρ−σ∥1.(42)\delta\le\lVert\rho-\sigma\rVert_1+\lVert\Delta(\rho)-\Delta(\sigma)\rVert_1 \le2\lVert\rho-\sigma\rVert_1. \tag*{(42)}

Furthermore Tr⁡[(I−Q)σ]=0\operatorname{Tr}[(\mathbb{I}-Q)\sigma]=0. Using the variational characterization of the trace distance for this binary test gives 2ϵ≤∥ρ−σ∥12\epsilon\le\lVert\rho-\sigma\rVert_1. Taking the infimum over σ\sigma proves Eq. (20). The equivalence between δ=ϵ=0\delta=\epsilon=0 and ρ∈SQ\rho\in\mathcal{S}_Q follows directly from ρ=Δ(ρ)\rho=\Delta(\rho) and support on QHQ\mathcal{H}.

For the noisy-bit family, ρη\rho_\eta is diagonal in the local measurement basis, so δ=0\delta=0. The states 0101 and 1010 each occur with probability η/4\eta/4, giving ϵ=η/2\epsilon=\eta/2. The normalized matching-state projection in Eq. (40) has trace-norm distance η\eta from ρη\rho_\eta. The lower bound dQ≥2ϵ=ηd_Q\ge2\epsilon=\eta then proves dQ=ηd_Q=\eta. This also shows that the factor multiplying ϵ\epsilon in the general upper bound cannot be made smaller. At η=0\eta=0, the state has two finest shared labels. For every η>0\eta>0, no nontrivial shared label exists.

To see perturbative stability, suppose s=∥ρ−ρ′∥1s=\lVert\rho-\rho'\rVert_1 for two states tested with the same local projectors. Then

∣δ(ρ)−δ(ρ′)∣≤∥(ρ−ρ′)−Δ(ρ−ρ′)∥1≤2s,\left|\delta(\rho)-\delta(\rho')\right|\le\left\lVert(\rho-\rho')-\Delta(\rho-\rho')\right\rVert_1\le2s,
∣ϵ(ρ)−ϵ(ρ′)∣=∣Tr⁡[Q(ρ−ρ′)]∣≤s/2.(43)\left|\epsilon(\rho)-\epsilon(\rho')\right|=\left|\operatorname{Tr}[Q(\rho-\rho')]\right|\le s/2. \tag*{(43)}

The second inequality uses the fact that QQ is a projector and ρ−ρ′\rho-\rho' has trace zero. The combined upper-bound expression δ+2ϵ\delta+2\epsilon therefore changes by at most 3s3s.

Pointer dephasing and fragment-readout estimate

Let τ=ΔS(ρSF)\tau= \Delta S(\rho_{SF}) and let QQ be the projector onto identical pointer and fragment readouts. Because τ\tau is block diagonal in the pointer basis and QQ includes that basis, the normalized projected state σ=QτQ/(1−r)\sigma= Q\tau Q/(1-r) has no coherence between distinct shared pointer values. It therefore has the sector structure required of an ideal shared record.

The gentle measurement inequality [60] for the projector QQ gives ∥τ−QτQ∥1≤2r\lVert\tau-Q\tau Q\rVert_1 \le2\sqrt{r}. Normalizing the successful outcome changes its trace norm by exactly rr:

∥QτQ−QτQ1−r∥1=r.(44)\left\lVert Q\tau Q-\frac{Q\tau Q}{1-r}\right\rVert_1=r. \tag*{(44)}

Together with the definition Dcoh=∥ρSF−τ∥1D_{\mathrm{coh}}=\lVert\rho_{SF}-\tau\rVert_1, the triangle inequality yields Eq. (30).

For Eq. (31), condition on pointer value xx. If all observed fragments return the correct xx, then the joint matching projector succeeds. The event that this does not happen is the union of the individual failure events. Since the local projectors act on different fragments, their outcomes have an ordinary joint probability distribution, whether or not the fragment state factorizes. Summing the usual union bound over xx, weighted by pxp_x, gives r≤∑arar\le\sum_a r_a.

Fixed-pointer comparisons and consensus bounds

From the entropic SQD criterion to the pairwise form

We spell out why the diagonal-pointer hypothesis in Sec. III is needed. Let XX be a complete rank-one eigenbasis of ρS\rho_S and consider one fragment FaF_a. Dephasing SS in this basis gives ρ~SFa=∑xpx∣x⟩⟨x∣S⊗τx(a)\widetilde{\rho}_{SF_a}=\sum_x p_x|x\rangle\langle x|_S\otimes\tau_x^{(a)}. Its mutual information is precisely χ(X:Fa)\chi(X:F_a). As dephasing leaves both ρS\rho_S and ρFa\rho_{F_a} unchanged under the eigenbasis assumption,

I(S:Fa)−χ(X:Fa)=H(ρ~SFa)−H(ρSFa)≥0.I(S:F_a)-\chi(X:F_a)=H(\widetilde{\rho}_{SF_a})-H(\rho_{SF_a})\ge0.

The entropy increase under projective dephasing vanishes only when ρSFa=ρ~SFa\rho_{SF_a}=\widetilde{\rho}_{SF_a}. Moreover, χ(X:Fa)=H(X)\chi(X:F_a)=H(X) if and only if the occupied conditional fragment states τx(a)\tau_x^{(a)} have mutually orthogonal supports: a classical label can then be identified perfectly from that fragment. Since H(X)=H(S)H(X)=H(S) here, the equalities in Eq. (8) therefore imply Eq. (9). Conversely, that pairwise form makes the pointer perfectly readable and saturates all three equalities. Without a diagonal pointer marginal, the entropic equalities alone need not specify a complete readout of XX.

Pointer-overlap identity and conditional independence

Fix the complete rank-one pointer basis X={∣x⟩S}X=\{|x\rangle_S\} of Sec. III, with ρS\rho_S diagonal in XX, and retain only labels with px=Tr⁡(ρ∣x⟩⟨x∣S)>0p_x=\operatorname{Tr}(\rho|x\rangle\langle x|_S)>0. Suppose first that ρ\rho has the shared pointer record RXR_X. By nondisturbance of the local system pointer measurement, the complete state is block diagonal:

ρ=∑xpx∣x⟩⟨x∣S⊗τx.(45)\rho=\sum_x p_x|x\rangle\langle x|_S\otimes\tau_x. \tag*{(45)}

The fragment readout projectors Px(a)P_x^{(a)} identify xx with certainty, so the support of τx(a)=Tr⁡aˉτx\tau_x^{(a)}=\operatorname{Tr}_{\bar a}\tau_x lies in the range HFa,x\mathcal{H}_{F_a,x} of Px(a)P_x^{(a)}. The projectors have orthogonal ranges for different xx. Thus every ρSFa\rho_{SF_a} has the ideal form in Eq. (9), and hence is SQD with the common pointer XX. This proves RX⊆SQDX∩NDXR_X\subseteq\mathrm{SQD}_X\cap\mathrm{ND}_X.

Conversely, suppose ρ∈SQDX∩NDX\rho\in\mathrm{SQD}_X\cap\mathrm{ND}_X. Nondisturbance of the system pointer again gives Eq. (45). For each aa, SQD gives mutually orthogonal supports HFa,x=supp⁡τx(a)\mathcal{H}_{F_a,x}=\operatorname{supp}\tau_x^{(a)}. The positivity of τx\tau_x implies that it has no component outside the range of Px(a)P_x^{(a)} on fragment aa: indeed

Tr⁡[(I−Px(a))τx(a)]=0⟹(I−Px(a))τx=0.(46)\operatorname{Tr}\left[(\mathbb{I}-P_x^{(a)})\tau_x^{(a)}\right]=0 \quad\Longrightarrow\quad (\mathbb{I}-P_x^{(a)})\tau_x=0. \tag*{(46)}

(The implication follows because a positive operator has zero weight in a subspace only when its rows and columns vanish there.) As this holds for all aa, supp⁡τx⊆⨂aHFa,x\operatorname{supp}\tau_x\subseteq\bigotimes_a\mathcal{H}_{F_a,x}. Reading the indicated local support projectors then perfectly agrees with the system pointer and commutes with the entire state. Therefore ρ∈RX\rho\in R_X, proving Eq. (11) and the global form Eq. (12).

Within this class, conditional fragment independence is equivalent to τx=⨂aτx(a)\tau_x=\bigotimes_a\tau_x^{(a)} for all px>0p_x>0. The identity

D(τx∥⨂aτx(a))=∑aH(τx(a))−H(τx)(47)D\left(\tau_x\middle\Vert\bigotimes_a\tau_x^{(a)}\right) =\sum_a H(\tau_x^{(a)})-H(\tau_x) \tag*{(47)}

follows by expanding the logarithm of a tensor product. Positivity of relative entropy, with equality only for identical states, then establishes Eq. (14) and the equivalence of J=0J=0 with SBS within RXR_X. In particular, the proof makes no assumption of pairwise or higher-order independence before setting J=0J=0.

Derivation of the geometric and accessible-information bounds

Let the fixed readout include the complete rank-one system pointer XX, and let Qx=∣x⟩⟨x∣S⊗⨂aPx(a)Q_x=|x\rangle\langle x|_S\otimes\bigotimes_aP_x^{(a)}. Every state σ∈Q\sigma\in\mathcal{Q} satisfies σ=∑xQxσQx\sigma=\sum_xQ_x\sigma Q_x and is therefore of the form in Eq. (12). In particular, SQ⊆SQDX\mathcal{S}_{\mathcal{Q}}\subseteq\mathrm{SQD}_X, where the SQD family allows the choice of orthogonal fragment support spaces to vary. Taking the infimum over the larger family gives inf⁡ω∈SQDX∥ρ−ω∥1≤dQ(ρ)\inf_{\omega\in\mathrm{SQD}_{X}}\lVert\rho-\omega\rVert_{1}\le d_{Q}(\rho). The upper bound in Eq. (23) is Theorem 2.

For any local fragment measurement whose calibrated result YaY_a has error rate ea=Pr⁡(X≠Ya)e_a=\Pr(X\ne Y_a), introduce the binary indicator of the error event. Knowing YaY_a and this indicator leaves at most log⁡2(k−1)\log_{2}(k-1) further bits to identify an incorrectly reported value of XX. Therefore the elementary Fano argument yields

H(X∣Ya)≤h2(ea)+ealog⁡2(k−1).(48)H(X\mid Y_a)\le h_2(e_a)+e_a\log_2(k-1). \tag*{(48)}

Subtracting from H(X)H(X) gives the second inequality in Eq. (22). The first holds because the accessible mutual information maximizes over local measurements. Measuring XX on SS and the displayed YaY_a on its fragment is one allowed choice. Moreover, the event X≠YaX\ne Y_a is contained in the event that not all observers agree, so ea≤ϵe_a\le\epsilon.

If ρS\rho_S is diagonal in the rank-one pointer basis, H(X)=H(S)H(X)=H(S). The function fk(u)=h2(u)+ulog⁡2(k−1)f_k(u)=h_2(u)+u\log_2(k-1) is increasing on 0≤u≤1−1/k0\le u\le1-1/k. If δπ+2ϵπ≤t\delta_\pi+2\epsilon_\pi\le t for any set of candidate local readouts on a partition π\pi, then ea≤ϵπ≤t/2e_a\le\epsilon_\pi\le t/2, and therefore

Iacc(S:Faπ)≥H(S)−fk(t/2)for every a.(49)I_{\mathrm{acc}}(S:F_a^\pi)\ge H(S)-f_k(t/2)\quad\text{for every }a. \tag*{(49)}

Thus, for each partition separately, shared-record success implies accessible-information success with the indicated threshold. Taking probabilities over any μm\mu_m gives Eq. (27). Taking maximum partition sizes gives the corresponding redundancy implication. The reverse is false because controlling the measured information does not control the global coherence removed by unread measurements, as the GHZ example shows.

Counterexamples for the fixed-pointer hierarchy

The five examples below realize the regions marked A–E in Figure 1. Unless otherwise stated, the tested partition consists of the designated system SS and two disjoint fragments F1,F2F_1,F_2.

a.a. A: A shared event need not encode all of SS. Let S=LQS=LQ contain a label qubit LL and an independent maximally mixed qubit QQ. With two label fragments, consider

ρA=12∑x=01∣x⟩⟨x∣L⊗IQ2⊗∣xx⟩⟨xx∣F1F2.(50)\rho_A=\frac{1}{2}\sum_{x=0}^{1}|x\rangle\langle x|_L\otimes\frac{I_Q}{2}\otimes|xx\rangle\langle xx|_{F_1F_2}. \tag*{(50)}

The label is shared without disturbance, whereas the fragments contain no information about QQ:

H(S)=2,I(S:Fa)=Iacc(S:Fa)=1.(51)H(S)=2,\qquad I(S:F_a)=I_{\mathrm{acc}}(S:F_a)=1. \tag*{(51)}

Consequently ρA∈R\rho_A\in\mathrm{R}, but QD and SQD fail for the complete pointer of SS.

b.b. B: QD without a shared fact. Let S=S1S2S=S_1S_2, let Φ=∣Φ+⟩⟨Φ+∣\Phi=|\Phi^+\rangle\langle\Phi^+| denote a Bell projector, and take

ρB=ΦS1F1⊗ΦS2F2.(52)\rho_B=\Phi_{S_1F_1}\otimes\Phi_{S_2F_2}. \tag*{(52)}

Each fragment satisfies I(S:Fa)=H(S)=2I(S:F_a)=H(S)=2, but Iacc(S:Fa)=1I_{\mathrm{acc}}(S:F_a)=1. Thus QD holds whereas SQD fails. The complete state is pure and admits no nontrivial exact shared event.

c.c. C: SQD without global nondisturbance. For S,F1,F2S,F_1,F_2, take the coherent GHZ state

∣G⟩=(∣000⟩+∣111⟩)SF1F2/2,ρC=∣G⟩⟨G∣.(53)|G\rangle=(|000\rangle+|111\rangle)_{SF_1F_2}/\sqrt{2},\qquad\rho_C=|G\rangle\langle G|. \tag*{(53)}

Each S:FaS:F_a marginal is a classical copy of the system ZZ label:

I(S:Fa)=Iacc(S:Fa)=χ(X:Fa)=H(S)=1.(54)I(S:F_a)=I_{\mathrm{acc}}(S:F_a)=\chi(X:F_a)=H(S)=1. \tag*{(54)}

Yet an unread pointer measurement removes the ∣000⟩⟨111∣|000\rangle\langle111| coherence. Hence ρC∈SQDX∖RX\rho_C\in\mathrm{SQD}_X\setminus\mathrm{R}_X, and the complete pure state has no nontrivial exact shared event. Tracing out SS first produces a different tested state with a shared classical bit, illustrating the importance of the system boundary.

d.d. D: An exact pointer record need not be SBS. Let Fa=LaKaF_a=L_aK_a, where LaL_a stores the pointer label and KaK_a is a quantum register. Put ∣ϕθ⟩=cos⁡θ∣0⟩+sin⁡θ∣1⟩|\phi_\theta\rangle=\cos\theta|0\rangle+\sin\theta|1\rangle on K1K2K_1K_2 for 0≤θ≤π/40\le\theta\le\pi/4, and define

ρD(θ)=12∑x=01∣x⟩⟨x∣S⊗∣xx⟩⟨xx∣L1L2⊗∣ϕθ⟩⟨ϕθ∣K1K2.(55)\rho_D(\theta)=\frac{1}{2}\sum_{x=0}^{1}|x\rangle\langle x|_S\otimes|xx\rangle\langle xx|_{L_1L_2}\otimes|\phi_\theta\rangle\langle\phi_\theta|_{K_1K_2}. \tag*{(55)}

Each LaL_a reads XX without disturbance, so

I(S:Fa)=Iacc(S:Fa)=H(S)=1.(56)I(S:F_a)=I_{\mathrm{acc}}(S:F_a)=H(S)=1. \tag*{(56)}

For θ>0\theta>0, the conditional state on K1K2K_1K_2 is entangled, and ρD(θ)∈RX∖SBSX\rho_D(\theta)\in\mathrm{R}_X\setminus\mathrm{SBS}_X. For θ=0\theta=0, it is SBS. The conditional-correlation measure in Eq. (14) gives

J(F1:F2∣S)=2h2(sin⁡2θ),(57)J(F_1:F_2\mid S)=2h_2(\sin^2\theta), \tag*{(57)}

which ranges from zero to two bits. Each conditional K1K2K_1K_2 state is pure, while its one-qubit reductions have eigenvalues cos⁡2θ\cos^2\theta and sin⁡2θ\sin^2\theta. Thus exact pointer sharing can coexist with nonzero conditional entanglement.

e.e. E: A shared fact and QD need not imply SQD. Add a copied classical tag to the two Bell pairs of region B. Let S=LS1S2S=LS_1S_2 and Fa=LaKaF_a=L_aK_a, with

ρE=ρtagL1L2⊗ΦS1K1⊗ΦS2K2,(58)\rho_E=\rho_{\mathrm{tag}}^{L_1L_2}\otimes\Phi_{S_1K_1}\otimes\Phi_{S_2K_2}, \tag*{(58)}
ρtagL1L2=12∑x=01∣xx⟩⟨xx∣.\rho_{\mathrm{tag}}^{L_1L_2}=\frac{1}{2}\sum_{x=0}^{1}|xx\rangle\langle xx|.

The tag LL is an exact shared event, while H(S)=I(S:Fa)=3H(S)=I(S:F_a)=3 and Iacc(S:Fa)=2I_{\mathrm{acc}}(S:F_a)=2. Hence ρE∈R∩QD\rho_E\in\mathrm{R}\cap\mathrm{QD} but does not satisfy SQD for the complete pointer.

References

References

  1. [1]W. H. Zurek, “Pointer basis of quantum apparatus: Into what mixture does the wave packet collapse?” Phys. Rev. D 24, 1516 (1981).DOI
  2. [2]W. H. Zurek, “Environment-induced superselection rules,” Phys. Rev. D 26, 1862 (1982).DOI
  3. [3]E. Joos and H. D. Zeh, “The emergence of classical properties through interaction with the environment,” Z. Phys. B Condens. Matter 59, 23–43 (1985).DOI
  4. [4]W. H. Zurek, “Decoherence, einselection, and the quantum origins of the classical,” Rev. Mod. Phys. 75, 715 (2003).DOI
  5. [5]M. Schlosshauer, “Decoherence, the measurement problem, and interpretations of quantum mechanics,” Rev. Mod. Phys. 76, 1267–1305 (2005).DOI
  6. [6]H. Ollivier, D. Poulin, and W. H. Zurek, “Objective properties from subjective quantum states: Environment as a witness,” Phys. Rev. Lett. 93, 220401 (2004).DOI
  7. [7]R. Blume-Kohout and W. H. Zurek, “Quantum Darwinism: Entanglement, branches, and the emergent classicality of redundantly stored quantum information,” Phys. Rev. A 73, 062310 (2006).
  8. [8]W. H. Zurek, “Quantum Darwinism,” Nat. Phys. 5, 181 (2009).
  9. [9]F. G. S. L. Brandão, M. Piani, and P. Horodecki, “Generic emergence of classical features in quantum Darwinism,” Nat. Commun. 6, 7908 (2015).DOI
  10. [10]W. H. Zurek, “Quantum theory of the classical: Einselection, envariance, quantum Darwinism and extantons,” Entropy 24, 1520 (2022).DOI
  11. [11]R. Blume-Kohout and W. H. Zurek, “Quantum Darwinism in quantum Brownian motion,” Phys. Rev. Lett. 101, 240405 (2008).
  12. [12]C. J. Riedel and W. H. Zurek, “Quantum Darwinism in an everyday environment: Huge redundancy in scattered photons,” Phys. Rev. Lett. 105, 020404 (2010).DOI
  13. [13]M. Zwolak, C. J. Riedel, and W. H. Zurek, “Amplification, redundancy, and quantum Chernoff information,” Phys. Rev. Lett. 112, 140406 (2014).pubmed.ncbi.nlm.nih.gov/24765928
  14. [14]M. A. Ciampini, G. Pinna, P. Mataloni, and M. Paternostro, “Experimental signature of quantum Darwinism in photonic cluster states,” Phys. Rev. A 98, 020101 (2018).DOI
  15. [15]T. K. Unden, D. Louzon, M. Zwolak, W. H. Zurek, and F. Jelezko, “Revealing the emergence of classicality using nitrogen-vacancy centers,” Phys. Rev. Lett. 123, 140402 (2019).DOI
  16. [16]L. Henderson and V. Vedral, “Classical, quantum and total correlations,” J. Phys. A: Math. Gen. 34, 6899–6905 (2001).DOI
  17. [17]H. Ollivier and W. H. Zurek, “Quantum discord: A measure of the quantumness of correlations,” Phys. Rev. Lett. 88, 017901 (2001).pubmed.ncbi.nlm.nih.gov/11800986
  18. [18]M. Zwolak and W. H. Zurek, “Complementarity of quantum discord and classically accessible information,” Sci. Rep. 3, 1729 (2013).arxiv.org/abs/1303.4659
  19. [19]T. P. Le and A. Olaya-Castro, “Objectivity (or lack thereof): Comparison between predictions of quantum Darwinism and spectrum broadcast structure,” Phys. Rev. A 98, 032103 (2018).DOI
  20. [20]T. P. Le and A. Olaya-Castro, “Strong quantum Darwinism and strong independence are equivalent to spectrum broadcast structure,” Phys. Rev. Lett. 122, 010403 (2019).DOI
  21. [21]J. K. Korbicz, “Roads to objectivity: Quantum Darwinism, spectrum broadcast structures, and strong quantum Darwinism—a review,” Quantum 5, 571 (2021).DOI
  22. [22]J. K. Korbicz, P. Horodecki, and R. Horodecki, “Objectivity in a noisy photonic environment through quantum state information broadcasting,” Phys. Rev. Lett. 112, 120402 (2014).pubmed.ncbi.nlm.nih.gov/24724630
  23. [23]R. Horodecki, J. K. Korbicz, and P. Horodecki, “Quantum origins of objectivity,” Phys. Rev. A 91, 032122 (2015).DOI
  24. [24]J. K. Korbicz, E. A. Aguilar, P. Cwikliński, and P. Horodecki, “Generic appearance of objective results in quantum measurements,” Phys. Rev. A 96, 032124 (2017).DOI
  25. [25]T. P. Le and A. Olaya-Castro, “Witnessing non-objectivity in the framework of strong quantum Darwinism,” Quantum Sci. Technol. 5, 045012 (2020).DOI
  26. [26]A. Feller, B. Roussel, I. Frérot, and P. Degiovanni, “Comment on Strong quantum Darwinism and strong independence are equivalent to spectrum broadcast structure,” Phys. Rev. Lett. 126, 188901 (2021).DOI
  27. [27]N. Bohr, “Can quantum-mechanical description of physical reality be considered complete?” Phys. Rev. 48, 696 (1935).
  28. [28]C. Beny, A. Kempf, and D. W. Kribs, “Generalization of quantum error correction via the Heisenberg picture,” Phys. Rev. Lett. 98, 100502 (2007).pubmed.ncbi.nlm.nih.gov/17358519
  29. [29]C. Beny, A. Kempf, and D. W. Kribs, “Quantum error correction of observables,” Phys. Rev. A 76, 042303 (2007).DOI
  30. [30]Marin Girard, Gong Cheng, and ChunJun Cao, “Demystifying objectivity with operator algebra quantum error correction,” (2026), arXiv:2606.06588.arxiv.org/abs/2606.06588
  31. [31]C. M. Scandolo, R. Salazar, J. K. Korbicz, and P. Horodecki, “Universal structure of objective states in all fundamental causal theories,” Phys. Rev. Research 3, 033148 (2021).DOI
  32. [32]M. Piani, P. Horodecki, and R. Horodecki, “No-local-broadcasting theorem for multipartite quantum correlations,” Phys. Rev. Lett. 100, 090502 (2008).pubmed.ncbi.nlm.nih.gov/18352686
  33. [33]S. Luo, “Using measurement-induced disturbance to characterize correlations as classical or quantum,” Phys. Rev. A 77, 022301 (2008).DOI
  34. [34]H. Barnum, C. M. Caves, C. A. Fuchs, R. Jozsa, and B. Schumacher, “Noncommuting mixed states cannot be broadcast,” Phys. Rev. Lett. 76, 2818 (1996).pubmed.ncbi.nlm.nih.gov/10060796
  35. [35]A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Problems of Information Transmission 9, 177–183 (1973).
  36. [36]P. Mironowicz, J. K. Korbicz, and P. Horodecki, “Monitoring of the process of system information broadcasting in time,” Phys. Rev. Lett. 118, 150501 (2017).DOI
  37. [37]R. M. Fano, Transmission of Information: A Statistical Theory of Communication (MIT Press, Cambridge, MA, 1961).
  38. [38]D. A. Chisholm, L. Innocenti, and G. M. Palma, “The meaning of redundancy and consensus in quantum objectivity,” Quantum 7, 1074 (2023).DOI
  39. [39]D. A. Chisholm, L. Innocenti, and G. M. Palma, “Importance of using the averaged mutual information when quantifying quantum objectivity,” Phys. Rev. A 110, 012218 (2024).DOI
  40. [40]B. Groisman, S. Popescu, and A. Winter, “Quantum, classical, and total amount of correlations in a quantum state,” Phys. Rev. A 72, 032317 (2005).DOI
  41. [41]C. A. Fuchs and J. van de Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Trans. Inf. Theory 45, 1216 (1999).DOI
  42. [42]M. Zwolak, C. J. Riedel, and W. H. Zurek, “Amplification, decoherence and the acquisition of information by spin environments,” Sci. Rep. 6, 25277 (2016).DOI
  43. [43]G. Garcia-Perez, D. A. Chisholm, M. A. C. Rossi, G. M. Palma, and S. Maniscalco, “Decoherence without entanglement and quantum Darwinism,” Phys. Rev. Research 2, 012061 (2020).
  44. [44]T.-H. Lee and J. K. Korbicz, “Complementarity between decoherence and information retrieval from the environment,” Phys. Rev. A 109, 032221 (2024).DOI
  45. [45]K. Roszak and J. K. Korbicz, “Entanglement and objectivity in pure dephasing models,” Phys. Rev. A 100, 062127 (2019).DOI
  46. [46]S. Lorenzo, M. Paternostro, and G. M. Palma, “Anti-Zeno-based dynamical control of the unfolding of quantum Darwinism,” Phys. Rev. Research 2, 013164 (2020).DOI
  47. [47]D. Girolami, A. Touil, B. Yan, S. Deffner, and W. H. Zurek, “Redundantly amplified information suppresses quantum correlations in many-body systems,” Phys. Rev. Lett. 129, 014041 (2022).DOI
  48. [48]J. Gu, “Hamiltonian thresholds for objective records,” Phys. Rev. A 114, L020201 (2026).DOI
  49. [49]C. J. Riedel, W. H. Zurek, and M. Zwolak, “The rise and fall of redundancy in decoherence and quantum Darwinism,” New J. Phys. 14, 083010 (2012).DOI
  50. [50]G. Pleasance and B. M. Garraway, “Application of quantum Darwinism to a structured environment,” Phys. Rev. A 96, 062105 (2017).DOI
  51. [51]A. Lampo, J. Tuziermski, M. Lewenstein, and J. K. Korbicz, “Objectivity in non-Markovian spin-boson model,” Phys. Rev. A 96, 012120 (2017).DOI
  52. [52]P. Mironowicz, P. Należyty, P. Horodecki, and J. K. Korbicz, “System information propagation for spin structures,” Phys. Rev. A 98, 022124 (2018).DOI
  53. [53]F. Sakuldee, P. Taranto, and S. Milz, “Connecting commutativity and classicality for multimtime quantum processes,” Phys. Rev. A 106, 022416 (2022).DOI
  54. [54]P. Strasberg, “Classicality with(out) decoherence: Concepts, relation to Markovianity, and a random matrix theory approach,” SciPost Phys. 15, 024 (2023).DOI
  55. [55]J. Tuziermski and J. K. Korbicz, “Dynamical objectivity in quantum Brownian motion,” Europhys. Lett. 112, 40008 (2015).
  56. [56]J. Tuziermski and J. K. Korbicz, “Analytical studies of spectrum broadcast structures in quantum Brownian motion,” J. Phys. A 49, 445301 (2016).
  57. [57]S. Campbell, B. Çakmak, O. E. Müstecaplıoğlu, M. Paternostro, and B. Vacchini, “Collisional unfolding of quantum Darwinism,” Phys. Rev. A 99, 042103 (2019).DOI
  58. [58]E. Doucet and S. Deffner, “Classifying two-body Hamiltonians for quantum Darwinism,” Phys. Rev. X 14, 041064 (2024).DOI
  59. [59]B. Ferte and X. Cao, “Solvable model of quantum-Darwinism-encoding transitions,” Phys. Rev. Lett. 132, 110201 (2024).DOI
  60. [60]A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Trans. Inf. Theory 45, 2481–2485 (1999).DOI

Paper details

vlnc:W_ep2mknv2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

OpenAI GPT-6

View statement
Looking for related papers…
Contents