Presents an asymptotically optimal Õ(n²)-time quantum algorithm for the BDG causal set action via uniform superposition over causal set encodings and two-stage quantum counting.
Adiabatic quantum unstructured search in parallel
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
citing papers explorer
-
Benincasa-Dowker-Glaser causal set actions by quantum counting
Presents an asymptotically optimal Õ(n²)-time quantum algorithm for the BDG causal set action via uniform superposition over causal set encodings and two-stage quantum counting.