A quantum searching model finding one of the edges of a subgraph in a complete graph

DOI10.1007/s11128-022-03553-2OpenAlexW4221140899MaRDI QIDQ2101204

Kiyoto Yoshino, Yusuke Yoshie

Publication date: 5 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.01464

zbMATH Keywords

random walksigned graphquantum walkquantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some bounds on the largest eigenvalues of graphs
• Spectral and asymptotic properties of Grover walks on crystal lattices
• Spectra of graphs
• A bound on the spectral radius of graphs
• From quantum cellular automata to quantum lattice gases
• Partition-based discrete-time quantum walks
• Quantum search on simplicial complexes
• On the notion of balance of a signed graph
• Quantum search of matching on signed graphs
• Spatial quantum search in a triangular network
• FUZZY PROBABILITY THEORY
• Quantum Algorithms for the Triangle Problem
• Quantum Walk Algorithm for Element Distinctness
• Quantum walks and search algorithms

This page was built for publication: A quantum searching model finding one of the edges of a subgraph in a complete graph