Coding Theoretic Construction of Quantum Ramp Secret Sharing
Ryutaroh Matsumoto

TL;DR
This paper presents a method to construct quantum ramp secret sharing schemes using nested linear codes, providing conditions for qualified and forbidden sets, and includes an algebraic geometric approach.
Contribution
It introduces a novel construction of quantum ramp secret sharing schemes from nested linear codes and characterizes qualified and forbidden sets.
Findings
Conditions for qualified and forbidden sets are established.
An algebraic geometric construction for quantum secret sharing is provided.
The scheme enhances understanding of quantum secret sharing with linear codes.
Abstract
We show a construction of a quantum ramp secret sharing scheme from a nested pair of linear codes. Necessary and sufficient conditions for qualified sets and forbidden sets are given in terms of combinatorial properties of nested linear codes. An algebraic geometric construction for quantum secret sharing is also given.
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 Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · graph theory and CDMA systems
