Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations
quant-ph
Submitted: 2026-10-05
Updated: 2026-10-05
Terminology
Sources
- Computational relative entropy
- Computational Entanglement Theory
- Accessible Quantum Correlations Under Complexity Constraints
- The computational two-way quantum capacity
- Principles of Quantum Communication Theory: A Modern Approach
- Universal quantum coding
- Universal distillation of quantum entanglement
- Universal Entanglement Distillation
- Quantum algorithms for Uhlmann transformation
- Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
- Pseudo-Entanglement is Necessary for EFI Pairs
- Holographic pseudoentanglement and the complexity of the AdS/CFT dictionary
- On the hardness of learning ground state entanglement of geometrically local Hamiltonians
- Vectorization of quantum operations and its use
- Concatenated Quantum Codes
- Stabilizer Codes and Quantum Error Correction
- Random dimension reduction and learning symmetric properties of quantum states
- High-dimensional quantum Schur transforms
- Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application
- Conjugate queries can help
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians