Deterministic construction of QFAs based on the quantum fingerprinting technique
From MaRDI portal
Publication:6043928
DOI10.1134/s199508022302021xarXiv2212.14442OpenAlexW4377234973MaRDI QIDQ6043928
Aliya Khadieva, Mansur Ziatdinov
Publication date: 25 May 2023
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.14442
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State succinctness of two-way finite automata with quantum and classical states
- Superiority of exact quantum automata for promise problems
- Exponential separation of quantum and classical online space complexity
- Error-free affine, unitary, and probabilistic OBDDs
- Improved constructions of quantum automata
- Exact results for accepting probabilities of quantum automata.
- Quantum automata and quantum grammars
- Unary probabilistic and quantum automata on promise problems
- Quantum algorithms for string processing
- Quantum online streaming algorithms with logarithmic memory
- Automata and quantum computing
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs
- Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
- Algebraic results on quantum automata
- On the computational power of probabilistic and quantum branching program
- On quantum realisation of Boolean functions by the fingerprinting technique
- Construction of a Thin Set with small Fourier Coefficients
- Branching Programs and Binary Decision Diagrams
- Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
- Developments in Language Theory
- Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
- Improved Constructions of Quantum Automata
- Classical and Quantum Computations with Restricted Memory
- Error-Free Affine, Unitary, and Probabilistic OBDDs
This page was built for publication: Deterministic construction of QFAs based on the quantum fingerprinting technique
