Hypergroup structures of open quantum random walks on distance sets

2020/09/19 by Yusuke Sawada, Sawada, Yusuke
Computer Science · #FOS: Physical sciences #Mathematical Physics (math-ph) #Quantum Computing Algorithms and Architecture

paper · pdf · doi:10.48550/arxiv.2009.09166

openalex publication_date 2020/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Wildberger has introduced the method to construct a hermitian discrete hypergroup from a random walk on a graph. We will apply his method to an open quantum random walk (OQRW) on a distance set, and show that any discrete hypergroup which is not necessary hermitian is realized by an OQRW on a distance set. We will investigate distributions of OQRWs on distance sets in the view point of hypergroups.

Related

• Hypergroups derived from random walks on some infinite graphs
• Hypergroups and distance distributions of random walks on graphs
• Random Walks on Finite Quantum Groups: Diaconis-Shahshahani Theory for Quantum Groups
• Quantum walks on regular uniform hypergraphs
• The adjacency matrices and the transition matrices related to random walks on graphs