Improved Constructions of Quantum Automata

DOI10.1007/978-3-540-89304-2_5zbMath1162.68468arXiv0805.1686OpenAlexW2184879887MaRDI QIDQ5503296

Nikolajs Nahimovs, Andris Ambainis

Publication date: 13 January 2009

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.1686

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (5)

Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique ⋮ On quantum realisation of Boolean functions by the fingerprinting technique ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Analysis of properties of quantum hashing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum automata and quantum grammars
• Estimates on exponential sums related to the Diffie-Hellman distributions
• Construction of a Thin Set with small Fourier Coefficients
• Dense quantum coding and quantum finite automata
• Constructing Small Sets that are Uniform in Arithmetic Progressions

This page was built for publication: Improved Constructions of Quantum Automata