"Quantum hashing and fingerprinting for quantum cryptography and computations"

https://www.youtube.com/watch?v=7X3n7OiV7tg&feature=youtu.be

https://www.youtube.com/watch?v=7X3n7OiV7tg&feature=youtu.be

Quantum hashing and Fourier transform

Quantum Hashing via Fourier Transform

Нижние оценки и Иерархии для Квантовых коммуникационных протоколов без памяти и квантовых kOBDD

We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The ``memoryless'' term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the op

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test Farid Ablayev, Andris Ambainis, Kamil Khadiev, Aliya Khadieva

Квантовый блокчейн

Quantum Hashing via Fourier Transform

QUANTUM HASHING

In the talk we consider a quantum hash function construction based on epsilon-biased sets. Such a function hashes elements of finite field F_q into the s-qubit quantum states.

New families of quantum hash functions

Quantum hashing via Fourier transform

Модель программируемого квантового вычислителя

Farid Ablayev and Marat Ablayev. Branching Program Complexity of Quantum Hashing

We explicitly defined a notion of quantum hashing as a generalization of classical hashing and presented examples of quantum hash functions. It appeared that Gottesman-Chuang quantum signature schemes [4] are based on functions which are actually quantum hash functions.

Метод квантового хеширования

Resistance Analysis for Quantum Hashing

Model of a quantum processing device and a quantum programming framework

Quantum Fingerprinting and Quantum Hashing

Modelling and simulation of a programmable quantum processing device

The Concept of Cryptographic Quantum Hashing and Quantum Hashing Constructions

Работы по информационной безопасности в КФУ на основе квантовых технологий

Квантовое криптографическое хеширование

Quantum Cryptographic Hashing.

On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs

The paper examines hierarchies for nondeterministic and deterministic ordered read-k-times Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching programs for k=o(n^{1/2}/\log^{3/2}n) are proved by B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener in 1998.

On Quantum Fingerprinting and Quantum Hashing

We present examples and discussion that supports the idea of quantum hashing from [1, 2]. 1. F. Ablayev and A. Vasiliev, Laser Phys. Lett. 11, (2):025202 (2013) 2. F. Ablayev and M. Ablayev, Laser Phys. Lett. 12 125204 (2015)

Quantum hashing via epsilon-universal hashing constructions

Quantum Hashing via E-Universal Hashing Constructions

Quantum Hashing and Its Applications

Very narrow quantum OBDDs and width hierarchies for classical OBDDs

We present several results on comparative complexity for different variants of OBDD models. - results on comparative complexity of classical and quantum OBDDs -quantum and classical nondeterminism -new hierarchies on widths of deterministic and non- deterministic OBDDs

Quantum Hashing via Classical Universal Hashing and Quantum Digital Signature

1. Quantum Hashing and Its Applications 2. Quantum computer on multi-atomic ensembles in the common QED cavity

Квантовое хеширование

Quantum Fingerprinting for Quantum Branching Programs

Квантовые информационные технологии.

Презентация проекта "Математика и физика квантовых компьютеров"

On the computation of Boolean functions by quantum branching programs

A Communication Approach to the Superposition Problem

F. Ablayev, Fingerprinting based algorithms for quantum branching programs