Efficient Code for Relativistic Quantum Summoning
arXiv:1711.10594 · doi:10.1088/1367-2630/aaccae
Abstract
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 comment15 pages, 7 figures
References in corpus (20)
- Gaussian Quantum Information
- Good Quantum Error-Correcting Codes Exist
- Measurement-based quantum computation with cluster states
- How to share a quantum secret
- Multiple Particle Interference and Quantum Error Correction
- On the Theory of Quantum Secret Sharing
- Graph States for Quantum Secret Sharing
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- Codes for the Quantum Erasure Channel
- Teleportation with a uniformly accelerated partner
- All Teleportation and Dense Coding Schemes
- Relativistic Quantum Teleportation with Superconducting Circuits
- Codeword Stabilized Quantum Codes
- Homological Error Correction: Classical and Quantum Codes
- Twelve years before the quantum no-cloning theorem
- Summoning Information in Spacetime, or Where and When Can a Qubit Be?
- A Quantum Paradox of Choice: More Freedom Makes Summoning a Quantum State Harder
- A No-summoning theorem in Relativistic Quantum Theory
- Spacetime replication of continuous variable quantum information
- Relativistic (2,3)-threshold quantum secret sharing