S. Aaronson (2005):
Limitations of Quantum Advice and One-Way Communication.
Theory of Computing 1,
pp. 1–28,
doi:10.4086/toc.2005.v001a004.
J. Barrett (2007):
Information processing in generalized probabilistic theories.
Phys. Rev. A 75(032304),
doi:10.1103/physreva.75.032304.
G. Brassard, H. Buhrman, N. Linden, A. A. Methot, A. Tapp & F. Unger (2006):
Information processing in generalized probabilistic theories.
Phys. Rev. Lett 96(250401),
doi:10.1103/physrevlett.96.250401.
H. Buhrman, R. Cleve, S. Massar & R. de Wolf (2010):
Nonlocality and communication complexity.
Rev. Mod. Phys. 82,
pp. 665,
doi:10.1103/RevModPhys.82.665.
G. Chiribella, G. M. D'Ariano & P. Perinotti (2010):
Probabilistic theories with purification.
Phys. Rev. A 81(062348),
doi:10.1103/physreva.81.062348.
G. Chiribella, G. M. D'Ariano & P. Perinotti (2011):
Informational derivation of Quantum Theory.
Phys. Rev. A 84(012311),
doi:10.1103/physreva.84.012311.
R. Cleve, W. van Dam, M. Nielsen & Alain Tapp (1998):
Quantum Entanglement and the Communication Complexity of the Inner Product Function.
Lecture Notes Computer Science 1509,
pp. 61–74,
doi:10.1016/j.tcs.2012.12.012.
W. van Dam (2013):
Implausible consequences of superstrong nonlocality.
Nat. Comp. 12(1),
pp. 9–12,
doi:10.1007/s11047-012-9353-6.
G. D'Ariano, F. Manessi & P. Perinotti (2014):
Determinism without causality.
Phys. Scripta 2014(T163),
doi:10.1088/0031-8949/2014/T163/014013.
S. Fiorini, S. Massar, M. K. Patra & H. R. Tiwary (2013):
Generalised probabilistic theories and conic extensions of polytopes.
Available at http://arxiv.org/abs/1310.4125.
D. Gross, M. Mueller, R. Colbeck & O. Dahlsten (2010):
Information processing in generalized probabilistic theories.
Phys. Rev. Lett. 104(080402),
doi:10.1103/physrevlett.104.080402.
A. S. Holevo (1973):
Bounds for the quantity of information transmitted by a quantum communication channel.
Problems of Information Transmission 9,
pp. 177–183.
C. M. Lee & J. Barrett (2015):
Computation in generalised probabilistic theories.
New Journal of Physics 17(083001),
doi:10.1088/1367-2630/17/8/083001.
C. M. Lee & M. J. Hoban (2016):
Bounds on the power of proofs and advice in general physical theories.
Proc. Royal Soc. A 472(2190),
doi:10.1098/rspa.2016.0076.
J. Barrett M. F. Pusey & T. Rudolph (2012):
On the reality of the quantum state.
Nature Physics 8,
pp. 475,
doi:10.1038/nphys2309.
S. Massar & M. K. Patra (2014):
Information and communication in polygon theories.
Phys. Rev. A 89(052124),
doi:10.1103/physreva.89.052124.
M. Mueller & C. Ududec (2012):
The structure of reversible computation determines the self-duality of quantum theory.
Phys. Rev. Lett. 108(130401),
doi:10.1103/physrevlett.108.130401.
M. Navascués, Y. Guryanova, M. J. Hoban & A. Acín (2015):
Almost quantum correlations.
Nature Communications 6(6288),
doi:10.1038/ncomms7288.
H. Nishimura & T. Yamakami (2003):
Polynomial time quantum computation with advice.
Electronic Colloquium on Computational Complexity TR03-059,
doi:10.1016/j.ipl.2004.02.005.
S. Popescu (2014):
Nonlocality beyond quantum mechanics.
Nature Physics 10,
pp. 264–270,
doi:10.1038/nphys2916.
S. Popescu & D. Rohrlich (1994):
Quantum nonlocality as an axiom.
Found. Phys. 24(3),
pp. 379–385,
doi:10.1007/BF02058098.
O. Regev & B. Klartag (2011):
Quantum one-way communication can be exponentially stronger than classical communication.
Proc. of the Forty-third Annual ACM Symposium on Theory of Computing (STOC 2011),
pp. 31–40,
doi:10.1145/1993636.1993642.
P. Shor (1997):
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
SIAM J. Sci. Statist. Comput. 26,
pp. 1484,
doi:10.1137/s0036144598347011.
A. J. Short & J. Barrett (2010):
Strong nonlocality: A trade-off between states and measurements.
New Journal of Physics 12(033034),
doi:10.1088/1367-2630/12/3/033034.
eptcs@eptcs.org