Accessing quantum secrets via local operations and classical communication
Vlad Gheorghiu, Barry C. Sanders

TL;DR
This paper introduces a quantum secret-sharing protocol that reduces the need for non-local quantum operations by embedding classical linear codes into quantum error-correcting codes, simplifying decoding.
Contribution
It presents a novel quantum secret-sharing scheme leveraging classical codes to minimize quantum communication channels, advancing decoding methods for quantum error correction.
Findings
Reduces quantum communication channels in secret-sharing
Embeds classical linear codes into quantum error-correcting codes
Simplifies quantum error-correcting code decoding
Abstract
Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. Our scheme is based on embedding a classical linear code into a quantum error-correcting code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes.
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.
