Deterministic quantum one-time pad via Fibonacci anyons

TL;DR

This paper explores a deterministic quantum one-time pad protocol using Fibonacci anyons, demonstrating how topologically robust anyonic states can be used for secure quantum communication and analyzing the maximum information transfer.

Contribution

It introduces a novel DQOTP scheme based on Fibonacci anyons and provides analytical results on maximum message capacity related to anyonic mutual information.

Findings

Fibonacci anyon pairs can asymptotically transmit 2 log2 d_τ bits of classical info.

Maximum message number exhibits a step function pattern linked to geometric simplices.

Results are explained through the concept of anyonic accessible information.

Abstract

Anyonic states, which are topologically robust originated from their peculiar structure of Hilbert space, have important applications in quantum computing and quantum communication. When an anyonic state is used as an information carrier of the deterministic quantum one-time pad (DQOTP), we find that the Fibonacci particle-antiparticle pair produced from vacuum can be used to asymptotically send $2\log_2 d_{\tau}$ bits of classical information ($d_{\tau}$ is the quantum dimension of a Fibonacci anyon $\tau$), which equals to the anyonic mutual information of the pair. Furthermore, by studying the DQOTP via a parameterized state of six Fibonacci anyons with trivial total charge, we give the analytical results of the maximum number of messages that can be sent for different parameters, which is a step function with every step corresponding to a regular simplex from the viewpoint of geometry. The results for the maximum number of messages sent by the DQOTP can be explained by the anyonic accessible information.