Fetching the paper…
Reading the bibliography…
The task of non-local quantum computation requires implementation of a unitary on $n$ qubits between two parties with only one round of communication, ideally with minimal pre-shared entanglement.
Alex May · 1902
Earlier work this paper cites.
Constraining the doability of relativistic quantum tasks, 2019
Kfir Dolev · 1909
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters · 1993
Earlier work this paper cites.
Synthesis of quantum-logic circuits
V.V. Shende, S.S. Bullock, and I.L. Markov · 2005
Earlier work this paper cites.
Tagging systems, July 11 2006
Adrian P Kent, William J Munro, Timothy P Spiller, and Raymond G Beausoleil · 2006
Earlier work this paper cites.
Asymptotic teleportation scheme as a universal programmable quantum processor
Satoshi Ishizaka and Tohya Hiroshima · 2008
Earlier work this paper cites.
Unitarity plus causality implies localizability, 2009
Pablo Arrighi, Vincent Nesme, and Reinhard Werner · 2009
Earlier work this paper cites.
Location-dependent communications using quantum entanglement
Robert A. Malaney · 2010
Earlier work this paper cites.
Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints
Adrian Kent, William J Munro, and Timothy P Spiller · 2011
Earlier work this paper cites.
Simplified instantaneous non-local quantum computation with applications to position-based cryptography
Salman Beigi and Robert König · 2011
Cited alongside, same era.
Quantum tagging for tags containing secret classical data
Adrian Kent · 2011
Cited alongside, same era.
Quantum information: The conundrum of secure positioning
Gilles Brassard · 2011
Cited alongside, same era.
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
Hoi-Kwan Lau and Hoi-Kwong Lo · 2011
Cited alongside, same era.
A monogamy-of-entanglement game with applications to device-independent quantum cryptography
Marco Tomamichel, Serge Fehr, Ję drzej Kaniewski, and Stephanie Wehner · 2013
Cited alongside, same era.
Position-based quantum cryptography: Impossibility and constructions
Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, and Christian Schaffner · 2014
Instantaneous non-local computation of low t-depth quantum circuits
Florian Speelman · 2016
Later among the works it cites.
Second law of quantum complexity
Adam R. Brown and Leonard Susskind · 2018
Later among the works it cites.
Holographic scattering requires a connected entanglement wedge
Alex May, Geoff Penington, and Jonathan Sorce · 2020
Later among the works it cites.
Geometry of banach spaces: a new route towards position based cryptography
Marius Junge, Aleksander M Kubicki, Carlos Palazuelos, and David Pérez-García · 2021
Later among the works it cites.
Beating classical impossibility of position verification
Jiahui Liu, Qipeng Liu, and Luowen Qian · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
C Monroe, R Raussendorf, A Ruthven, KR Brown, P Maunz, L-M Duan, and J Kim · 2014
Cited alongside, same era.
Loss-tolerant position-based quantum cryptography
Bing Qi and George Siopsis · 2015
Cited alongside, same era.
Practical position-based quantum cryptography
Kaushik Chakraborty and Anthony Leverrier · 2015
Cited alongside, same era.
Rene Allerstorfer, Harry Buhrman, Florian Speelman, and Philip Verduyn Lunel · 2021
Later among the works it cites.
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks, 2021
Andreas Bluhm, Matthias Christandl, and Florian Speelman · 2021
Later among the works it cites.
Code-routing: a new attack on position-verification
S. Cree and A. May · 2022
Closest in time.
Complexity and entanglement in non-local computation and holography
A. May · 2022
Closest in time.