The recovery of quantum information after subsystem loss is a central challenge in quantum information processing. However, some states remain beyond the reach of any recovery strategies. Here we identify the algebraic origin of irrecoverability, the ghost information---correlations encoded in the global state that leave no trace on any accessible subsystem. We introduce a scalar measure quantifying its magnitude and prove a universal error floor below which no virtual recovery map can operate, irrespective of resource investment. We further uncover a spectral phase transition in the sampling cost: bounded when the underlying linear map exhibits a spectrum gap, and divergent with a universal exponent in the gapless regime. Together with the universal error floor, this dichotomy organizes all multipartite quantum states into four classes. Moreover, it is revealed that conditional mutual information---the standard entropic diagnostic---is fundamentally irrelevant to virtual recoverability. As an implication, we show that the error floor imposes a detection threshold for loss-tolerant quantum metrology.
The recovery of quantum information after subsystem loss is a central challenge in quantum information processing. However, some states remain beyond the reach of any recovery strategies. Here we identify the algebraic origin of irrecoverability, the ghost information---correlations encoded in the global state that leave no trace on any accessible subsystem. We introduce a scalar measure quantifying its magnitude and prove a universal error floor below which no virtual recovery map can operate, irrespective of resource investment. We further uncover a spectral phase transition in the sampling cost: bounded when the underlying linear map exhibits a spectrum gap, and divergent with a universal exponent in the gapless regime. Together with the universal error floor, this dichotomy organizes all multipartite quantum states into four classes. Moreover, it is revealed that conditional mutual information---the standard entropic diagnostic---is fundamentally irrelevant to virtual recoverability. As an implication, we show that the error floor imposes a detection threshold for loss-tolerant quantum metrology.
A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In this work, we show that the quantum conditional mutual information measures the performance of such recovery operations. More precisely, we prove that the conditional mutual information I ( A : C | B ) of a tripartite quantum state ρ ABC can be bounded from below by its distance to the closest recovered state R B → B C ( ρ A B ) , where the C -part is reconstructed from the B -part only and the recovery map R B → B C merely depends on ρ BC . One particular application of this result implies the equivalence between two different approaches to define topological order in quantum systems.
Abstract We extend the framework of virtual quantum Markov chains (VQMCs) from tripartite systems to the four-qubit setting. Structural criteria such as the kernel-inclusion condition are analyzed, showing that they are necessary but not sufficient for the existence of a valid recovery map. By explicit examples, we demonstrate that the four-qubit W state admits a recovery channel and thus qualifies as a VQMC, while the GHZ state does not. We further provide semidefinite programming (SDP) formulations to test recoverability and quantify sampling overhead, and establish the non-convexity of the VQMC set through mixed-state counterexamples. These results supply both theoretical insights and computational tools for studying correlations and recoverability in multipartite quantum systems.
The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds pthopt. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining pthopt without explicit optimisation. In contrast, previous works give a lower bound on pthopt by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound pthopt. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is pthopt. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams.
Quantum information decoupling is a pillar of quantum information theory, underlying quantum communication, error correction, and information recovery. However, its existing formulations rely on random unitary operations tied to finite-dimensional assumptions on quantum systems. Here we establish a decoupling framework for arbitrary separable, possibly infinite-dimensional systems. For finite-dimensional inputs and arbitrary separable reference/output systems, we derive error bounds on one-shot decoupling for completely positive maps in terms of sandwiched Rényi conditional entropies. For partial-trace decoupling with finite-dimensional references, the error exponent is optimal up to the known critical rate. To handle infinite-dimensional inputs, we assume finite entropy of the manipulated system. We construct finite-rank projections on independent and identically distributed (IID) states to restrict randomization to a projected finite-dimensional subspace, while ensuring high success probability by including auxiliary components in the discarded subsystem at asymptotically negligible cost. This leads to an infinite-dimensional IID partial-trace decoupling protocol achieving optimal asymptotic dimension rates. As an application, we construct an infinite-dimensional quantum-state-merging protocol, a mother protocol of quantum information theory. Under finite entropy of Alice's marginal, it achieves the same quantum-communication and total-cost rates as in finite dimensions, governed by mutual information and conditional entropy. These results show that the operational interpretation of entropic quantities through these achievable rates constitutes a universal principle beyond finite dimensions. More broadly, our framework provides foundational tools for exploring quantum information regardless of whether we model the physical world using finite- or infinite-dimensional spaces.
Quantum Markov chains generalize classical Markov chains for random variables to the quantum realm and exhibit unique inherent properties, making them an important feature in quantum information theory. In this work, we propose the concept ofvirtual quantum Markov chains(VQMCs), focusing on scenarios where subsystems retain classical information about global systems from measurement statistics. As a generalization of quantum Markov chains, VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We present an algebraic characterization for virtual quantum Markov chains and show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems. Notably, we find a distinction between two classes of tripartite entanglement by showing that the W state is a VQMC while the GHZ state is not. Furthermore, we introduce the virtual non- Markovianity to quantify the non-Markovianity of a given quantum state which also assesses the optimal sampling overhead for virtually recovering this state. Our findings elucidate distinctions between quantum Markov chains and virtual quantum Markov chains, extending our understanding of quantum recovery to scenarios prioritizing classical information from measurement statistics.
This paper introduces an operational framework for quantifying reconstructability in open quantum systems under realistic conditions involving noise, measurement, and recovery processes. While decoherence theory explains the suppression of interference due to system–environment interactions, it does not directly address whether quantum states remain reconstructable in practice. To bridge this gap, this work proposes the Recoverability Index (RI), a scalar diagnostic that quantifies how close a system remains to reconstructable dynamics. The RI integrates three key components: recovery fidelity, entropy-like proxies of environmental information dispersal, and distinguishability of environmental records. Unlike traditional approaches that focus on coherence loss, this framework emphasizes reconstructability as an operational criterion, enabling a practical distinction between recoverable and effectively irreversible regimes. A simplified quantum error correction (QEC) scenario is used to demonstrate the applicability of the RI. The results show that the RI provides a transparent and interpretable metric for comparing noise conditions, evaluating recovery performance, and identifying boundaries of reconstructability. This work does not propose a new fundamental theory of quantum measurement. Instead, it offers a tool-oriented extension of the Entropy-Induced Collapse (EIC) framework, focusing on measurable quantities and practical diagnostics. The Recoverability Index serves as a bridge between conceptual descriptions of irreversibility and actionable evaluation in experimental and computational quantum systems. Keywords: quantum decoherence, quantum error correction, recoverability, irreversibility, open quantum systems, quantum information