Simulation methods for quantum walks on graphs applied to formal language recognition

DOI10.1007/S11047-014-9441-XzbMath1390.68741OpenAlexW2039278040WikidataQ62269937 ScholiaQ62269937MaRDI QIDQ1646243

Y. Aharonov

Publication date: 25 June 2018

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-014-9441-x

zbMATH Keywords

algorithmsimulationquantum walksformal language recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Quantum algorithm for Dyck language with multiple types of brackets

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect state transfer in integral circulant graphs
• Discrete quantum walks hit exponentially faster
• Universal Computation by Multiparticle Quantum Walk
• Characterizations of 1-Way Quantum Finite Automata
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• QUANTUM WALKS ON GENERAL GRAPHS
• Quantum walks in higher dimensions
• One-dimensional quantum walks
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS

This page was built for publication: Simulation methods for quantum walks on graphs applied to formal language recognition