Unconstrained Summoning for relativistic quantum information processing
Adrian Kent (Centre for Quantum Information, Foundations, DAMTP,, University of Cambridge, Perimeter Institute for Theoretical Physics)

TL;DR
This paper introduces a summoning task in relativistic quantum information, demonstrating that any classically feasible task remains possible in the quantum realm when classical inputs are unconstrained.
Contribution
It establishes the equivalence of classical and quantum summoning tasks under unconstrained inputs, expanding understanding of quantum information propagation in relativistic settings.
Findings
Quantum summoning matches classical feasibility under unconstrained inputs
Any classical summoning task is achievable quantum mechanically in this scenario
The work bridges classical and quantum information tasks in relativistic contexts
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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
