Papers
Topics
Authors
Recent
2000 character limit reached

Deterministic quantum one-time pad via Fibonacci anyons (2104.05911v2)

Published 13 Apr 2021 in quant-ph

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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.