Simplified instantaneous non-local quantum computation with applications to position-based cryptography

Abstract

Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the related problem of multipartite quantum computation with local operations and a single round of classical communication. Compared to previously known techniques, our protocols reduce the entanglement consumption by an exponential amount. We also prove a linear lower bound on the amount of entanglement required for the implementation of a certain non-local measurement. These results relate to position-based cryptography: an amount of entanglement scaling exponentially in the number of communicated qubits is sufficient to render any such scheme insecure. Furthermore, we show that certain schemes are secure under the assumption that the adversary has less entanglement than a given linear bound and is restricted to classical communication.

18 pages, 2 figures. V2: clarified results of the crypto section, improved readability

References in corpus (6)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
• Location-Dependent Communications using Quantum Entanglement
• Insecurity of position-based quantum cryptography protocols against entanglement attacks
• Quantum Tagging for Tags Containing Secret Classical Data

Cited by in corpus (89)

• Advances in Quantum Teleportation
• Noise tailoring for scalable quantum computation via randomized compiling
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Quantum Cryptography Beyond Quantum Key Distribution
• A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
• Bounding quantum gate error rate based on reported average fidelity
• Position-Based Quantum Cryptography: Impossibility and Constructions
• Coherence in quantum error-correcting codes
• Quantum Tasks in Minkowski Space
• Port-based teleportation in arbitrary dimension
• Optimal Port-based Teleportation
• Optimal universal programming of unitary gates
• Practical Position-Based Quantum Cryptography
• Summoning Information in Spacetime, or Where and When Can a Qubit Be?
• Holographic scattering requires a connected entanglement wedge
• Random-Receiver Quantum Communication
• Complexity and entanglement in non-local computation and holography
• Asymptotic performance of port-based teleportation
• Resource Quantification for the No-Programming Theorem
• Generalized teleportation and entanglement recycling
• Efficient multi port-based teleportation schemes
• Simplified formalism of the algebra of partially transposed permutation operators with applications
• The Quantum Car
• A single-qubit position verification protocol that is secure against multi-qubit attacks
• Measurements of nonlocal variables and demonstration of the failure of the product rule for a pre- and postselected pair of photons
• Generalization of port-based teleportation and controlled teleportation capability
• Characterising port-based teleportation as a universal simulator of qubit channels
• Geometry of Banach spaces: a new route towards Position Based Cryptography
• The connected wedge theorem and its consequences
• Multiport based teleportation -- transmission of a large amount of quantum information
• Robustness of quantum algorithms against coherent control errors
• Quantum tasks in holography
• Higher-dimensional performance of port-based teleportation
• Randomized benchmarking in measurement-based quantum computing
• Quantum cryptography beyond key distribution: theory and experiment
• Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
• Bounds on Instantaneous Nonlocal Quantum Computation
• Optimality of the pretty good measurement for port-based teleportation
• The Garden-Hose Model
• Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes
• Optimal Multi-port-based Teleportation Schemes
• On the Duality of Teleportation and Dense Coding
• What is the best way to teleport a qudit?
• Fast protocols for local implementation of bipartite nonlocal unitaries
• Optimal amount of entanglement to distinguish quantum states instantaneously
• Unconditionally secure commitment in position-based quantum cryptography
• Loss-tolerant quantum secure positioning with weak laser sources
• Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
• Relating non-local quantum computation to information theoretic cryptography
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
• Implementation of bipartite or remote unitary gates with repeater nodes
• Secure positioning and non-local correlations
• Free-space reconfigurable quantum key distribution network
• Minimal Port-based Teleportation
• Classification of joint quantum measurements based on entanglement cost of localization
• Code-routing: a new attack on position verification
• Practically secure quantum position verification
• Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle
• Quantum non-locality, causality and mistrustful cryptography
• Infinite-Dimensional Programmable Quantum Processors
• Entropy in Quantum Information Theory -- Communication and Cryptography
• Towards a measurement theory in QFT: "Impossible" quantum measurements are possible but not ideal
• Port-based entanglement teleportation via noisy resource states
• Position-based quantum cryptography over untrusted networks
• Experimentally efficient methods for estimating the performance of quantum measurements
• Position-Based Quantum Cryptography and the Garden-Hose Game
• Classification of Schmidt-rank-two multipartite unitary gates by singular number
• The causal structure of Minkowski space time: possibilities and impossibilities of secure positioning
• Linear gate bounds against natural functions for position-verification
• Port-Based State Preparation and Applications
• Teleportation of Post-Selected Quantum States
• Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss
• Security of quantum position-verification limits Hamiltonian simulation via holography
• On The Round Complexity of Secure Quantum Computation
• Continuous-variable Quantum Position Verification secure against entangled attackers
• Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space
• From port-based teleportation to Frobenius reciprocity theorem: partially reduced irreducible representations and their applications
• Quantum Advantage in Storage and Retrieval of Isometry Channels
• Orthogonality Broadcasting and Quantum Position Verification
• Constraining the doability of relativistic quantum tasks
• Asymptotic teleportation schemes bridging between standard and port-based teleportation
• Port-based telecloning of an unknown quantum state
• Distributing bipartite quantum systems under timing constraints
• Impossibility of perfect cheating for single-qubit position verification
• On the distinguishability of geometrically uniform quantum states
• A resource theory of asynchronous quantum information processing
• Localization of joint quantum measurements on ${\mathbb{C}}^d\otimes {\mathbb{C}}^d$ by entangled resources with Schmidt number at most $d$
• Square-root measurements and degradation of the resource state in port-based teleportation scheme
• Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography