Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Cai, Guangya"'
Publikováno v:
Fundamenta Informaticae, Volume 182, Issue 4 (November 18, 2021) fi:8500
The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is $\varepsilon$-far from having that property. We investigate here several types of properties testing f
Externí odkaz:
http://arxiv.org/abs/2109.06763
Simon's problem is an essential example demonstrating the faster speed of quantum computers than classical computers for solving some problems. The optimal separation between exact quantum and classical query complexities for Simon's problem has been
Externí odkaz:
http://arxiv.org/abs/1905.08549
Publikováno v:
In Theoretical Computer Science 30 July 2022 924:171-186
Autor:
Cai, Guangya, Qiu, Daowen
Simon's problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon's discussion on his problem was limited to bounded-
Externí odkaz:
http://arxiv.org/abs/1610.01920
Autor:
Cai, Guangya, Qiu, Daowen
Publikováno v:
In Journal of Computer and System Sciences November 2018 97:83-93
The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is $\varepsilon$-far from having that property. We investigate here several types of properties testing f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0831947b513e8f6c46a4eda5e8064e6c
https://fi.episciences.org/8500
https://fi.episciences.org/8500
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.