Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation
Simplified instantaneous non-local quantum computation with applications to position-based cryptography
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
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.
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.
citing papers explorer
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation
-
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.