A compressed classical description of quantum states

DOI10.4230/LIPICS.TQC.2019.8MaRDI QIDQ5089155FDO

Authors David Gosset, John A. Smolin

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1801.05721

zbMATH Keywords

quantum computationquantum communication complexityclassical simulation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Efficient and exact quantum compression
• Quantum compression relative to a set of measurements
• Compressing quantum mixed-state sources by sending classical information
• The learnability of quantum states
• Trading quantum for classical resources in quantum data compression

Cites work

• scientific article; zbMATH DE number 1263236 (Why is no real title available?)
• Exponential separation of quantum and classical communication complexity
• Exponential separations for one-way quantum communication complexity, with applications to cryptography
• How to efficiently select an arbitrary Clifford group element
• On randomized one-round communication complexity
• Quantum one-way communication can be exponentially stronger than classical communication
• Random generation of combinatorial structures from a uniform distribution
• The Heisenberg representation of quantum computers

Cited in

(2)

• Partial description of quantum states
• On classical and hybrid shadows of quantum states

This page was built for publication: A compressed classical description of quantum states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089155)