Single-qubit unitary gates by graph scattering
arXiv:1111.5032 · doi:10.1103/PhysRevA.84.062302
Abstract
We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite tails are attached at arbitrary points of a given graph, representing the input and output registers of a single qubit. For a range of momentum eigenstates, we enumerate all of the graphs with up to vertices for which the scattering implements a single-qubit gate. As increases, the number of new unitary operations increases exponentially, and for the majority correspond to rotations about axes distributed roughly uniformly across the Bloch sphere. Rotations by both rational and irrational multiples of are found.
arXiv comment8 pages, 7 figures
References in corpus (10)
- Quantum random walks - an introductory overview
- Universal computation by quantum walk
- Universal quantum computation using the discrete time quantum walk
- Decoherence in quantum walks - a review
- Introduction to Quantum Computation
- Universal quantum computation by discontinuous quantum walk
- Discrete-query quantum algorithm for NAND trees
- Quantum Online Memory Checking
- On the security and degradability of Gaussian channels
- Quantum scattering theory on graphs with tails