Number of the records: 1  

Quantum versus classical simultaneity in communication complexity

  1. 1.
    SYSNO ASEP0509379
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleQuantum versus classical simultaneity in communication complexity
    Author(s) Gavinsky, Dmitry (MU-W) RID, SAI, ORCID
    Source TitleIEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers - ISSN 0018-9448
    Roč. 65, č. 10 (2019), s. 6466-6483
    Number of pages18 s.
    Languageeng - English
    CountryUS - United States
    Keywordscommunication complexity ; quantum communication ; quantum computing
    Subject RIVBA - General Mathematics
    OECD categoryComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    R&D ProjectsGX19-27871X GA ČR - Czech Science Foundation (CSF)
    Method of publishingLimited access
    Institutional supportMU-W - RVO:67985840
    UT WOS000487041200029
    EID SCOPUS85077399406
    DOI10.1109/TIT.2019.2918453
    AnnotationThis paper addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research which can be viewed as demonstrating qualitative advantage of quantum communication in the three most common communication 'layouts': two-way interactive communication, one-way communication and simultaneous message passing (SMP). I demonstrate a functional problem (cEqT) over tilde, whose communication complexity is O ((log n)(2)) in the quantum version of the SMP and (Omega) over tilde(root n) in the classical (randomized) version of SMP. Second, this paper contributes to understanding the power of the weakest commonly studied regime of quantum communication-SMP with quantum messages and without shared randomness (the latter restriction can be viewed as a somewhat artificial way of making the quantum model 'as weak as possible'). Our function (cEqT) over tilde has an efficient solution in this regime as well, which means that even lacking shared randomness, quantum SMP can be exponentially stronger than its classical counterpart with shared randomness.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2020
    Electronic addresshttp://dx.doi.org/10.1109/TIT.2019.2918453
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.