# 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} }

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

5

Twitter Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk

VIEW 1 EXCERPT

CITES BACKGROUND

## Quantum walk search on Kronecker graphs

VIEW 1 EXCERPT

CITES METHODS

## Equivalence of Szegedy’s and coined quantum walks

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 19 REFERENCES

## Faster quantum walk search on a weighted graph

VIEW 5 EXCERPTS

## Connectivity is a poor indicator of fast quantum search.

VIEW 4 EXCERPTS

## Global symmetry is unnecessary for fast quantum search

VIEW 7 EXCERPTS

## Laplacian versus adjacency matrix in quantum walk search

VIEW 4 EXCERPTS

## Grover search with lackadaisical quantum walks

VIEW 1 EXCERPT

## Graph Isomorphism in Quasipolynomial Time

VIEW 1 EXCERPT

## Spatial search by quantum walk

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Quantum walk algorithm for element distinctness

VIEW 1 EXCERPT