Multiparty quantum communication complexity of triangle finding
From MaRDI portal
Recommendations
Cites work
- Extended Learning Graphs for Triangle Finding
- Finding, minimizing, and counting weighted subgraphs
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- Improved quantum query algorithms for triangle detection and associativity testing
- New bounds on the classical and quantum communication complexity of some graph properties
- On the distributional complexity of disjointness
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Triangle Problem
- Quantum communication complexity of symmetric predicates
- Quantum query complexity of minor-closed graph properties
- Quantum search of spatial regions
- Quantum search with variable times
- Quantum Walk Algorithm for Element Distinctness
- Search via Quantum Walk
- Span programs for functions with constant-sized 1-certificates (extended abstract)
- The Probabilistic Communication Complexity of Set Intersection
- Towards polynomial lower bounds for dynamic problems
Cited in
(6)- Fooling views: a new lower bound technique for distributed computations under congestion
- New bounds on the classical and quantum communication complexity of some graph properties
- Multi-party Quantum Communication Complexity with Routed Messages
- On the multiparty communication complexity of testing triangle-freeness
- Quantum Multiparty Communication Complexity and Circuit Lower Bounds
- Bounds on oblivious multiparty quantum communication complexity
This page was built for publication: Multiparty quantum communication complexity of triangle finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637980)
