A postselected quantum algorithm encodes graph connectivity into GHZ states and claims constant measurement complexity, but its success probability shrinks exponentially with graph size.
F¨ orderprogramm Quanten- technologien – von den Grundlagen zum Markt
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Constant Measurement Quantum Algorithm for Graph Connectivity
A postselected quantum algorithm encodes graph connectivity into GHZ states and claims constant measurement complexity, but its success probability shrinks exponentially with graph size.