scientific article; zbMATH DE number 7559369

DOI10.4230/LIPIcs.TQC.2019.8MaRDI QIDQ5089155

John A. Smolin, David Gosset

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum computationquantum communication complexityclassical simulation

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• On randomized one-round communication complexity
• Exponential separation of quantum and classical communication complexity
• How to efficiently select an arbitrary Clifford group element
• Quantum one-way communication can be exponentially stronger than classical communication

This page was built for publication: