Quantum ramp secret sharing from Haar scrambling
Kiran Adhikari

TL;DR
This paper establishes an equivalence between Haar scrambling and quantum secret sharing, revealing a ramp secret-sharing scheme that can be efficiently implemented and has applications in quantum cryptography, distributed networks, and fundamental physics.
Contribution
It demonstrates the equivalence between Haar scrambling and quantum secret sharing, leading to a new ramp secret-sharing scheme with broad applications.
Findings
Haar scrambling is equivalent to a ramp secret-sharing scheme.
Varying initial state purity yields different secret-sharing types.
The protocol can be efficiently implemented in polynomial time.
Abstract
Quantum information scrambling has emerged as a powerful tool for studying the dynamics of chaotic quantum many-body systems, assessing benchmarking protocols, and even investigating exotic black hole models. During quantum information scrambling, localized quantum information disperses across the entire system, hiding from the observers who can only access part of it. On the other side, we have a fundamental cryptographic primitive called secret-sharing schemes, where a dealer shares a quantum secret with a group of parties, such that any subset of parties above a specific threshold size can reconstruct it. In this paper, we demonstrate that two protocols, Haar scrambling, which serves as a baseline for other scrambling techniques, and quantum secret sharing, are indeed equivalent. The scheme one gets out of this is of a ramp secret-sharing nature rather than a threshold scheme. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Cryptography and Data Security
