Universality in random quantum networks
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F15%3A00239222" target="_blank" >RIV/68407700:21340/15:00239222 - isvavai.cz</a>
Výsledek na webu
<a href="http://journals.aps.org/pra/abstract/10.1103/PhysRevA.92.062335" target="_blank" >http://journals.aps.org/pra/abstract/10.1103/PhysRevA.92.062335</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1103/PhysRevA.92.062335" target="_blank" >10.1103/PhysRevA.92.062335</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Universality in random quantum networks
Popis výsledku v původním jazyce
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum networks are used to describe a wide range of phenomena, such as phase transitions, intricate aspects of many-bodyquantum systems, or even characteristic features of a future quantum internet. Random quantum networks and their associated directed graphs are employed for capturing statistically dominant features of complex quantum systems. Here, we develop an efficient iterative method capable of evaluating the probability of a graph being strongly connected. It is proven that random directed graphs with constant edge-establishing probability are typically strongly connected, i.e., any ordered pair of vertices is connected by a directed path. This typical topological property of directed random graphs is exploited to demonstrate universal features of the asymptotic evolution of large random qubit networks. These results are independent of our knowl
Název v anglickém jazyce
Universality in random quantum networks
Popis výsledku anglicky
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum networks are used to describe a wide range of phenomena, such as phase transitions, intricate aspects of many-bodyquantum systems, or even characteristic features of a future quantum internet. Random quantum networks and their associated directed graphs are employed for capturing statistically dominant features of complex quantum systems. Here, we develop an efficient iterative method capable of evaluating the probability of a graph being strongly connected. It is proven that random directed graphs with constant edge-establishing probability are typically strongly connected, i.e., any ordered pair of vertices is connected by a directed path. This typical topological property of directed random graphs is exploited to demonstrate universal features of the asymptotic evolution of large random qubit networks. These results are independent of our knowl
Klasifikace
Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BE - Teoretická fyzika
OECD FORD obor
—
Návaznosti výsledku
Projekt
<a href="/cs/project/GA13-33906S" target="_blank" >GA13-33906S: Využití potenciálu kvantových procházek</a><br>
Návaznosti
Z - Vyzkumny zamer (s odkazem do CEZ)
Ostatní
Rok uplatnění
2015
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Physical Review A
ISSN
1050-2947
e-ISSN
—
Svazek periodika
92
Číslo periodika v rámci svazku
6
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
6
Strana od-do
1-6
Kód UT WoS článku
000367056500001
EID výsledku v databázi Scopus
2-s2.0-84952904330