Circuit complexity and functionality: A statistical thermodynamics perspective

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexit...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the National Academy of Sciences - PNAS Ročník 122; číslo 23; s. e2415913122
Hlavní autori:	Chamon, Claudio, Ruckenstein, Andrei E, Mucciolo, Eduardo R, Canetti, Ran
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States 10.06.2025
Predmet:	thermodynamics classical reversible circuits complexity cryptography quantum circuits
ISSN:	1091-6490, 1091-6490
On-line prístup:	Zistit podrobnosti o prístupe
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!