Fetching the paper…
Reading the bibliography…
Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices.
Proposed experiment to test local hidden-variable theories
John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt · 1969
Earlier work this paper cites.
Multi-prover interactive proofs: How to remove intractability assumptions
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson · 1988
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
S. Goldwasser, S. Micali, and C. Rackoff · 1989
Earlier work this paper cites.
Pspace has constant-round quantum interactive proof systems
John Watrous · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Kraus representation in the presence of initial correlations
Hiroyuki Hayashi, Gen Kimura, and Yukihiro Ota · 2003
Earlier work this paper cites.
Universally composable privacy amplification against quantum adversaries
Renato Renner and Robert König · 2005
Earlier work this paper cites.
The universal composable security of quantum key distribution
Michael Ben-Or, Michał Horodecki, DebbieW. Leung, Dominic Mayers, and Jonathan Oppenheim · 2005
Earlier work this paper cites.
The measurement calculus
Vincent Danos, Elham Kashefi, and Prakash Panangaden · 2007
Earlier work this paper cites.
Topological fault-tolerance in cluster state quantum computation
R. Raussendorf, J. Harrington, and K. Goyal · 2007
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Earlier work this paper cites.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Cited alongside, same era.
Universally composable quantum multi-party computation
Dominique Unruh · 2010
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Classical cryptographic protocols in a quantum world
Sean Hallgren, Adam Smith, and Fang Song · 2011
Cited alongside, same era.
Universal blind quantum computing with weak coherent pulses, 2011
Vedran Dunjko, Elham Kashefi, and Anthony Leverrier · 2011
Cited alongside, same era.
Generalized self-testing and the security of the 6-state protocol
Matthew McKague and Michele Mosca · 2011
Cited alongside, same era.
Classical command of quantum systems
Ben W. Reichardt, Reichardt Falk Unger, and Umesh Vazirani · 2013
Later among the works it cites.
Interactive proofs for BQP via self-tested graph states, 2013
Matthew McKague · 2013
Later among the works it cites.
Quantum one-time programs
A. Broadbent, G. Gutoski, and D. Stebila · 2013
Later among the works it cites.
Experimental verification of quantum computation
Stefanie Barz, Joseph F. Fitzsimons, Elham Kashefi, and Philip Walther · 2013
Later among the works it cites.
Secure entanglement distillation for double-server blind quantum computation
Tomoyuki Morimae and Keisuke Fujii · 2013
Later among the works it cites.
Fully device-independent quantum key distribution
Umesh Vazirani and Thomas Vidick · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Unconditionally verifiable blind computation, 2012
Joseph F. Fitzsimons and Elham Kashefi · 2012
Cited alongside, same era.
Multipartite entanglement verification resistant against dishonest parties
Anna Pappa, André Chailloux, Stephanie Wehner, Eleni Diamanti, and Iordanis Kerenidis · 2012
Cited alongside, same era.
Actively secure two-party evaluation of any quantum operation
Frédéric Dupuis, JesperBuus Nielsen, and Louis Salvail · 2012
Cited alongside, same era.
Dorit Aharonov and Umesh Vazirani · 2012
Cited alongside, same era.
A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games, 2012
Ben W. Reichardt, Falk Unger, and Umesh Vazirani · 2012
Cited alongside, same era.
Blind topological measurement-based quantum computation
Tomoyuki Morimae and Keisuke Fujii · 2012
Cited alongside, same era.
Bosonsampling is far from uniform
Scott Aaronson and Alex Arkhipov · 2014
Later among the works it cites.
Blindness and Verification of Quantum Computation with One Pure Qubit
Theodoros Kapourniotis, Elham Kashefi, and Animesh Datta · 2014
Later among the works it cites.
Composable security of delegated quantum computation
Vedran Dunjko, Joseph F. Fitzsimons, Christopher Portmann, and Renato Renner · 2014
Later among the works it cites.
The Scott Aaronson 25.00$ Prize
Scott Aaronson · 2015
Closest in time.
Device-independent verifiable blind quantum computation, 2015
Michal Hajdušek, Carlos A. Pérez-Delgado, and Joseph F. Fitzsimons · 2015
Closest in time.
Deterministic entanglement distillation for secure double-server blind quantum computation
Yu-Bo Sheng and Lan Zhou · 2015
Closest in time.