Virtual Quantum Markov Chains
arXiv:2312.02031 · doi:10.1109/TIT.2025.3568128
Abstract
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 of virtual 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.
19 pages including appendix, 6 figures, v2: results and references updated
References in corpus (34)
- Three qubits can be entangled in two inequivalent ways
- Error mitigation for short-depth quantum circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Mixed-state entanglement from local randomized measurements
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Quantum conditional mutual information and approximate Markov chains
- Recoverability in quantum information theory
- Scalable reconstruction of density matrices
- Circuit knitting with classical communication
- Robustness of quantum Markov chains
- Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution
- Quasiprobability decompositions with reduced sampling overhead
- Efficient quantum algorithms for stabilizer entropies
- Fidelity of recovery, geometric squashed entanglement, and measurement recoverability
- Universal recovery map for approximate Markov chains
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Physical Implementability of Linear Maps and Its Application in Error Mitigation
- The Fidelity of Recovery is Multiplicative
- Quantum algorithm for estimating Renyi entropies of quantum states
- Detecting and quantifying entanglement on near-term quantum devices
- Quantum algorithms for estimating quantum entropies
- New Quantum Algorithms for Computing Quantum Entropies and Distances
- Operational applications of the diamond norm and related measures in quantifying the non-physicality of quantum maps
- Virtual quantum resource distillation
- Semi-definite programming and quantum information
- Virtual quantum broadcasting
- Approximate reversal of quantum Gaussian dynamics
- Approximate quantum Markov chains
- Necessary criterion for approximate recoverability
- Information recoverability of noisy quantum states
- Reversing Unknown Quantum Processes via Virtual Combs for Channels with Limited Information
- Optimal unilocal virtual quantum broadcasting
- Petz recovery versus matrix reconstruction