Scott Aaronson & Alex Arkhipov (2011):
The computational complexity of linear optics.
In: Proceedings of the forty-third annual ACM symposium on Theory of computing.
ACM,
pp. 333–342,
doi:10.1145/1993636.1993682.
Panos Aliferis, Frederico Brito, David P DiVincenzo, John Preskill, Matthias Steffen & Barbara M Terhal (2009):
Fault-tolerant computing with biased-noise superconducting qubits: a case study.
New Journal of Physics 11(1),
pp. 013061,
doi:10.1088/1367-2630/11/1/013061.
Stephen D Bartlett, Terry Rudolph & Robert W Spekkens (2012):
Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction.
Physical Review A 86(1),
pp. 012103,
doi:10.1103/PhysRevA.86.012103.
Stephen D Bartlett, Barry C Sanders, Samuel L Braunstein & Kae Nemoto (2002):
Efficient classical simulation of continuous variable quantum information processes.
Physical Review Letters 88(9),
pp. 097904,
doi:10.1103/PhysRevLett.88.097904.
Charles H Bennett & Gilles Brassard (1984):
Quantum cryptography: Public key distribution and coin tossing.
In: Proceedings of the IEEE International Conference on Computers Systems and Signal Processing, 1984,
pp. 175–179.
Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf & Jens Eisert (2017):
Architectures for quantum simulation showing quantum supremacy.
arXiv preprint arXiv:1703.00466.
Michael J Bremner, Richard Jozsa & Dan J Shepherd (2010):
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences.
The Royal Society,
pp. rspa20100301,
doi:10.1098/rspa.2010.0301.
Michael J Bremner, Ashley Montanaro & Dan J Shepherd (2016):
Average-case complexity versus approximate simulation of commuting quantum computations.
Physical review letters 117(8),
pp. 080501,
doi:10.1103/PhysRevLett.117.080501.
MJ Bremner, A Montanaro & DJ Shepherd (2017):
Achieving quantum supremacy with sparse and noisy commuting quantum computations.
Quantum,
doi:10.22331/q-2017-04-25-8.
Anne Broadbent, Joseph Fitzsimons & Elham Kashefi (2009):
Universal blind quantum computation.
In: Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium on.
IEEE,
pp. 517–526,
doi:10.1109/FOCS.2009.36.
Vincent Danos & Elham Kashefi (2006):
Determinism in the one-way model.
Physical Review A 74(5),
pp. 052310,
doi:10.1103/PhysRevA.74.052310.
Vincent Danos, Elham Kashefi & Prakash Panangaden (2007):
The measurement calculus.
Journal of the ACM (JACM) 54(2),
pp. 8,
doi:10.1145/1219092.1219096.
Vedran Dunjko, Joseph F Fitzsimons, Christopher Portmann & Renato Renner (2014):
Composable security of delegated quantum computation.
In: International Conference on the Theory and Application of Cryptology and Information Security.
Springer,
pp. 406–425,
doi:10.1007/978-3-662-45608-8_22.
Artur K Ekert (1991):
Quantum cryptography based on Bell’s theorem.
Physical review letters 67(6),
pp. 661,
doi:10.1103/PhysRevLett.67.661.
Richard P Feynman (1982):
Simulating physics with computers.
International journal of theoretical physics 21(6),
pp. 467–488,
doi:10.1007/BF02650179.
Joseph F. Fitzsimons & Elham Kashefi (2017):
Unconditionally verifiable blind quantum computation.
Phys. Rev. A 96,
pp. 012303,
doi:10.1103/PhysRevA.96.012303.
Xun Gao, Sheng-Tao Wang & L-M Duan (2017):
Quantum supremacy for simulating a translation-invariant Ising spin model.
Physical Review Letters 118(4),
pp. 040502,
doi:10.1103/PhysRevLett.118.040502.
Bryan T Gard, Keith R Motes, Jonathan P Olson, Peter P Rohde & Jonathan P Dowling (2015):
An introduction to boson-sampling.
From atomic to mesoscale: The role of quantum coherence in systems of various complexities. World Scientific Publishing Co. Pte. Ltd,
pp. 167–92,
doi:10.1142/9789814678704_0008.
IM Georgescu, S Ashhab & Franco Nori (2014):
Quantum simulation.
Reviews of Modern Physics 86(1),
pp. 153,
doi:10.1103/RevModPhys.86.153.
Lov K Grover (1996):
A fast quantum mechanical algorithm for database search.
In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing.
ACM,
pp. 212–219,
doi:10.1145/237814.237866.
Marc Hein, Jens Eisert & Hans J Briegel (2004):
Multiparty entanglement in graph states.
Physical Review A 69(6),
pp. 062311,
doi:10.1103/PhysRevA.69.062311.
Matty J Hoban, Joel J Wallman, Hussain Anwar, Naïri Usher, Robert Raussendorf & Dan E Browne (2014):
Measurement-based classical computation.
Physical review letters 112(14),
pp. 140505,
doi:10.1103/PhysRevLett.112.140505.
Theodoros Kapourniotis & Animesh Datta (2017):
Nonadaptive fault-tolerant verification of quantum supremacy with noise.
arXiv preprint arXiv:1703.09568.
Elham Kashefi & Petros Wallden (2017):
Optimised resource construction for verifiable quantum computation.
Journal of Physics A: Mathematical and Theoretical 50(14),
pp. 145306,
doi:10.1088/1751-8121/aa5dac.
Emanuel Knill & Raymond Laflamme (1998):
Power of one bit of quantum information.
Physical Review Letters 81(25),
pp. 5672,
doi:10.1103/PhysRevLett.81.5672.
Ueli Maurer & Renato Renner (2011):
Abstract cryptography.
In: In Innovations in Computer Science,
pp. 1–21.
Daniel Mills, Anna Pappa, Theodoros Kapourniotis & Elham Kashefi (2017):
Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation.
arXiv preprint arXiv:1704.01998.
Tomoyuki Morimae, Keisuke Fujii & Joseph F Fitzsimons (2014):
Hardness of classically simulating the one-clean-qubit model.
Physical review letters 112(13),
pp. 130502,
doi:10.1103/PhysRevLett.112.130502.
Maarten Van den Nest, Wolfgang Dür & Hans J Briegel (2008):
Completeness of the classical 2D Ising model and universal quantum computation.
Physical review letters 100(11),
pp. 110501,
doi:10.1103/PhysRevLett.100.110501.
Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston, Patrick M Birchall, Ashley Montanaro & Anthony Laing (2017):
No imminent quantum supremacy by boson sampling.
arXiv preprint arXiv:1705.00686.
James G Oxley (2006):
Matroid theory 3.
Oxford University Press, USA.
Christopher Portmann & Renato Renner (2014):
Cryptographic security of quantum key distribution.
arXiv preprint arXiv:1409.3525.
John Preskill (2012):
Quantum computing and the entanglement frontier.
arXiv preprint arXiv:1203.5813.
Robert Raussendorf & Hans J Briegel (2001):
A one-way quantum computer.
Physical Review Letters 86(22),
pp. 5188,
doi:10.1103/PhysRevLett.86.5188.
Robert Raussendorf, Daniel E Browne & Hans J Briegel (2003):
Measurement-based quantum computation on cluster states.
Physical review A 68(2),
pp. 022312,
doi:10.1103/PhysRevA.68.022312.
Dan Shepherd & Michael J Bremner (2009):
Temporally unstructured quantum computation.
In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 465.
The Royal Society,
pp. 1413–1439,
doi:10.1098/rspa.2008.0443.
Peter W Shor (1999):
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.
SIAM review 41(2),
pp. 303–332,
doi:10.1137/S0036144598347011.
Robert W Spekkens (2016):
Quasi-quantization: classical statistical theories with an epistemic restriction.
In: Quantum Theory: Informational Foundations and Foils.
Springer,
pp. 83–135,
doi:10.1007/978-94-017-7303-4_4.