A Quantum Paradox of Choice: More Freedom Makes Summoning a Quantum State Harder
arXiv:1509.04226 · doi:10.1103/PhysRevA.93.062327
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 (26)
- Quantum entanglement
- Quantum Teleportation is a Universal Computational Primitive
- On the reality of the quantum state
- Einstein, incompleteness, and the epistemic view of quantum states
- Is the quantum state real? An extended review of -ontology theorems
- A generalized no-broadcasting theorem
- Specker's Parable of the Over-protective Seer: A Road to Contextuality, Nonlocality and Complementarity (PLUS AN ERRATUM)
- Is a system's wave function in one-to-one correspondence with its elements of reality?
- Local deterministic model of singlet state correlations based on relaxing measurement independence
- Guess your neighbour's input: a multipartite non-local game with no quantum advantage
- Quantum Cheshire Cats
- Are quantum states real?
- No -epistemic model can fully explain the indistinguishability of quantum states
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Experimental bit commitment based on quantum communication and special relativity
- Unconditionally Secure Bit Commitment with Flying Qudits
- Exponential complexity and ontological theories of quantum mechanics
- Quantum Tasks in Minkowski Space
- Psi-Epistemic Theories: The Role of Symmetry
- Device-Independent Relativistic Quantum Bit Commitment
- Summoning Information in Spacetime, or Where and When Can a Qubit Be?
- Noise Effects in Quantum Magic Squares Game
- A No-summoning theorem in Relativistic Quantum Theory
- The whole is greater than the sum of the parts: on the possibility of purely statistical interpretations of quantum theory
- Deterministic Relativistic Quantum Bit Commitment
- On the implications of the Quantum-Pigeonhole Effect
Cited by in corpus (17)
- Summoning Information in Spacetime, or Where and When Can a Qubit Be?
- 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
- One-out-of- spacetime-constrained oblivious transfer
- Spacetime replication of continuous variable quantum information
- 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