A postselected quantum algorithm encodes graph connectivity into GHZ states and claims constant measurement complexity, but its success probability shrinks exponentially with graph size.
For simple graphs, the standard graph analysis packages can be used to generate random Erd˝ os-R´ enyi graphs [59], which can then be assigned to the nodes
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.