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 virtual irrecoverability, the \emph{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. In such cases only \emph{approximate} virtual recovery is available. We study the sampling cost when approaching the minimal attainable recovery error, and find it bounded when the underlying linear map exhibits a spectrum gap, and divergent in the gapless regime, respectively. Together with the universal error floor, this dichotomy partitions all multipartite quantum states into four classes. Moreover, we show that conditional mutual information, the standard entropic diagnostic, does not constrain 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 virtual irrecoverability, the \emph{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. In such cases only \emph{approximate} virtual recovery is available. We study the sampling cost when approaching the minimal attainable recovery error, and find it bounded when the underlying linear map exhibits a spectrum gap, and divergent in the gapless regime, respectively. Together with the universal error floor, this dichotomy partitions all multipartite quantum states into four classes. Moreover, we show that conditional mutual information, the standard entropic diagnostic, does not constrain 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.
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
Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.
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.