Quantum computational complexity from quantum information to black holes and back

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 ins...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The European physical journal. C, Particles and fields Ročník 82; číslo 2; s. 1 - 40
Hlavní autoři:	Chapman, Shira, Policastro, Giuseppe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2022 Springer Springer Nature B.V Springer Verlag (Germany) SpringerOpen
Témata:	Astronomy Astrophysics and Cosmology Atoms Black holes Complexity Data processing Elementary Particles Geometry Hadrons Heavy Ions High Energy Physics - Theory Holography Measurement Science and Instrumentation New Frontiers in Holographic Duality Nuclear Energy Nuclear Physics Phase transitions Physics Physics and Astronomy Quantum computing Quantum Field Theories Quantum Field Theory Quantum phenomena Regular Article - Theoretical Physics Spacetime String Theory Theoretical physics
ISSN:	1434-6044, 1434-6052
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!