Searching via walking: How to find a marked clique of a complete graph using quantum walks
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has $N$ vertices and the subgraph has $K$ vertices, the particle becomes localized on the subgraph in $O(N/K)$ steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resources needed for a quantitative comparison of the efficiency of classical and quantum searches---the number of oracle calls.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Aharonov, Y., Davidovich, L., & Zagury, N. (1993) · Physical Review A · doi:10.1103/physreva.48.1687 · Cited by 1,622
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Quantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
Quantum Walk in Position Space with Single Optically Trapped Atoms
Karski, M., Förster, L., Choi, J.-M., Steffen, A., Alt, W., Meschede, D., & Widera, A. (2009) · Science · doi:10.1126/science.1174436 · Cited by 659
Photons Walking the Line: A Quantum Walk with Adjustable Coin Operations
Schreiber, A., Cassemiro, K. N., Potoček, V., Gábris, A., Mosley, P. J., Andersson, E., Jex, I., & Silberhorn, C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050502 · Cited by 588
Realization of Quantum Walks with Negligible Decoherence in Waveguide Lattices
Perets, H. B., Lahini, Y., Pozzi, F., Sorel, M., Morandotti, R., & Silberberg, Y. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.170506 · Cited by 526
Quantum Walk of a Trapped Ion in Phase Space
Schmitz, H., Matjeschk, R., Schneider, C., Glueckert, J., Enderlein, M., Huber, T., & Schaetz, T. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.090504 · Cited by 462
Cited by
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
A 2D Quantum Walk Simulation of Two-Particle Dynamics
Schreiber, A., Gábris, A., Rohde, P. P., Laiho, K., Štefaňák, M., Potoček, V., Hamilton, C., Jex, I., & Silberhorn, C. (2012) · Science · doi:10.1126/science.1218448 · Cited by 425
Spontaneous Parametric Down-Conversion and Quantum Walks in Arrays of Quadratic Nonlinear Waveguides
Solntsev, A. S., Sukhorukov, A. A., Neshev, D. N., & Kivshar, Y. S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.023601 · Cited by 92
Metadata
- Authors
- Hillery, M., Reitzner, D., & Bužek, V.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2010-06-17
- Volume
- 81
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1547818631
- Cited by
- 36
- References
- 16
- FWCI
- 5.78
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Searching via walking: How to find a marked clique of a complete graph using quantum walks. https://app.cochat.ai/papers/10.1103/physreva.81.062324
- The paper
- Hillery, M., Reitzner, D., & Bužek, V. (2010). Searching via walking: How to find a marked clique of a complete graph using quantum walks. Physical Review A. https://doi.org/10.1103/physreva.81.062324
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.