Simulation methods for quantum walks on graphs applied to formal language recognition
DOI10.1007/S11047-014-9441-XzbMATH Open1390.68741OpenAlexW2039278040WikidataQ62269937 ScholiaQ62269937MaRDI QIDQ1646243FDOQ1646243
Authors: 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
Recommendations
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete quantum walks hit exponentially faster
- One-dimensional quantum walks
- QUANTUM WALKS ON GENERAL GRAPHS
- Title not available (Why is that?)
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
- Universal computation by multiparticle quantum walk
- Characterizations of 1-Way Quantum Finite Automata
- Perfect state transfer in integral circulant graphs
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Quantum walks in higher dimensions
- Quantum walks on directed graphs
Cited In (6)
- \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis
- Quantum algorithm for Dyck language with multiple types of brackets
- A method for exact simulation of quantum dynamics
- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- The QWalk simulator of quantum walks
- The expressive power of quantum walks in terms of language acceptance
Uses Software
This page was built for publication: Simulation methods for quantum walks on graphs applied to formal language recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646243)
