A Quantum Paradox of Choice: More Freedom Makes Summoning a Quantum State Harder

Abstract

The properties of quantum information in space-time can be investigated by studying operational tasks. In one such task, summoning, an unknown quantum state is supplied at one point, and a call is made at another for it to be returned at a third. Hayden-May recently proved necessary and sufficient conditions for guaranteeing successful return of a summoned state for finite sets of call and return points when there is a guarantee of at most one summons. We prove necessary and sufficient conditions when there may be several possible summonses and complying with any one constitutes success. We show there is a "quantum paradox of choice" in summoning: the extra freedom in completing the task makes it strictly harder. This intriguing result has practical applications for distributed quantum computing and cryptography and also implications for our understanding of relativistic quantum information and its localization in space-time.

References in corpus (8)

• Is the quantum state real? An extended review of $\psi$-ontology theorems
• A generalized no-broadcasting theorem
• Local deterministic model of singlet state correlations based on relaxing measurement independence
• Exponential complexity and ontological theories of quantum mechanics
• Device-Independent Relativistic Quantum Bit Commitment
• Noise Effects in Quantum Magic Squares Game
• Deterministic Relativistic Quantum Bit Commitment
• On the implications of the Quantum-Pigeonhole Effect

Cited by in corpus (16)

• Transmitting qubits through relativistic fields
• Random-Receiver Quantum Communication
• Spacetime-constrained oblivious transfer
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• Quantum tasks in holography
• Spacetime replication of continuous variable quantum information
• One-out-of-$m$ spacetime-constrained oblivious transfer
• S-money: virtual tokens for a relativistic economy
• Unconstrained Summoning for relativistic quantum information processing
• Encrypted Qubits can be Cloned
• Efficient Code for Relativistic Quantum Summoning
• Localizing and excluding quantum information; or, how to share a quantum secret in spacetime
• Distributing bipartite quantum systems under timing constraints
• A classical paradox of choice
• Summoning, No-Signaling and Relativistic Bit Commitments
• Comparing Singlet Testing Schemes