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:1806.01736 · Physical Review A

Unconstrained summoning for relativistic quantum information processing

Adrian Kent

Published Dec 26, 2018• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.98.062332

Related papers

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•0 citations

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•26 citations

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•1 citation

A Quantum Paradox of Choice and Purported Classical Analogues

Emily Adlam, Adrian Kent

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.

arXiv:1509.08094•Sep 27, 2015•1 citation

Efficient code for relativistic quantum summoning

Ya-Dong Wu, Abdullah Khalid, Barry C. Sanders

Summoning retrieves quantum information, prepared somewhere in spacetime, at another specified point in spacetime, but this task is limited by the quantum no-cloning principle and the speed-of-light bound. We develop a thorough mathematical framework for summoning quantum information in a relativistic system and formulate a quantum summoning protocol for any valid configuration of causal diamonds in spacetime. For single-qubit summoning, we present a protocol based on a Calderbank–Shor–Steane code that decreases the space complexity for encoding by a factor of two compared to the previous best result and reduces the gate complexity from scaling as the cube to the square of the number of causal diamonds. Our protocol includes decoding whose gate complexity scales linearly with the number of causal diamonds. Our thorough framework for quantum summoning enables full specification of the protocol, including spatial and temporal implementation and costs, which enables quantum summoning to be a well posed protocol for relativistic quantum communication purposes.

arXiv:1711.10594•New Journal of Physics•Jun 14, 2018•9 citations

Summoning information in spacetime, or where and when can a qubit be?

Patrick M. Hayden, Alex May

Abstract One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can not be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quantum information. Because quantum information can be delocalized through quantum error correction and teleportation, it need not follow well-defined trajectories. Instead, replication of the information in any configuration of spacetime regions not leading to violations of causality or the no-cloning principle is allowed. To demonstrate this, we answer the operational question of exactly when the information can be summoned to a set of spacetime points, showing how to do so efficiently using a combination of teleportation and codeword-stabilized quantum codes. This provides a simple and complete description of where and when a qubit can be located in spacetime, revealing a remarkable variety of possibilities.

arXiv:1210.0913•Journal of Physics A Mathematical and Theoretical•Mar 22, 2016•32 citations
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.
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.
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.
Summoning retrieves quantum information, prepared somewhere in spacetime, at another specified point in spacetime, but this task is limited by the quantum no-cloning principle and the speed-of-light bound. We develop a thorough mathematical framework for summoning quantum information in a relativistic system and formulate a quantum summoning protocol for any valid configuration of causal diamonds in spacetime. For single-qubit summoning, we present a protocol based on a Calderbank–Shor–Steane code that decreases the space complexity for encoding by a factor of two compared to the previous best result and reduces the gate complexity from scaling as the cube to the square of the number of causal diamonds. Our protocol includes decoding whose gate complexity scales linearly with the number of causal diamonds. Our thorough framework for quantum summoning enables full specification of the protocol, including spatial and temporal implementation and costs, which enables quantum summoning to be a well posed protocol for relativistic quantum communication purposes.
Abstract One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can not be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quantum information. Because quantum information can be delocalized through quantum error correction and teleportation, it need not follow well-defined trajectories. Instead, replication of the information in any configuration of spacetime regions not leading to violations of causality or the no-cloning principle is allowed. To demonstrate this, we answer the operational question of exactly when the information can be summoned to a set of spacetime points, showing how to do so efficiently using a combination of teleportation and codeword-stabilized quantum codes. This provides a simple and complete description of where and when a qubit can be located in spacetime, revealing a remarkable variety of possibilities.