Quantum Information Complexity

DOI10.1145/2746539.2746613zbMath1321.94022arXiv1404.3733OpenAlexW1970803012WikidataQ130922117 ScholiaQ130922117MaRDI QIDQ2941521

Dave Touchette

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

compressioninformation complexitycommunication complexitydirect sumquantum computation and information

Mathematics Subject Classification ID

Information theory (general) (94A15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Bounds on oblivious multiparty quantum communication complexity ⋮ Communication and information complexity ⋮ Attacking quantum hashing. Protocols and their cryptanalysis ⋮ Noisy Interactive Quantum Communication ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Trading information complexity for error. II: The case of a large error and the external information complexity

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Quantum Information Complexity