Deterministic quantum one-time pad via Fibonacci anyons
- URL: http://arxiv.org/abs/2104.05911v2
- Date: Sat, 21 Aug 2021 12:44:36 GMT
- Title: Deterministic quantum one-time pad via Fibonacci anyons
- Authors: Cheng-Qian Xu, D. L. Zhou
- Abstract summary: An anyonic state is used as an information carrier of the deterministic quantum one-time Hilbert pad (DQOTP)
We study the DQOTP via a parameterized state of six Fibonacci anyons with trivial total charge.
The results for the maximum number of messages sent by the DQOTP can be explained by the anyonic information.
- Score: 11.59961756146332
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.
We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.
We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z) - Absolute dimensionality of quantum ensembles [41.94295877935867]
The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis.
We propose an absolute, i.e.basis-independent, notion of dimensionality for ensembles of quantum states.
arXiv Detail & Related papers (2024-09-03T09:54:15Z) - Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold.
The established relation can be applied to various quantum optimization problems.
arXiv Detail & Related papers (2024-08-19T09:15:54Z) - Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials [0.0]
We introduce a scalable dynamical string-net preparation (DSNP) approach, suitable even for near-term quantum processors.
DSNP enables the creation and manipulation of the Fibonacci string-net condensate (Fib-SNC)
We measure anyon charges for two species of anyons associated with the doubled topological quantum field theory underlying Fid-SNC.
Our results establish the first proof of principle that scalable DSNP can open doors to fault-tolerant universal quantum computation.
arXiv Detail & Related papers (2024-06-18T17:38:07Z) - Diagonal Coset Approach to Topological Quantum Computation with Fibonacci Anyons [0.0]
We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons.
The quantum gates are realized by braiding of these anyons.
arXiv Detail & Related papers (2024-04-02T09:44:02Z) - Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices.
Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured.
We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
arXiv Detail & Related papers (2023-06-15T18:23:55Z) - Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
We investigate properties of entanglement and its role for quantum communication.
For transformations between bipartite pure states, we prove the existence of a universal catalyst.
We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
arXiv Detail & Related papers (2022-02-10T18:36:25Z) - Geometric Probabilities and Fibonacci Numbers for Maximally Random
n-Qubit Quantum Information States [0.0]
We show that quantum probabilities can be calculated by means of geometric probabilities.
The Golden ratio of probabilities and the limit of n going to infinity are discussed.
arXiv Detail & Related papers (2021-10-26T11:50:54Z) - Multi-parameter quantum metrology with discrete-time quantum walks [0.0]
We use the quantum walker as a probe for unknown parameters encoded on its coin degrees of freedom.
We apply our findings to relevant case studies, including the simultaneous estimation of charge and mass in the discretized Dirac model.
arXiv Detail & Related papers (2021-10-05T13:25:32Z) - On the properties of the asymptotic incompatibility measure in
multiparameter quantum estimation [62.997667081978825]
Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds.
We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
arXiv Detail & Related papers (2021-07-28T15:16:37Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.