All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Universality in random quantum networks

The result's identifiers

  • Result code in 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>

  • Result on the web

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Universality in random quantum networks

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BE - Theoretical physics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA13-33906S" target="_blank" >GA13-33906S: Harnessing the Power of Quantum Walks</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Physical Review A

  • ISSN

    1050-2947

  • e-ISSN

  • Volume of the periodical

    92

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    6

  • Pages from-to

    1-6

  • UT code for WoS article

    000367056500001

  • EID of the result in the Scopus database

    2-s2.0-84952904330