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 条
  • [21] NOISE EFFECTS IN THE QUANTUM SEARCH ALGORITHM FROM THE VIEWPOINT OF COMPUTATIONAL COMPLEXITY
    Gawron, Piotr
    Klamka, Jerzy
    Winiarczyk, Ryszard
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2012, 22 (02) : 493 - 499
  • [22] Computational Complexity of Allow Rule Ordering and Its Greedy Algorithm
    Fuchino, Takashi
    Harada, Takashi
    Tanaka, Ken
    Mikawa, Kenji
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (09) : 1111 - 1118
  • [23] Explaining the Implicit Parallelism of Genetic Algorithm and Computational Complexity by Quantum Theory
    Peng, Wang
    ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 463 - 466
  • [24] Computational studies of protein folding
    Skolnick, J
    Kolinski, A
    COMPUTING IN SCIENCE & ENGINEERING, 2001, 3 (05) : 40 - 50
  • [25] Computational studies of protein folding
    Friesner, RA
    Gunn, JR
    ANNUAL REVIEW OF BIOPHYSICS AND BIOMOLECULAR STRUCTURE, 1996, 25 : 315 - 342
  • [26] Computational studies of protein folding
    Skolnick, J.
    Kolinski, A.
    Computing in Science and Engineering, 2001, 3 (05):
  • [27] Quantum protein folding
    Luo, Liaofu
    Lv, Jun
    QUANTUM BOUNDARIES OF LIFE, 2020, 82 : 181 - 211
  • [28] Computational Complexity of Quantum Satisfiability
    Herrmann, Christian
    Ziegler, Martin
    26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011), 2011, : 175 - 184
  • [29] Quantum implicit computational complexity
    Dal Lago, Ugo
    Masini, Andrea
    Zorzi, Margherita
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) : 377 - 409
  • [30] Quantum computational complexity and symmetry
    Rethinasamy, Soorya
    Laborde, Margarite L.
    Wilde, Mark M.
    CANADIAN JOURNAL OF PHYSICS, 2025, 103 (02) : 215 - 239
12345