Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1401.6658 · Quantum Information Processing

Efficiency of open quantum walk implementation of dissipative quantum computing algorithms

Ilya Sinayskiy, Francesco Petruccione

Published May 31, 2012• 43 citations
arXivHTMLPDF
DOI
10.1007/s11128-012-0426-3

Related papers

Open Quantum Walks and Dissipative Quantum Computing

Francesco Petruccione

Bulletin of the American Physical Society•Feb 28, 2012•0 citations

Open Quantum Random Walks on Graphs

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.

•Jan 1, 2012•1 citation

Dissipative quantum computing with open quantum walks

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.

AIP conference proceedings•Jan 1, 2014•4 citations

Quantum computation and quantum-state engineering driven by dissipation

Frank Verstraete, Michael M. Wolf, J. I. Cirac

Nature Physics•Jul 20, 2009•1,568 citations

Algorithms of quantum computation

Shinil Cho

Institute of Physics eBooks•Jul 1, 2022•7 citations

Dissipative realization of a quantum distance-based classifier using open quantum walks

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.

quant-pharXiv:2603.16010•Entropy•Mar 18, 2026•1 citation
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.