Open Quantum Walks and Dissipative Quantum Computing

Ilya Sinayskiy, Francesco Petruccione

Francesco Petruccione, Ilya Sinayskiy

Recently, open quantum walks (OQW) have been 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.

Kendon

Ilya Sinayskiy, Francesco Petruccione

An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented.The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.

Stéphane Attal, Francesco Petruccione, Ilya Sinayskiy

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.

Pedro Linck, Graeme Pleasance, Francesco Petruccione +1 more

Open quantum walks (OQWs) constitute a class of quantum walks whose dynamics are entirely driven by interactions with the environment. It is well known that OQWs provide a general framework for implementing dissipative quantum computation. In this work, we demonstrate the feasibility of running the previously proposed quantum distance-based classifier within the open quantum walk computation model, and we show that its expected runtime remains finite even in the slower regime.