Quantum state description complexity (invited talk)

DOI10.4230/LIPICS.FSTTCS.2011.28MaRDI QIDQ2911607zbMATH OpenOpenAlexFDO

Authors Umesh V. Vazirani

Publication date 31 August 2012

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28

zbMATH Keywords

area lawdescription complexitydetectability lemmaentanglementHamiltonian

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Descriptive complexity and finite models (68Q19)

Recommendations

• Area laws and efficient descriptions of quantum many-body states
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• Exponential decay of correlations implies area law
• A full characterization of quantum advice
• Quantum Kolmogorov complexity based on classical descriptions

Cited in

(2)

• Area laws and efficient descriptions of quantum many-body states
• Hay from the haystack: explicit examples of exponential quantum circuit complexity

This page was built for publication: Quantum state description complexity (invited talk)

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