scientific article; zbMATH DE number 7651028

DOI10.4230/LIPICS.TQC.2020.1MaRDI QIDQ5874382zbMATH OpenFDO

Authors João F. Doriguello, Ashley Montanaro

Publication date 7 February 2023

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

zbMATH Keywords

Boolean hidden matching problemcommunication complexityquantum communication complexity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Alternative quantum mechanics (including hidden variables, etc.) (81Q65)

Recommendations

• Exponential separation of quantum and classical communication complexity
• Exponential separations for one-way quantum communication complexity, with applications to cryptography
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• Bounded-error quantum state identification and exponential separations in communication complexity
• Bounded-error quantum state identification and exponential separations in communication complexity
• Exponential separation of quantum and classical one-way communication complexity
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• A new exponential separation between quantum and classical one-way communication complexity
• scientific article; zbMATH DE number 2086394
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness

Cited in

(1)

• Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

This page was built for publication:

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