Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.11795
Cited By
v1
v2
v3
v4
v5 (latest)
Quantum Distributed Complexity of Set Disjointness on a Line
International Colloquium on Automata, Languages and Programming (ICALP), 2020
26 February 2020
F. Magniez
A. Nayak
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Quantum Distributed Complexity of Set Disjointness on a Line"
5 / 5 papers shown
Distributed Quantum Advantage for Local Problems
Symposium on the Theory of Computing (STOC), 2024
Alkida Balliu
S. Brandt
Xavier Coiteux-Roy
Francesco d’Amore
Massimo Equi
...
Dennis Olivetti
M. Renou
Jukka Suomela
Lucas Tendick
Isadora Veeren
172
12
0
05 Nov 2024
On the Power of Quantum Distributed Proofs
Atsuya Hasegawa
Srijita Kundu
H. Nishimura
333
5
0
21 Mar 2024
No distributed quantum advantage for approximate graph coloring
Symposium on the Theory of Computing (STOC), 2023
Xavier Coiteux-Roy
Francesco d’Amore
Rishikesh R. Gajjala
Fabian Kuhn
Franccois Le Gall
Henrik Lievonen
Augusto Modanese
M. Renou
Gustav Schmid
Jukka Suomela
345
21
0
18 Jul 2023
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
Xudong Wu
Penghui Yao
MQ
310
15
0
06 Jun 2022
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
SPIN (SPIN), 2021
Changsheng Wang
Xudong Wu
Penghui Yao
186
6
0
06 Jun 2022
1
Page 1 of 1
