A quantum hash function with grouped coarse-grained boson sampling

Boson sampling (BS) is an elegant candidate for the proof of quantum supremacy, and the exploration of its practical cryptographic applications is just at the beginning, including one-way functions, private-key cryptography and quantum signature. In order to investigate improvement methods for the combination of cryptography and BS, we propose a quantum hash function with grouped coarse-grained boson sampling (GCGBS) by making full use of the multi-photon characteristics of BS with undiluted conditions, which can eliminate the uncertain outputs, achieve repeatability and reduce the difficulty of experiment. The theoretical analysis and numerical simulation demonstrate an irreversible, anti-collision, anti-brute force search and uniform-distributed GCGBS-based hash function can be achieved with limited resource-consumption.

Automated summary

This paper proposes a quantum hash function based on grouped coarse-grained boson sampling, which utilizes the multi-photon characteristics of boson sampling to reduce experimental difficulty while ensuring result determinacy.