scientific article; zbMATH DE number 6866237
From MaRDI portal
Publication:4637980
DOI10.4230/LIPIcs.TQC.2017.6zbMath1427.68088MaRDI QIDQ4637980
François Le Gall, Shogo Nakajima
Publication date: 3 May 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Communication complexity, information complexity (68Q11)
Related Items (2)
Bounds on oblivious multiparty quantum communication complexity ⋮ Fooling views: a new lower bound technique for distributed computations under congestion
Cites Work
- Unnamed Item
- Unnamed Item
- Improved quantum query algorithms for triangle detection and associativity testing
- On the distributional complexity of disjointness
- Quantum algorithm for triangle finding in sparse graphs
- Quantum search with variable times
- Finding, Minimizing, and Counting Weighted Subgraphs
- Towards polynomial lower bounds for dynamic problems
- New bounds on the classical and quantum communication complexity of some graph properties
- Search via Quantum Walk
- The Probabilistic Communication Complexity of Set Intersection
- Extended Learning Graphs for Triangle Finding
- Quantum communication complexity of symmetric predicates
- Quantum Query Complexity of Minor-Closed Graph Properties
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Triangle Problem
- Span programs for functions with constant-sized 1-certificates
- Quantum Walk Algorithm for Element Distinctness
This page was built for publication:
