Portal de Periódicos da CAPES

Unconstrained summoning for relativistic quantum information processing

2018; American Physical Society; Volume: 98; Issue: 6 Linguagem: Inglês

10.1103/physreva.98.062332

2469-9942

Adrian Kent,

Quantum Computing Algorithms and Architecture

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.