Spatial search by continuous-time quantum walk with multiple marked vertices

@article{Wong2016SpatialSB,
  title={Spatial search by continuous-time quantum walk with multiple marked vertices},
  author={T. Wong},
  journal={Quantum Information Processing},
  year={2016},
  volume={15},
  pages={1411-1443}
}
  • T. Wong
  • Published 2016
  • Physics, Computer Science
  • Quantum Information Processing
  • In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we analytically solve search on the “simplex of $$K_M$$KM complete graphs” with all configurations of two marked vertices, two configurations of $$M+1$$M+1 marked vertices, and two configurations of $$2(M+1)$$2(M+1) marked vertices, showing that the location of… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Adjacent Vertices Can Be Hard to Find by Quantum Walks
    4
    Engineering the success of quantum walk search using weighted graphs
    4
    Laplacian versus adjacency matrix in quantum walk search
    22
    Vertices cannot be hidden from quantum spatial search for almost all random graphs
    13
    Quantum walk search on Johnson graphs
    8

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES
    Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
    13
    Quantum Walks Can Find a Marked Element on Any Graph
    51
    Faster quantum walk search on a weighted graph
    14
    Spatial search by quantum walk
    360
    Grover Search with Lackadaisical Quantum Walks
    40
    Connectivity is a poor indicator of fast quantum search.
    38
    Quantum random-walk search algorithm
    668
    Quantum search with multiple walk steps per oracle query
    17
    Exceptional Configurations of Quantum Walks with Grover's Coin
    11