Classical and quantum parallelism in the quantum fingerprinting method

Authors:
Farid Ablayev;Alexander Vasiliev
Affiliations:
Institute for Informatics, Kazan, Russian Federation and Kazan Federal University;Institute for Informatics, Kazan, Russian Federation and Kazan Federal University
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 6
Cited 0

Randomized algorithms

Randomized algorithms
Quantum computation and quantum information

Quantum computation and quantum information
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On Computational Power of Quantum Branching Programs

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Quantum branching programs and space-bounded nonuniform quantum complexity

Theoretical Computer Science
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus on how the classical and quantum parallelism are combined in the quantum fingerprinting technique we proposed earlier. We also show that our method can be used not only to efficiently compute Boolean functions with linear polynomial presentations but also can be adapted for the functions with nonlinear presentations of bounded "nonlinearity".