QUANTUM ALGORITHM FOR PROTEIN FOLDING AND ITS COMPUTATIONAL COMPLEXITY

被引：0
|
作者：
Iriyama, S. [1 ]
Ohya, M. [1 ]
Yamato, I. [1 ]
机构：
[1] Tokyo Univ Sci, Tokyo 162, Japan
来源：
QUANTUM BIO-INFORMATICS V | 2013年 / 30卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We have studied applications of quantum algorithm for the problems in bioinformatics. The protein folding problem is known as one of the difficult problems which we do not solve in polynomial time of input data. We constructed a quantum algorithm for the protein folding problem using our new quantum binary search algorithm, and discussed its computtational complexity. We prove that the computational complexity is polynomial of the number of molecular in the simulation.
引用
收藏
页码：193 / 202
页数：10
相关论文
共 50 条
  • [1] A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY
    Iriyama, Satoshi
    [J]. INFINITE DIMENSIONAL ANALYSIS, QUANTUM PROBABILITY AND RELATED TOPICS, IDAQP 2024, 2024, : 103 - 112
  • [2] 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):
  • [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] Reducing the computational complexity of protein folding via fragment folding and assembly
    Haspel, N
    Tsai, CJ
    Wolfson, H
    Nussinov, R
    [J]. PROTEIN SCIENCE, 2003, 12 (06) : 1177 - 1187
  • [6] Digitized Counterdiabatic Quantum Algorithm for Protein Folding
    Chandarana, Pranav
    Hegade, Narendra N.
    Montalban, Iraitz
    Solano, Enrique
    Chen, Xi
    [J]. PHYSICAL REVIEW APPLIED, 2023, 20 (01)
  • [7] New computational algorithm for the prediction of protein folding types
    Stambuk, N
    Konjevoda, P
    [J]. INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 2001, 84 (01) : 13 - 22
  • [8] 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
  • [9] 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
  • [10] On the complexity of protein folding
    Crescenzi, P
    Goldman, D
    Papadimitriou, C
    Piccolboni, A
    Yannakakis, M
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 1998, 5 (03) : 423 - 465
12345