Pith. sign in

REVIEW 1 cited by

Quantum tasks in holography

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.06845 v7 pith:35HFR2NC submitted 2019-02-19 hep-th quant-ph

classification hep-thquant-ph
keywords tasksquantumasymptoticboundaryprinciplebulkholographycompleting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An order-theoretic circuit syntax and characterisation of the concept lattice

    quant-ph 2025-07 conditional novelty 7.0 of 10

    The concept lattice L_G is characterized as the unique smallest circuit with connectivity G that admits morphisms from every other circuit with the same connectivity.

Pith tools