ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2206.02766
  4. Cited By
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum
  CONGEST Model

Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model

6 June 2022
Changsheng Wang
Xudong Wu
Penghui Yao
ArXivPDFHTML

Papers citing "Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model"

1 / 1 papers shown
Title
No distributed quantum advantage for approximate graph coloring
No distributed quantum advantage for approximate graph coloring
Xavier Coiteux-Roy
Francesco d’Amore
Rishikesh R. Gajjala
Fabian Kuhn
Franccois Le Gall
Henrik Lievonen
Augusto Modanese
M. Renou
Gustav Schmid
Jukka Suomela
32
11
0
18 Jul 2023
1