A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

被引：0
|
作者：
Iriyama, Satoshi [1 ]
机构：
[1] Tokyo Univ Sci, Dept Informat Sci, Tokyo, Japan
来源：
INFINITE DIMENSIONAL ANALYSIS, QUANTUM PROBABILITY AND RELATED TOPICS, IDAQP 2024 | 2024年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A quantum algorithm for the general search problem is proposed by Ohya et al. in 2015. An NP-hard problem can be solved in polynomial steps with high probability by the quantum algorithm which implicates multiple quantum computation. Each quantum algorithm amplifies the success probability using the special dynamics, so called the Chaos amplifier, which is defined by the logistic map. In 2017, we showed that the Chaos amplifier and more general amplification process can be represented by the GKSL master equation in a two-qubit system. In this study, we explain our notion of combined quantum algorithm, and discuss on its computational complexity for the difficult problem.
引用
收藏
页码：103 / 112
页数：10
相关论文
共 50 条
  • [1] On Quantum Algorithm for Binary Search and Its Computational Complexity
    Iriyama, S.
    Ohya, M.
    Volovich, I. V.
    [J]. OPEN SYSTEMS & INFORMATION DYNAMICS, 2015, 22 (03):
  • [2] QUANTUM ALGORITHM FOR PROTEIN FOLDING AND ITS COMPUTATIONAL COMPLEXITY
    Iriyama, S.
    Ohya, M.
    Yamato, I.
    [J]. QUANTUM BIO-INFORMATICS V, 2013, 30 : 193 - 202
  • [3] Computational complexity and applications of quantum algorithm
    Iriyama, S.
    Ohya, M.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (16) : 8019 - 8028
  • [4] ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
    Iriyama, Satoshi
    Ohya, Masanori
    Volovich, Igor V.
    [J]. QUANTUM PROBABILITY AND RELATED TOPICS, 2013, 29 : 189 - 199
  • [5] Reliability of Schoof algorithm and its computational complexity
    Kinakh, Iaroslav
    Iakymenko, Ihor
    [J]. EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS, 2009, : 107 - 107
  • [6] Reliability of RSA algorithm and its computational complexity
    Karpinskyy, M
    Kinakh, Y
    [J]. IDAACS'2003: PROCEEDINGS OF THE SECOND IEEE INTERNATIONAL WORKSHOP ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS, 2003, : 494 - 496
  • [7] A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
    Wang, Yuanlong
    Dong, Daoyi
    Qi, Bo
    Zhang, Jun
    Petersen, Ian R.
    Yonezawa, Hidehiro
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (05) : 1388 - 1403
  • [8] NOISE EFFECTS IN THE QUANTUM SEARCH ALGORITHM FROM THE VIEWPOINT OF COMPUTATIONAL COMPLEXITY
    Gawron, Piotr
    Klamka, Jerzy
    Winiarczyk, Ryszard
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2012, 22 (02) : 493 - 499
  • [9] Computational Complexity of Allow Rule Ordering and Its Greedy Algorithm
    Fuchino, Takashi
    Harada, Takashi
    Tanaka, Ken
    Mikawa, Kenji
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (09) : 1111 - 1118
  • [10] Explaining the Implicit Parallelism of Genetic Algorithm and Computational Complexity by Quantum Theory
    Peng, Wang
    [J]. ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 463 - 466
12345