Quantum Protocols within Spekkens' Toy Model
Leonardo Disilvestro, Damian Markham

TL;DR
This paper explores how Spekkens' toy model can replicate quantum advantages in information protocols, suggesting that such benefits may stem from steering correlations rather than non-locality.
Contribution
It demonstrates that Spekkens' toy model can mimic quantum protocols like secret sharing and blind computation, challenging the notion that quantum advantages require non-locality.
Findings
Toy model prohibits bit-commitment
Toy model supports error correction and secret sharing
Quantum-like secure protocols are achievable in the toy model
Abstract
Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these advantages come from. The toy model developed by Spekkens [R. W. Spekkens PRA 75, 032110 (2012)] mimics many of the features of quantum mechanics, such as entanglement and no-cloning, regarded as being important in this regard, despite being a local hidden variable theory. In this work we study several protocols within Spekkens' toy model where we see it can also mimic the advantages and limitations shown in the quantum case. We first provide explicit proofs for the impossibility of toy bit-commitment and the existence of a toy error correction protocol and consequent threshold secret sharing. Then, defining a toy computational model based on the…
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.
