Work

Computing quantum hashing in the model of quantum branching programs

Year: 2018

Type: conference-paper

Abstract: We investigate the branching program complexity of quantum hashing. We consider a quantum hash function that maps elements of a finite field into quantum states. We require that this function is preimage-resistant and collision-resistant.We consider two complexity measures for Quantum Branching Programs (QBP): a number of qubits and a number of compu-tational steps. We show that the quantum hash function can be computed efficiently. Moreover, we prove that such QBP construction is optimal. That is, we prove lower bounds that match the constructed quantum hash function computation.

Source: AIP conference proceedings

DOI: 10.1063/1.5025458

Authors: Farid Ablayev, Marat Ablayev, Alexander Vasiliev

Institution: Kazan Federal University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: Russian Foundation for Basic Research, Kazan Federal University

OpenAlex ID: W2791224451

FWCI:

Cites: 12

Cited by: 3

Related to: 10