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 条
  • [31] Computational complexity reduction of predictor based least squares algorithm and its numerical property
    Wang, YH
    Ikeda, K
    Nakayama, K
    [J]. ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 1203 - 1207
  • [32] Quantum query complexity in computational geometry revisited
    Bahadur, A.
    Durr, C.
    Lafaye, T.
    Kulkarni, R.
    [J]. QUANTUM INFORMATION AND COMPUTATION IV, 2006, 6244
  • [33] Computational complexity measures of multipartite quantum entanglement
    Yamakami, T
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 117 - 128
  • [34] Accuracy versus complexity in computational quantum chemistry
    Thiel, Walter
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2019, 258
  • [35] On the computational complexity of the empirical mode decomposition algorithm
    Wang, Yung-Hung
    Yeh, Chien-Hung
    Young, Hsu-Wen Vincent
    Hu, Kun
    Lo, Men-Tzung
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 400 : 159 - 167
  • [36] PRECISION, COMPLEXITY, AND COMPUTATIONAL SCHEMES OF THE CUBIC ALGORITHM
    GALPERIN, EA
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1988, 57 (02) : 223 - 238
  • [37] Computational complexity analysis of selective breeding algorithm
    Chandrasekaran, M.
    Sriramya, P.
    Parvathavarthini, B.
    Saravanamanikandan, M.
    [J]. ADVANCED MANUFACTURING RESEARCH AND INTELLIGENT APPLICATIONS, 2014, 591 : 172 - +
  • [38] Computational complexity of the exterior point simplex algorithm
    Voulgaropoulou, Sophia
    Samaras, Nikolaos
    Sifaleras, Angelo
    [J]. OPERATIONAL RESEARCH, 2019, 19 (02) : 297 - 316
  • [39] Computational complexity of the exterior point simplex algorithm
    Sophia Voulgaropoulou
    Nikolaos Samaras
    Angelo Sifaleras
    [J]. Operational Research, 2019, 19 : 297 - 316
  • [40] Computational complexity of fractal image compression algorithm
    Gupta, Richa
    Mehrotra, Deepti
    Tyagi, Rajesh Kumar
    [J]. IET IMAGE PROCESSING, 2020, 14 (17) : 4425 - 4434
12345