• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A New Model of Quantum Analogue Computation

Research Project

Project/Area Number 13680402
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionThe University of Electro-Communications

Principal Investigator

NISHINO Tetsuro  The University of Electro-Communications, Faculty of Electro-Communications, Dept.of Information and Communication Engineering, Professor, 電気通信学部, 助教授 (10198484)

Co-Investigator(Kenkyū-buntansha) TOMITA Etsuji  The University of Electro-Communications, Faculty of Electro-Communications, Dept.of Information and Communication Engineering, Professor, 電気通信学部, 教授 (40016598)
Project Period (FY) 2001 – 2003
Project Status Completed (Fiscal Year 2003)
Budget Amount *help
¥3,900,000 (Direct Cost: ¥3,900,000)
Fiscal Year 2003: ¥1,300,000 (Direct Cost: ¥1,300,000)
Fiscal Year 2002: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2001: ¥1,700,000 (Direct Cost: ¥1,700,000)
Keywordsquantum computation / analogue computation / NP-complete problem / 量子コンピュータ / アナログ量子計算 / グラフの3彩色問題 / 断熱量子計算 / 計算機シミュレーション / ニューロイダルネット / 量子ニューラルネット / 量子アナログ計算 / ニューラルネット / 脳型計算 / 量子ニューロイダルネット
Research Abstract

In 1985, David Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum parallel computations. Then, in 1994, Peter Shor showed that QTM can factor integers with arbitrary small error probability in polynomial time. Since it is widely believed that any deterministic Turing machines cannot factor integers in polynomial time, it is very likely that QTM is an essentially new model of computation. On the other hand, many researchers are studying how to physically implement quantum computers. In this research, we propose a quantum analogue computation model solving the graph 3-colorability problem which is known to be NP-complete. Our computer simulation shows that this model offers an appealing prospect for implementation of quantum computers because of a number of reasons.

Report

(4 results)
  • 2003 Annual Research Report   Final Research Report Summary
  • 2002 Annual Research Report
  • 2001 Annual Research Report
  • Research Products

    (19 results)

All Other

All Publications (19 results)

  • [Publications] Kazuo Ohta, Tetsuro Nishino, Seiya Okubo, Noboru Kunihiro: "A Quantum Algorithm using NMR Computers to Break Secret-Key Crypto systems"New Generation Computing. 21. 347-361 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Junnosuke Moriya, Tetsuro Nishino: "Equivalence of Real-Time DPDAs and Discrete Extended Simple Recurrent Networks with Some Restrictions"Systems and Computers in Japan. 34. 55-62 (2003)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Kazuo Ohta, Tetsuro Nishino, Seiya Okubo, Noboru Kunihiro: "A Quantum Algorithm using NMR Computers to Break Secret-Key Cryptosystems"New Generation Computing. Vol.21. 347-361 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Junnosuke Moriya, Tetsuro Nishino: "Equivalence of Real-Time DPDAs and Discrete Extended Simple Recurrent Networks with Some Restriction"Systems and Computers in Japan. Vol.34, No.7. 55-62 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] 西野哲朗: "量子計算量理論"電子情報通信学会論文誌D-I. Vol.J84-D-I, No.1. 3-17 (2001)

    • Related Report
      2003 Annual Research Report
  • [Publications] Junnosuke Moriya, Tetsuro Nishino: "Relationships between the Computational Capabilities of Simple Recurrent Networks and Finite Automata"IEICE Transactions on Fundamentals. Vol.E84-A, No.5. 1184-1194 (2001)

    • Related Report
      2003 Annual Research Report
  • [Publications] Tetsuro Nishino: "Mathematical Models of Quantum Computation"New Generation Computing. Vol.20. 317-337 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] 西野哲朗: "効率的量子アルゴリズムの設計手法"情報処理学会論文誌:数理モデル化と応用. Vol.43, No.SIG7(TOM6). 1-9 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] 渥美賢嗣, 西野哲朗: "NMR量子計算によるNP完全問題と因数分解の解法"情報処理学会論文誌:数理モデル化と応用. Vol.43, No.SIG7(TOM6). 10-18 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] Kazuo OHTA, Tetsuro NISHINO, Seiya OKUBO, Noboru KUNIHIRO: "A Quantum Algorithm using NMR Computers to Break Secret-Key Cryptosystems"New Generation Computing. Vol.21. 347-361 (2003)

    • Related Report
      2003 Annual Research Report
  • [Publications] 西野哲朗: "量子コンピュータの理論"培風館. 245 (2002)

    • Related Report
      2003 Annual Research Report
  • [Publications] 守谷純之介, 西野哲朗: "制限された離散的拡張単純回帰ネットワークと実時間DPDAの等価性"電子情報通信学会論文誌 D-I. J85-D-I, No.2. 160-167 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] 西野哲朗: "効率的量子アルゴリズムの設計手法"情報処理学会論文誌:数理モデル化と応用. Vol.43,No.SIG7. 1-9 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] 渥美賢嗣, 西野哲朗: "NMR量子計算によるNP完全問題と因数分解の解法"情報処理学会論文誌:数理モデル化と応用. Vol.43,No.SIG7. 10-18 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] 西野哲朗: "量子コンピュータと量子暗号"岩波書店. 78 (2002)

    • Related Report
      2002 Annual Research Report
  • [Publications] 西野 哲朗: "量子計算量理論"電子情報通信学会論文誌D-1. J84-D-1No.1. 3-17 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] J.Moriya, T.Nishino: "Relationships between the Computetional Capqbilities of Simple Recurrent Networks and Finite Automata"IEOCE Transactzons on Fundamentals. E84-ANo.5. 1184-1194 (2001)

    • Related Report
      2001 Annual Research Report
  • [Publications] 守谷 元介, 西野 哲朗: "制限された離散的拡張単純回帰ネットワークと実時間DPDAの等価性"電子情報通信学会論文誌D-1. J85-D-1No.2. 160-167 (2002)

    • Related Report
      2001 Annual Research Report
  • [Publications] 西野 哲朗: "量子コンピュータ量子暗号"岩波書店. 78 (2002)

    • Related Report
      2001 Annual Research Report

URL: 

Published: 2001-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi