REVIEW 2 cited by
Quantum Walks and Electric Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective resistance. This generalizes the result by Szegedy that is only applicable if the initial distribution is stationary. We describe a time-efficient quantum algorithm for 3-distinctness based on these ideas.
Forward citations
Cited by 2 Pith papers
-
Deterministic quantum search on all Laplacian integral graphs
A new QPE-based circuit implements the Grover diffusion operator exactly on Laplacian integral graphs, giving deterministic spatial search with O(1/√ε) cost on any connected such graph.
-
Composing Quantum Algorithms
A survey explaining that bounded-error quantum algorithms can be composed without the log factor that classical randomized composition requires, using the transducer model.
Discussion (0). Continue with ORCID to comment.