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

TL;DR

This paper demonstrates implementing a quantum distance-based classifier using open quantum walks, showing that the approach is feasible and maintains finite expected runtime even under slower conditions.

Contribution

It introduces a method to realize a quantum classifier within the open quantum walk framework, expanding the application of dissipative quantum computation.

Findings

Feasibility of implementing the classifier with open quantum walks

Expected runtime remains finite in slower regimes

Supports dissipative quantum computation models

Abstract

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.