Quantum Protocols within Spekkens' Toy Model
arXiv:1608.09012 · doi:10.1103/PhysRevA.95.052324
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 quantum one-way computer we prove the existence of blind and verified protocols. Importantly, these two last quantum protocols are known to achieve a better-than-classical security. Our results suggest that such quantum improvements need not arise from any Bell-type non locality or contextuality, but rather as a consequence of steering correlations.
arXiv comment25 pages, 3 figures; Several changes from previous version, overall readability and structure improved. Many notation issues and typos fixed
References in corpus (22)
- Gaussian Quantum Information
- Improved Simulation of Stabilizer Circuits
- How to share a quantum secret
- One-sided Device-Independent Quantum Key Distribution: Security, feasibility, and the connection with steering
- Unconditionally secure quantum bit commitment is impossible
- In defense of the epistemic view of quantum states: a toy theory
- Informational derivation of Quantum Theory
- Contextuality supplies the magic for quantum computation
- Is Quantum Bit Commitment Really Possible?
- Contextuality in Measurement-based Quantum Computation
- Quasi-quantization: classical statistical theories with an epistemic restriction
- Quantum from principles
- The completeness of quantum theory for predicting measurement outcomes
- Introduction to the book "Quantum Theory: Informational Foundations and Foils"
- Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Phase groups and the origin of non-locality for qubits
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Strong no-go theorem for Gaussian quantum bit commitment
- Stabilizer notation for Spekkens' toy theory
- A complete graphical calculus for Spekkens' toy bit theory
Cited by in corpus (14)
- Verification of quantum computation: An overview of existing approaches
- Why interference phenomena do not capture the essence of quantum theory
- Introducing the Qplex: A Novel Arena for Quantum Theory
- Ruling out higher-order interference from purity principles
- Oracles and query lower bounds in generalised probabilistic theories
- Spekkens' toy model in all dimensions and its relationship with stabilizer quantum mechanics
- Fully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem
- Is the SIC Outcome There When Nobody Looks?
- Quantum bit commitment and the reality of the quantum state
- A consolidating review of Spekkens' toy theory
- Categorical Quantum Dynamics
- An optical implementation of quantum bit commitment using infinite-dimensional systems
- A hierarchy in Majorana non-abelian tests and hidden variable models
- A classical groupoid model for quantum networks