A quantum searching model finding one of the edges of a subgraph in a complete graph
type: Item
instance of: scholarly article
title: A quantum searching model finding one of the edges of a subgraph in a complete graph
author: Yusuke Yoshie
author: Kiyoto Yoshino
published in: Quantum Information Processing
publication date: 2022-12-05T00:00:00Z
full work available at URL: https://arxiv.org/abs/2202.01464
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7626409
zbMATH Keywords: quantum search
zbMATH Keywords: quantum walk
zbMATH Keywords: signed graph
zbMATH Keywords: random walk
MaRDI profile type: Publication
OpenAlex ID: W4221140899
cites work: Spatial quantum search in a triangular network
cites work: Quantum Walk Algorithm for Element Distinctness
cites work: Coins make quantum walks faster
cites work: Spectra of graphs
cites work: Q5200147
cites work: Q4228473
cites work: FUZZY PROBABILITY THEORY
cites work: On the notion of balance of a signed graph
cites work: Spectral and asymptotic properties of Grover walks on crystal lattices
cites work: Partition-based discrete-time quantum walks
cites work: Some bounds on the largest eigenvalues of graphs
cites work: Quantum Algorithms for the Triangle Problem
cites work: Quantum search on simplicial complexes
cites work: From quantum cellular automata to quantum lattice gases
cites work: Quantum walks and search algorithms
cites work: Quantum search of matching on signed graphs
cites work: A bound on the spectral radius of graphs
DOI: 10.1007/S11128-022-03553-2
description: scientific article; zbMATH DE number 7626409