Quantum tasks in holography
arXiv:1902.06845 · doi:10.1007/JHEP10(2019)233
Abstract
We consider an operational restatement of the holographic principle, which we call the principle of asymptotic quantum tasks. Asymptotic quantum tasks are quantum information processing tasks with inputs given and outputs required on points at the boundary of a spacetime. The principle of asymptotic quantum tasks states that tasks which are possible using the bulk dynamics should coincide with tasks that are possible using the boundary. We extract consequences of this principle for holography in the context of asymptotically AdS spacetimes. We argue for a novel connection between bulk causal structure and the phase transition in the boundary mutual information. Further, we note a connection between holography and quantum cryptography, where the problem of completing asymptotic quantum tasks has been studied earlier. We study the cryptographic and AdS/CFT approaches to completing asymptotic quantum tasks and consider the efficiency with which they replace bulk classical geometry with boundary entanglement.
arXiv commentNew version removes incorrect statements about Markov states
References in corpus (38)
- The Large N Limit of Superconformal Field Theories and Supergravity
- Large N Field Theories, String Theory and Gravity
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- The World as a Hologram
- A Covariant Holographic Entanglement Entropy Proposal
- The holographic principle
- No Signalling and Quantum Key Distribution
- Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
- Reconstruction of Bulk Operators within the Entanglement Wedge in Gauge-Gravity Duality
- Relative entropy equals bulk relative entropy
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Programmable quantum gate arrays
- Quantum conditional mutual information and approximate Markov chains
- Theorems on gravitational time delay and related issues
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Entanglement Wedge Reconstruction via Universal Recovery Channels
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography
- Universal recovery maps and approximate sufficiency of quantum relative entropy
- Ultimate Precision of Adaptive Noise Estimation
- Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
- Instantaneous measurement of non-local variables
- Unconditionally Secure Bit Commitment with Flying Qudits
- Position-Based Quantum Cryptography: Impossibility and Constructions
- Tomography from Entanglement
- Insecurity of position-based quantum cryptography protocols against entanglement attacks
- Quantum Tasks in Minkowski Space
- Coin Tossing is Strictly Weaker Than Bit Commitment
- Gravitational Positive Energy Theorems from Information Inequalities
- Constraining gravity using entanglement in AdS/CFT
- Global properties of causal wedges in asymptotically AdS spacetimes
- A Quantum Paradox of Choice: More Freedom Makes Summoning a Quantum State Harder
- A No-summoning theorem in Relativistic Quantum Theory
- The Gravity Dual of Boundary Causality
- Nonlinear constraints on gravity from entanglement
- Positive gravitational subsystem energies from CFT cone relative entropies
- Unconstrained Summoning for relativistic quantum information processing
Cited by in corpus (12)
- Complexity and entanglement in non-local computation and holography
- Quantum tasks require islands on the brane
- Geometry of Banach spaces: a new route towards Position Based Cryptography
- Optimality of the pretty good measurement for port-based teleportation
- Relating non-local quantum computation to information theoretic cryptography
- Code-routing: a new attack on position verification
- Linear gate bounds against natural functions for position-verification
- Security of quantum position-verification limits Hamiltonian simulation via holography
- Constraints on physical computers in holographic spacetimes
- Cryptographic tests of the python's lunch conjecture
- Distributing bipartite quantum systems under timing constraints
- A proof of Generalized Connected Wedge Theorem