Classically time-controlled quantum automata
From MaRDI portal
Publication:6049068
DOI10.1007/978-3-030-04070-3_21zbMath1522.68264OpenAlexW2884299105MaRDI QIDQ6049068
Alejandro Díaz-Caro, Marcos Villagra
Publication date: 16 October 2023
Published in: Theory and Practice of Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-04070-3_21
quantum computingquantum finite automatabounded errorcutpoint languagetime-dependent unitary evolution
Cites Work
- One-way reversible and quantum finite automata with advice
- An application of quantum finite automata to interactive proof systems
- Quantum automata and quantum grammars
- Two-way finite automata with quantum and classical states.
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- An Introduction to Quantum Programming in Quipper
- Finite state verifiers with constant randomness
- Characterizations of 1-Way Quantum Finite Automata
- Towards a quantum programming language
- A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls
- QWIRE: a core language for quantum circuits
- A lambda calculus for quantum computation with classical control
- Quantum State Complexity of Formal Languages
This page was built for publication: Classically time-controlled quantum automata
