CVClient

Suguru Tamaki

  (玉置 卓)

Profile Information

Affiliation
Professor, Graduate School of Information Science / School of Social Information Science, University of Hyogo
Degree
Doctor of Informatics(Kyoto University)

Researcher number
40432413
ORCID ID
 https://orcid.org/0000-0002-8105-2368
J-GLOBAL ID
201401071504415573
researchmap Member ID
7000008755

External link

Papers

 40
  • Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
    FCT, 262-275, Sep, 2023  Peer-reviewed
  • Tomoyuki Morimae, Suguru Tamaki
    Quantum, 4(329) 1-12, Sep 24, 2020  Peer-reviewed
    It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in classical complexity theory. Recently, these results have been improved to ``fine-grained" versions where even exponential-time classical simulations are excluded assuming certain classical fine-grained complexity conjectures. All these fine-grained results are, however, about the hardness of strong simulations or multiplicative-error sampling. It was open whether any fine-grained quantum supremacy result can be shown for a more realistic setup, namely, additive-error sampling. In this paper, we show the additive-error fine-grained quantum supremacy (under certain complexity assumptions). As examples, we consider the IQP model, a mixture of the IQP model and log-depth Boolean circuits, and Clifford+<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>T</mml:mi></mml:math> circuits. Similar results should hold for other sub-universal models.
  • Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
    Journal of Computer and System Sciences, 105 87-103, Nov, 2019  Peer-reviewed
  • Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki
    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E102-D(3) 483-491, Mar, 2019  Peer-reviewed
  • Tomoyuki Morimae, Suguru Tamaki
    Quantum Information & Computation, 19(13&14) 1089-1115, 2019  Peer-reviewed

Misc.

 9

Books and Other Publications

 2
  • 徳山 豪, 小林 直樹 (Role: Contributor, 玉置 卓, 3.5節 近似計算の理論)
    朝倉書店, Jan, 2022
  • 伊藤大雄, 宇野裕之 (Role: Contributor, 玉置卓, 第16章 計算量理論の最先端)
    現代数学社, May, 2010

Presentations

 30

Research Projects

 13