Grover's algorithm based multi-qubit secret sharing scheme
Arti Chamoli, C. M. Bhandari

TL;DR
This paper introduces a quantum multi-qubit secret sharing scheme utilizing Grover's search algorithm, extending from four qubits to an arbitrary n-qubit system, leveraging quantum parallelism and entanglement.
Contribution
It proposes a novel secret sharing protocol based on Grover's algorithm, generalizing previous schemes to n-qubits for enhanced quantum security.
Findings
Scheme demonstrated for four qubits with multiple marked states
Generalized to n-qubits for broader applicability
Utilizes quantum parallelism and entanglement for security
Abstract
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific to the nature and need of a situation. Following Hsu's proposed scheme we propose a secret sharing scheme using Grover's search algorithm for a four qubit system with several marked states. Further, the scheme has been generalised to an n-qubit syatem.
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 Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
