Deterministic quantum one-time pad via Fibonacci anyons

Abstract

Anyonic states, which are topologically robust because of their peculiar structure of Hilbert space, have important applications in quantum computing and quantum communication. Here we investigate the capacity of the deterministic quantum one-time pad (DQOTP) that uses Fibonacci anyons as an information carrier. We find that the Fibonacci particle-antiparticle pair produced from vacuum can be used to asymptotically send $2{log}_{2}{d}_{\ensuremath{\tau}}$ bits of classical information (${d}_{\ensuremath{\tau}}$ is the quantum dimension of a Fibonacci anyon $\ensuremath{\tau}$), which equals 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 anyonic accessible information.