Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum Cryptography Security Open Quantum Systems Decoherence

Computational indistinguishability and boson sampling

arXiv

Authors: Georgios M. Nikolopoulos

Year

2022

Paper ID

57564

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a resource for cryptographic schemes, which are secure against computationally unbounded adversaries. Moreover, we define a cryptographic setting for the implementation of such schemes, including message encryption and authentication, as well as entity authentication.

Why This Paper Matters

This paper contributes to the Open Quantum Systems & Decoherence research area in the Quantum Articles archive.
It adds a 2022 reference point for readers tracking recent quantum research.
We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2211.04420 [2] arXiv https://arxiv.org/abs/2211.04420 [3] Publisher https://arxiv.org/abs/2211.04420

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.