Fetching the paper…
Reading the bibliography…
Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics.
On the Einstein-Podolsky-Rosen paradox
John S. Bell · 1964
Earlier work this paper cites.
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.
New directions in cryptography
Whitfield Diffie and Martin Hellman · 1976
Earlier work this paper cites.
A method of obtaining digital signatures and public-key cryptosystems
Ronald L. Rivest, Adi Shamir, and Leonard Adleman · 1978
Earlier work this paper cites.
Quantum generalizations of Bell’s inequality
Boris S. Tsirelson · 1980
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.
Real algebraic and semi-algebraic sets
Riccardo Benedetti and Jean-Jacques Risler · 1990
Earlier work this paper cites.
Quantum cryptography based on Bell’s theorem
Artur K. Ekert · 1991
Earlier work this paper cites.
Maximal violation of Bell inequalities for mixed states
Samuel L. Braunstein, Ady Mann, and Michael Revzen · 1992
Earlier work this paper cites.
Which states violate Bell’s inequality maximally?
Sandu Popescu and Daniel Rohrlich · 1992
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and EPR channels
Charles H. Bennett, Gilles Brassard, Claude Crepeau, Richard Jozsa, Asher Peres, and William K. Wootters · 1993
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
Quantum cryptography with imperfect apparatus
Dominic Mayers and Andrew Yao · 1998
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L. Chuang · 1999
Earlier work this paper cites.
Coding theorem and strong converse for quantum channels
Andreas Winter · 1999
Earlier work this paper cites.
Self-testing of universal and fault-tolerant sets of quantum gates
Wim van Dam, Frédéric Magniez, Michele Mosca, and Miklos Santha · 2000
Earlier work this paper cites.
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Alexei Kitaev and John Watrous · 2000
Earlier work this paper cites.
Quantum computation and quantum information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
Simple proof of security of the BB84 quantum key distribution protocol
Peter W. Shor and John Preskill · 2000
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Two-qubit projective measurements are universal for quantum computation
Debbie W. Leung · 2002
Earlier work this paper cites.
Universal quantum computation using only projective measurement, quantum memory, and preparation of the | 0 ⟩ |0\rangle state
Michael A. Nielsen · 2003
Earlier work this paper cites.
Both Toffoli and controlled-NOT need little help to do universal quantum computation
Yaoyun Shi · 2003
Earlier work this paper cites.
Consequences and limits of nonlocal strategies
Richard Cleve, Peter Høyer, Ben Toner, and John Watrous · 2004
Earlier work this paper cites.
Self-testing quantum apparatus
Dominic Mayers and Andrew Yao · 2004
Earlier work this paper cites.
Quantum speed-up of Markov chain based algorithms
Mario Szegedy · 2004
Earlier work this paper cites.
No signalling and quantum key distribution
Jonathan Barrett, Lucien Hardy, and Adrian Kent · 2005
Earlier work this paper cites.
Quantum computing with realistically noisy devices
Emanuel Knill · 2005
Earlier work this paper cites.
Quantum Arthur-Merlin games
Chris Marriott and John Watrous · 2005
Cited alongside, same era.
Efficient quantum key distribution secure against no-signalling eavesdroppers
Antonio Acín, Serge Massar, and Stefano Pironio · 2006
Cited alongside, same era.
Quantum and relativistic protocols for secure multi-party computation
Roger Colbeck · 2006
Cited alongside, same era.
Asymptotic violation of Bell inequalities and distillability
Lluís Masanes · 2006
Cited alongside, same era.
Self-testing of quantum circuits
Frédéric Magniez, Dominic Mayers, Michele Mosca, and Harold Ollivier · 2006
Cited alongside, same era.
Unconditional security of key distribution from causality constraints
Lluís Masanes, Renato Renner, Matthias Christandl, Andreas Winter, and Jonathan Barrett · 2006
Quantum information processing with adversarial devices
Matthew McKague · 2010
Later among the works it cites.
Noise stability of functions with low influences: Invariance and optimality
Elchanan Mossel, Ryan O’Donnell, and Krzysztof Oleszkiewicz · 2010
Later among the works it cites.
Random numbers certified by Bell’s theorem
Stefano Pironio, Antonio Acín, Serge Massar, Antoine Boyer de la Giroday, Dzimitry N. Matsukevich, Peter Maunz, Steven Olmschenk, David Hayes, Le Luo, T. Andrew Manning, and Christopher Monroe · 2010
Later among the works it cites.
Private randomness expansion with untrusted devices
Roger Colbeck and Adrian Kent · 2011
Later among the works it cites.
Security and composability of randomness expansion from Bell inequalities
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Device-independent security of quantum cryptography against collective attacks
Antonio Acín, Nicolas Brunner, Nicolas Gisin, Serge Massar, Stefano Pironio, and Valerio Scarani · 2007
Cited alongside, same era.
Positive Definite Matrices
Rajendra Bhatia · 2007
Cited alongside, same era.
Making good codes for classical-quantum channel coding via quantum hypothesis testing
Tomohiro Ogawa and Hiroshi Nagaoka · 2007
Cited alongside, same era.
Quantum cryptography: Public key distribution and coin tossing
Charles H. Bennett and Gilles Brassard · 2008
Cited alongside, same era.
Perfect parallel repetition theorem for quantum XOR proof systems
Richard Cleve, William Slofstra, Falk Unger, and Sarvagya Upadhyay · 2008
Cited alongside, same era.
Yi Zhao, Chi-Hang Fred Fung, Bing Qi, Christine Chen, and Hoi-Kwong Lo · 2008
Cited alongside, same era.
Serge Fehr, Ran Gelles, and Christian Schaffner · 2011
Later among the works it cites.
Direct fidelity estimation from few Pauli measurements
Steven T. Flammia and Yi-Kai Liu · 2011
Later among the works it cites.
Full-field implementation of a perfect eavesdropper on a quantum cryptography system
Ilja Gerhardt, Qin Liu, Antía Lamas-Linares, Johannes Skaar, Christian Kurtsiefer, and Vadim Makarov · 2011
Later among the works it cites.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Later among the works it cites.
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous · 2011
Later among the works it cites.
Entangled games are hard to approximate
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick · 2011
Later among the works it cites.
Parallel repetition of entangled games
Julia Kempe and Thomas Vidick · 2011
Later among the works it cites.
Universal low-rank matrix recovery from Pauli measurements
Yi-Kai Liu · 2011
Later among the works it cites.
Quantum query complexity of state conversion
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek, and Mario Szegedy · 2011
Later among the works it cites.
Generalized self-testing and the security of the 6 6 -state protocol
Matthew McKague and Michele Mosca · 2011
Later among the works it cites.
Secure device-independent quantum key distribution with causally independent measurement devices
Lluís Masanes, Stefano Pironio, and Antonio Acín · 2011
Later among the works it cites.
Security of practical private randomness generation
Stefano Pironio and Serge Massar · 2011
Later among the works it cites.
Reflections for quantum query algorithms
Ben W. Reichardt · 2011
Later among the works it cites.
Fully distrustful quantum bit commitment and coin flipping
Jonathan Silman, André Chailloux, Nati Aharon, Iordanis Kerenidis, Stefano Pironio, and Serge Massar · 2011
Later among the works it cites.
Practical characterization of quantum devices without tomography
Marcus P. da Silva, Olivier Landon-Cardinal, and David Poulin · 2011
Later among the works it cites.
Randomness versus nonlocality and entanglement
Antonio Acín, Serge Massar, and Stefano Pironio · 2012
Closest in time.
Dorit Aharonov and Umesh Vazirani · 2012
Closest in time.
Demonstration of blind quantum computing
Stefanie Barz, Elham Kashefi, Anne Broadbent, Joseph F. Fitzsimons, Anton Zeilinger, and Philip Walther · 2012
Closest in time.
Unconditionally verifiable blind computation
Joseph F. Fitzsimons and Elham Kashefi · 2012
Closest in time.
A multi-prover interactive proof for NEXP sound against entangled provers
Tsuyoshi Ito and Thomas Vidick · 2012
Closest in time.
Robust self-testing quantum states and binary nonlocal XOR games
Carl Miller and Yaoyun Shi · 2012
Closest in time.
Robust self-testing of the singlet
Matthew McKague, Tzyh Haur Yang, and Valerio Scarani · 2012
Closest in time.
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Umesh V. Vazirani and Thomas Vidick · 2012
Closest in time.
Unconditional security of quantum key distribution over arbitrarily long distances
Hoi-Kwong Lo and H. F. Chau · 2050
Closest in time.