AIP conference proceedings

Dissipative quantum computing with open quantum walks

Ilya Sinayskiy, Francesco Petruccione

Published Jan 1, 2014• 4 citations

Abstract

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.

DOI: 10.1063/1.4903132

Related papers

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, 20121 citation

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.16010EntropyMar 18, 20261 citation

Open Quantum Walks as a Tool for Dissipative Quantum Computing

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.

Research in Optical SciencesJan 1, 20120 citations

Efficiency of open quantum walk implementation of dissipative quantum computing algorithms

Ilya Sinayskiy, Francesco Petruccione

arXiv:1401.6658Quantum Information ProcessingMay 31, 201243 citations

Quantum Walk Computing: Theory, Implementation, and Application

Xiaogang Qiang, Shixin Ma, Haijing Song

The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.

arXiv:2404.04178Intelligent ComputingJan 1, 202455 citations

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs

Prateek Chawla, Shivani Singh, Aman Agarwal +2 more

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.

arXiv:2004.05956Scientific ReportsJul 26, 202312 citations