Discrete-time quantum walks as generators of multipartite entanglement
classification
🪐 quant-ph
keywords
quantumallowingdiscrete-timeentanglementgeneratesmultipartitequbitqubits
read the original abstract
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time step between the walker and the vertex qubits generates multipartite entanglement between the qubits. We demonstrate that for particular coin operators the system generates a highly entangled cluster state, of use in measurement based quantum computation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.