Papers
Topics
Authors
Recent
2000 character limit reached

Open Quantum Walks on Graphs (1401.3305v1)

Published 14 Jan 2014 in quant-ph

Abstract: Open quantum walks (OQW) are formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and for dissipative quantum state preparation. In particular, single qubit gates and the CNOT-gate are implemented as OQWs on fully connected graphs. Also, dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell-states is demonstrated. Finally, the discrete time version of dissipative quantum computing is shown to be more efficient if formulated in the language of OQWs.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.