Simulation methods for quantum walks on graphs applied to formal language recognition
From MaRDI portal
(Redirected from Publication:1646243)
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2019633 (Why is no real title available?)
- Characterizations of 1-Way Quantum Finite Automata
- Discrete quantum walks hit exponentially faster
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- One-dimensional quantum walks
- PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
- Perfect state transfer in integral circulant graphs
- QUANTUM WALKS ON GENERAL GRAPHS
- Quantum walks in higher dimensions
- Quantum walks on directed graphs
- Universal computation by multiparticle quantum walk
Cited in
(6)- \textsc{QSWalk.jl}: Julia package for quantum stochastic walks analysis
- Quantum algorithm for Dyck language with multiple types of brackets
- \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers
- A method for exact simulation of quantum dynamics
- The QWalk simulator of quantum walks
- The expressive power of quantum walks in terms of language acceptance
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)