Quantum walk search on Johnson graphs

@article{Wong2016QuantumWS,
  title={Quantum walk search on Johnson graphs},
  author={Thomas G. Wong},
  journal={Journal of Physics A},
  year={2016},
  volume={49},
  pages={195303}
}
  • Thomas G. Wong
  • Published 2016
  • Physics, Mathematics
  • Journal of Physics A
  • The Johnson graph is defined by n symbols, where vertices are k-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, is the complete graph K n , and is the strongly regular triangular graph T n , both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that , which is the n-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for… CONTINUE READING

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES

    Connectivity is a poor indicator of fast quantum search.

    VIEW 4 EXCERPTS

    Laplacian versus adjacency matrix in quantum walk search

    VIEW 4 EXCERPTS

    Graph Isomorphism in Quasipolynomial Time

    VIEW 1 EXCERPT

    Spatial search by quantum walk

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Quantum walk algorithm for element distinctness

    • Andris Ambainis
    • Physics, Computer Science, Mathematics
    • 45th Annual IEEE Symposium on Foundations of Computer Science
    • 2003
    VIEW 1 EXCERPT