Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1509.08094

A Quantum Paradox of Choice and Purported Classical Analogues

Emily Adlam, Adrian Kent

Published Sep 27, 2015• 2 citations
arXivHTMLPDF

Abstract

We recently considered the task of summoning an unknown quantum state and proved necessary and sufficient conditions for Alice to be able to guarantee to complete the task when there may be several possible calls, of which she need only respond to one. We showed that these are strictly stronger conditions than those previously established by Hayden and May for the case where Alice knows there will only be one call. We introduced the concept of a {\it quantum paradox of choice} to summarize the implications of these results: Alice is given more options to complete our version of the task, yet one can easily construct examples where our version is impossible and the apparently simpler version considered by Hayden-May is possible. Finkelstein has argued that one can identify analogous classical paradoxes of choice in a relativistic setting. We examine Finkelstein's proposed classical tasks and explain why they seem to us disanalogous.

DOI
10.48550/arxiv.1509.08094

Related papers

Quantum paradox of choice: More freedom makes summoning a quantum state harder

Emily Adlam, Adrian Kent

The properties of quantum information in space-time can be investigated by studying operational tasks, such as ``summoning,'' in which 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 and May [arXiv:1210.0913] 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, and we demonstrate the existence of an apparent paradox: The extra freedom makes it strictly harder to complete the summoning task. This result has practical applications for distributed quantum computing and cryptography and implications for our understanding of relativistic quantum information and its localization in space-time.

arXiv:1509.04226•Physical Review A•Jun 21, 2016•28 citations

Unconstrained Summoning

Adrian Kent

We define a summoning task to require propagating an unknown quantum state to a point in space-time belonging to a set determined by classical inputs at points in space-time. We consider the classical analogue, in which a known classical state must be returned at precisely one allowed point. We show that, when the inputs are unconstrained, any summoning task that is possible in the classical case is also possible in the quantum case.

•Jun 5, 2018•1 citation

Summoning, No-Signalling and Relativistic Bit Commitments

Adrian Kent

Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later point, belonging to a subset defined by communications received from Bob at other points. Many results about summoning, including the impossibility of unrestricted summoning tasks and the necessary conditions for specific types of summoning tasks to be possible, follow directly from the quantum no-cloning theorem and the relativistic no-superluminal-signalling principle. The impossibility of cloning devices can be derived from the impossibility of superluminal signalling and the projection postulate, together with assumptions about the devices' location-independent functioning. In this qualified sense, known summoning results follow from the causal structure of space-time and the properties of quantum measurements. Bounds on the fidelity of approximate cloning can be similarly derived. Bit commitment protocols and other cryptographic protocols based on the no-summoning theorem can thus be proven secure against some classes of post-quantum but non-signalling adversaries.

arXiv:1804.05246•Entropy•May 25, 2019•2 citations

Quantum Probability: Conditioning and Inference

Romano Scozzafava

Looking at conditional probability from the right perspective allows one to avoid classic paradoxical aspects of quantum mechanics. We discuss, as an elementary analogue of quan-tum states, a classical example (an urn of unknown composition) with similar (putative) paradoxical situ-ations, despite the fact that there is no quantum effect to which they could be ascribed. A crucial feature is that we look at them from an epis-temic point of view and not from the viewpoint of a (seemingly) ontologi-cal reality.

•Jan 1, 2008•0 citations

A necessary and sufficient condition to play games in quantum mechanical settings

Şahin Kaya Özdemir, Junichi Shimamura, N. Imoto

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

arXiv:quant-ph/0508105•New Journal of Physics•Feb 28, 2007•59 citations

Unconstrained summoning for relativistic quantum information processing

Adrian Kent

We define a summoning task to require propagating an unknown quantum state to a point in space-time belonging to a set determined by classical inputs at points in space-time. We consider the classical analog, in which a known classical state must be returned at precisely one allowed point. We show that, when the inputs are unconstrained, any summoning task that is possible in the classical case is also possible in the quantum case.

arXiv:1806.01736•Physical Review A•Dec 26, 2018•7 citations
We recently considered the task of summoning an unknown quantum state and proved necessary and sufficient conditions for Alice to be able to guarantee to complete the task when there may be several possible calls, of which she need only respond to one. We showed that these are strictly stronger conditions than those previously established by Hayden and May for the case where Alice knows there will only be one call. We introduced the concept of a {\it quantum paradox of choice} to summarize the implications of these results: Alice is given more options to complete our version of the task, yet one can easily construct examples where our version is impossible and the apparently simpler version considered by Hayden-May is possible. Finkelstein has argued that one can identify analogous classical paradoxes of choice in a relativistic setting. We examine Finkelstein's proposed classical tasks and explain why they seem to us disanalogous.
The properties of quantum information in space-time can be investigated by studying operational tasks, such as ``summoning,'' in which 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 and May [arXiv:1210.0913] 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, and we demonstrate the existence of an apparent paradox: The extra freedom makes it strictly harder to complete the summoning task. This result has practical applications for distributed quantum computing and cryptography and implications for our understanding of relativistic quantum information and its localization in space-time.
Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later point, belonging to a subset defined by communications received from Bob at other points. Many results about summoning, including the impossibility of unrestricted summoning tasks and the necessary conditions for specific types of summoning tasks to be possible, follow directly from the quantum no-cloning theorem and the relativistic no-superluminal-signalling principle. The impossibility of cloning devices can be derived from the impossibility of superluminal signalling and the projection postulate, together with assumptions about the devices' location-independent functioning. In this qualified sense, known summoning results follow from the causal structure of space-time and the properties of quantum measurements. Bounds on the fidelity of approximate cloning can be similarly derived. Bit commitment protocols and other cryptographic protocols based on the no-summoning theorem can thus be proven secure against some classes of post-quantum but non-signalling adversaries.
Looking at conditional probability from the right perspective allows one to avoid classic paradoxical aspects of quantum mechanics. We discuss, as an elementary analogue of quan-tum states, a classical example (an urn of unknown composition) with similar (putative) paradoxical situ-ations, despite the fact that there is no quantum effect to which they could be ascribed. A crucial feature is that we look at them from an epis-temic point of view and not from the viewpoint of a (seemingly) ontologi-cal reality.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.