Bounds on Instantaneous Nonlocal Quantum Computation

Abstract

Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\epsilon$-error using $O(\log (1/\epsilon ))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\epsilon )$. We also consider the family of binary controlled gates on dimensions $d_A\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.

Comments welcome!

References in corpus (8)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Optimizing practical entanglement distillation
• Quantum teleportation scheme by selecting one of multiple output ports
• Location-Dependent Communications using Quantum Entanglement
• Insecurity of position-based quantum cryptography protocols against entanglement attacks
• Round Complexity in the Local Transformations of Quantum and Classical States
• Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
• Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation

Cited by in corpus (12)

• Random-Receiver Quantum Communication
• A single-qubit position verification protocol that is secure against multi-qubit attacks
• Universal resources for quantum computing
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
• Classification of joint quantum measurements based on entanglement cost of localization
• Towards a measurement theory in QFT: "Impossible" quantum measurements are possible but not ideal
• The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation
• Linear gate bounds against natural functions for position-verification
• Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss
• Teleportation of Post-Selected Quantum States
• Continuous-variable Quantum Position Verification secure against entangled attackers
• Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography