A proposed shallow quantum-fingerprinting circuit based on generalized arithmetic progressions has a core theorem that is vacuous in the bounded-error regime, leaving only heuristic numerical support.
Uchenye Zapiski Kazanskogo Universiteta
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
A proposed shallow quantum-fingerprinting circuit based on generalized arithmetic progressions has a core theorem that is vacuous in the bounded-error regime, leaving only heuristic numerical support.