Quantum distributed complexity of set disjointness on a line

DOI10.4230/LIPICS.ICALP.2020.82MaRDI QIDQ6842489zbMATH OpenFDO

Authors Frédéric Magniez, Ashwin Nayak

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.82

zbMATH Keywords

communication complexityquantum distributed computingquery complexityset disjointness

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Complexity measures and decision tree complexity: a survey.
• Distributed algorithms for network diameter and girth
• Distributed Computing: A Locality-Sensitive Approach
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
• Networks cannot compute their diameter in sublinear time
• Optimal distributed all pairs shortest paths and applications
• Quantum communication complexity of symmetric predicates
• Quantum information complexity
• Search via Quantum Walk
• Sublinear-time quantum computation of the diameter in CONGEST networks
• The theory of quantum information
• Understanding quantum algorithms via query complexity

This page was built for publication: Quantum distributed complexity of set disjointness on a line

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