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

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.

References in corpus (15)

• Quantum machine learning in feature Hilbert spaces
• Quantum Convolutional Neural Networks
• Universal computation by quantum walk
• Quantum walks: a comprehensive review
• Data re-uploading for a universal quantum classifier
• Universal quantum computation using the discrete time quantum walk
• Implementing a distance-based classifier with a quantum interference circuit
• Open Quantum Random Walks
• Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
• Limit theorems for open quantum random walks
• On a class of quantum channels, open random walks and recurrence
• A steady state quantum classifier
• Classifying quantum data by dissipation
• Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
• Dynamics and computation in linear open quantum walks