Farid Ablayev, Marat Ablayev, Alexander Vasiliev & Mansur Ziatdinov (2016):
Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects.
Baltic Journal of Modern Computing 4(4),
pp. 860–875,
doi:10.22364/bjmc.2016.4.4.17.
Miklós Ajtai, Henryk Iwaniec, János Komlós, János Pintz & Endre Szemerédi (1990):
Construction of a thin set with small Fourier coefficients.
Bulletin of the London Mathematical Society 22(6),
pp. 583–590,
doi:10.1112/blms/22.6.583.
Andris Ambainis & Nikolajs Nahimovs (2009):
Improved constructions of quantum automata.
Theoretical Computer Science 410(20),
pp. 1916–1922,
doi:10.1016/j.tcs.2009.01.027.
Andris Ambainis & Abuzer Yakaryılmaz (2021):
Automata and quantum computing.
In: Jean Éric Pin: Handbook of Automata Theory, chapter 39 2.
European Mathematical Society Publishing House,
pp. 1457–1493,
doi:10.4171/Automata-2/17.
Utku Birkan, Özlem Salehi, Viktor Olejar, Cem Nurlu & Abuzer Yakaryılmaz (2021):
Implementing Quantum Finite Automata Algorithms on Noisy Devices.
In: International Conference on Computational Science.
Springer,
pp. 3–16,
doi:10.1007/978-3-030-77980-1_1.
Harry Buhrman, Richard Cleve, John Watrous & Ronald de Wolf (2001):
Quantum Fingerprinting.
Physical Review Letters 87(16),
pp. 167902,
doi:10.1103/PhysRevLett.87.167902.
ArXiv:0102001.
Andrew W. Cross, Lev S. Bishop, Sarah Sheldon, Paul D. Nation & Jay M. Gambetta (2019):
Validating quantum computers using randomized model circuits.
Physical Review A 100,
pp. 032328,
doi:10.1103/PhysRevA.100.032328.
Martin Kālis (2018):
Kvantu Algoritmu Realizācija Fiziskā Kvantu Datorā (Quantum Algorithm Implementation on a Physical Quantum Computer).
University of Latvia.
Aliya Khadieva & Mansur Ziatdinov (2023):
Deterministic Construction of QFAs Based on the Quantum Fingerprinting Technique.
Lobachevskii Journal of Mathematics 44(2),
pp. 713–723,
doi:10.1134/S199508022302021X.
Cristopher Moore & James P Crutchfield (2000):
Quantum automata and quantum grammars.
Theoretical Computer Science 237(1-2),
pp. 275–306,
doi:10.1016/S0304-3975(98)00191-1.
Mikka Möttönen & Juha J Vartiainen (2006):
Decompositions of general quantum gates.
Trends in Quantum Computing Research,
doi:10.48550/ARXIV.QUANT-PH/0504100.
Alexander Razborov, Endre Szemerédi & Avi Wigderson (1993):
Constructing small sets that are uniform in arithmetic progressions.
Combinatorics, Probability and Computing 2(4),
pp. 513–518,
doi:10.1017/S0963548300000870.
A. C. Cem Say & Abuzer Yakaryılmaz (2014):
Quantum finite automata: A modern introduction.
In: Computing with New Resources.
Springer,
pp. 208–222,
doi:10.1007/978-3-319-13350-8_16.
Terence Tao & Van Vu (2006):
Additive combinatorics.
Cambridge Studies in Advanced Mathematics 105.
Cambridge University Press,
doi:10.1017/CBO9780511755149.
Andrew Wack, Hanhee Paik, Ali Javadi-Abhari, Petar Jurcevic, Ismael Faro, Jay M. Gambetta & Blake R. Johnson (2021):
Quality, Speed, and Scale: three key attributes to measure the performance of near-term quantum computers,
doi:10.48550/ARXIV.2110.14108.
Stephen J Wright (2015):
Coordinate descent algorithms.
Mathematical programming 151(1),
pp. 3–34,
doi:10.1007/s10107-015-0892-3.
eptcs@eptcs.org