Pré-Publication, Document De Travail Année : 2025

Time-Space Tradeoffs in Searching for a Path in Welded Trees, Classically or Quantumly

Résumé

Welded Trees are a class of graphs designed to exhibit exponential algorithmic speedup for certain search problems via quantum walks, outperforming any classical algorithm. A Welded Tree of depth d consists of two complete binary trees, each of depth d, whose leaves are interconnected by an additional cycle or permutation alternating between the two trees. Access to this graph is provided only through queries to an oracle, which, given a vertex, returns its neighbors. In 2021, Aaronson suggested the FINDING-PATH-TO-EXIT problem, which consists of finding a path to the root of the opposite tree given the root of one tree. This can be seen as an extension of the FINDING-EXIT problem, where the task is simply to find the root of the opposite tree, for which Childs et al. demonstrated an exponential speed-up in 2003.

We provide a quantum algorithm for solving the Finding Path To Exit problem that performs Õ(2d/3) queries and also formalize the folklore lower bound that any classical algorithm requires at least Ω̃(2d/2 ) queries. This is the first proof of a polynomial speed-up for this problem over any classical algorithm. In addition, we present and analyze several other algorithms, focusing on the trade-offs between queries and classical or quantum space.

Fichier principal
Vignette du fichier
welded-trees-leborgne-tegally.pdf (1.05 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04685710 , version 1 (03-09-2024)
hal-04685710 , version 2 (05-05-2025)

Licence

Identifiants

  • HAL Id : hal-04685710 , version 2

Citer

Yvan Le Borgne, Shrinidhi Teganahally Sridhara. Time-Space Tradeoffs in Searching for a Path in Welded Trees, Classically or Quantumly. 2025. ⟨hal-04685710v2⟩
235 Consultations
519 Téléchargements

Partager

  • More