2021
DOI: 10.48550/arxiv.2110.14672
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum Computational Complexity -- From Quantum Information to Black Holes and Back

Shira Chapman,
Giuseppe Policastro

Abstract: Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely different physical problem -that of information processing inside black holes. Quantum computational complexity was suggested as a new entry in the holographic dictionary, which extends the connection between geometry and information and resolves the puzzle of why black hole in… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 127 publications
0
11
0
Order By: Relevance
“…This complexity basically measures the growth of the size of the operator under time evolution. Some recent progress has been made towards understanding complexity for the dual field theory [229][230][231][232][233][234][235][236][237][238][239][240][241][242], see [243] for a recent review. However, it is in its early stage of development.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…This complexity basically measures the growth of the size of the operator under time evolution. Some recent progress has been made towards understanding complexity for the dual field theory [229][230][231][232][233][234][235][236][237][238][239][240][241][242], see [243] for a recent review. However, it is in its early stage of development.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…and we consider time-like and space-like Q's separately. 4 In the notation used in [18] for spacelike Q the boost parameter was written as η0. See Fig.…”
Section: Review Of Holographic Path Integral Optimizationmentioning
confidence: 99%
“…These conjectures have by now been studied intensely in various static and dynamic geometries (see e.g. review [4]). On the field theory side, various notions of complexity have been explored and their relations to each other and to holographic notions have been discussed (see e.g.…”
Section: Introductionmentioning
confidence: 99%
“…These conjectures have by now been studied intensely in various static and dynamic geometries (see e.g. review [5]). On the field theory side, various notions of complexity have been explored and their relations to each other and to holographic notions have been discussed (see e.g.…”
Section: Introductionmentioning
confidence: 99%