| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 1 | Quantum turing machine | US10571127 | 2004-09-02 | US20070120727A1 | 2007-05-31 | Yasumoto Tanaka; Akira Iyo; Norio Terada; Shiro Kawabata; Athinarayan Sundaresan; Naoto Kikuchi; Tsuneo Watanabe; Kazuyasu Tokiwa |
| A quantum Turing machine constituted using a quantum bit created by localizing a phase difference soliton S between superconducting electrons existing in each of multiple of bands in a ring R0 that includes a ring main body R1 formed of a superconductor, and well-shaped portions W1, W2 formed with a reduced line-width at at least two positions on the ring main body R1, can easily constitute a quantum bit, can surely execute a basic logical operation, has multiple-bit capability and, moreover, can ensure sufficient time for executing a quantum algorithm. | ||||||
| 2 | Quantum turing machine | US10571127 | 2004-09-02 | US07400282B2 | 2008-07-15 | Yasumoto Tanaka; Akira Iyo; Norio Terada; Shiro Kawabata; Athinarayan Sundaresan; Naoto Kikuchi; Tsuneo Watanabe; Kazuyasu Tokiwa |
| A quantum Turing machine constituted using a quantum bit created by localizing a phase difference soliton S between superconducting electrons existing in each of multiple of bands in a ring R0 that includes a ring main body R1 formed of a superconductor, and well-shaped portions W1, W2 formed with a reduced line-width at at least two positions on the ring main body R1, can easily constitute a quantum bit, can surely execute a basic logical operation, has multiple-bit capability and, moreover, can ensure sufficient time for executing a quantum algorithm. | ||||||
| 3 | 量子チューリング機械 | PCT/JP2004/013093 | 2004-09-02 | WO2005027234A1 | 2005-03-24 | 田中 康資; 伊豫 彰; 寺田 教男; 川畑 史郎; アシナラヤナン スンダレサン; 菊地 直人; 渡辺 恒夫; 常盤 和靖 |
超伝導体で形成したリング本体R1と、そのリング本体R1の少なくとも2箇所に径を細くして形成した井戸状部分W1,W2と、を備えるリングR0に、複数のバンドの各々に存在する超伝導電子間の位相差ソリトンSを局在化させて作った量子ビットを用いて構成した量子チューニング機械であって、量子ビットの構成を容易に行うことができ、基本的な論理演算も確実に実行することができ、また多ビット化が可能であり、さらに量子アルゴリズムを実行するのに十分な時間を確保することができる。 |
||||||
| 4 | SECURE ACTIVE ELEMENT MACHINE | PCT/US2012023408 | 2012-01-31 | WO2012106383A3 | 2012-10-11 | FISKE MICHAEL |
| Based upon the principles of Turing incomputability, connectedness and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. Using randomness, the active element machine can deterministically execute a universal Turing machine (universal digital computer program) with active element firing patterns that are Turing incomputable. In some embodiments, if the state and tape (or other memory) contents of the universal Turing machine and the random bits generated from the quantum source are all kept perfectly secret and no information is leaked about the dynamic connections between the active elements, then it is Turing incomputable to construct a translator Turing machine (translator digital computer program) that maps the random firing interpretations back to the sequence of instructions executed by the universal Turing machine. A more powerful computational procedure is created than Turing's computational procedure (digital computer procedure). | ||||||
| 5 | SECURE ACTIVE ELEMENT MACHINE | PCT/US2012/023408 | 2012-01-31 | WO2012106383A2 | 2012-08-09 | FISKE, Michael |
Based upon the principles of Turing incomputability, connectedness and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. Using randomness, the active element machine can deterministically execute a universal Turing machine (universal digital computer program) with active element firing patterns that are Turing incomputable. In some embodiments, if the state and tape (or other memory) contents of the universal Turing machine and the random bits generated from the quantum source are all kept perfectly secret and no information is leaked about the dynamic connections between the active elements, then it is Turing incomputable to construct a translator Turing machine (translator digital computer program) that maps the random firing interpretations back to the sequence of instructions executed by the universal Turing machine. A more powerful computational procedure is created than Turing's computational procedure (digital computer procedure). |
||||||
| 6 | Non-Deterministic Secure Active Element Machine | US14643774 | 2015-03-10 | US20150186683A1 | 2015-07-02 | MICHAEL STEPHEN FISKE |
| Based upon the principles of Turing incomputability, connectedness and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an active element machine (AEM). AEM programs are designed so that the purpose of the AEM computations are difficult to apprehend by an adversary and hijack with malware. These methods can also be used to help thwart reverse engineering of proprietary algorithms, hardware design and other areas of intellectual property.Using quantum randomness, the AEM can deterministically execute a universal Turing machine (universal digital computer program) with active element firing patterns that are Turing incomputable. In an embodiment, a more powerful computational procedure is created than Turing's computational procedure (equivalent to a digital computer procedure). Current digital computer algorithms and procedures can be derived or designed with a Turing machine computational procedure. A novel computer is invented so that a program's execution is difficult to apprehend. | ||||||
| 7 | SECURE ACTIVE ELEMENT MACHINE | EP12742528 | 2012-01-31 | EP2671182A4 | 2017-04-26 | FISKE MICHAEL |
| Based upon the principle of Turing incomputability, and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an Active Element Machine (AEM). AEM programs are designed so that the purpose of the computation is difficult to apprehend by an adversary and hijack with malware. These methods can help hinder reverse engineering of proprietary algorithms and hardware design. Using quantum randomness, the AEM can deterministically execute a universal digital computer program with active element firing patterns that are Turing incomputable. In some embodiments, a more powerful computational procedure is demonstrated than Turing's computational procedure (digital computer procedure). Current digital computer algorithms can be derived or designed with a Turing machine computational procedure. A novel class of computing machines is built where the purpose of the program's execution is difficult to apprehend (Turing incomputable). | ||||||
| 8 | SECURE ACTIVE ELEMENT MACHINE | EP12742528.8 | 2012-01-31 | EP2671182A2 | 2013-12-11 | FISKE, Michael |
| Based upon the principle of Turing incomputability, and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an Active Element Machine (AEM). AEM programs are designed so that the purpose of the computation is difficult to apprehend by an adversary and hijack with malware. These methods can help hinder reverse engineering of proprietary algorithms and hardware design. Using quantum randomness, the AEM can deterministically execute a universal digital computer program with active element firing patterns that are Turing incomputable. In some embodiments, a more powerful computational procedure is demonstrated than Turing's computational procedure (digital computer procedure). Current digital computer algorithms can be derived or designed with a Turing machine computational procedure. A novel class of computing machines is built where the purpose of the program's execution is difficult to apprehend (Turing incomputable). | ||||||
| 9 | Secure active element machine | US13373948 | 2011-12-06 | US20120198560A1 | 2012-08-02 | Michael Stephen Fiske |
| Based upon the principle of Turing incomputability, and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an Active Element Machine (AEM). AEM programs are designed so that the purpose of the computation is difficult to apprehend by an adversary and hijack with malware. These methods can help hinder reverse engineering of proprietary algorithms and hardware design.Using quantum randomness, the AEM can deterministically execute a universal digital computer program with active element firing patterns that are Turing incomputable. In some embodiments, a more powerful computational procedure is demonstrated than Turing's computational procedure (digital computer procedure). Current digital computer algorithms can be derived or designed with a Turing machine computational procedure. A novel class of computing machines is built where the purpose of the program's execution is difficult to apprehend (Turing incomputable). | ||||||
| 10 | Secure active element machine | US13373948 | 2011-12-06 | US09032537B2 | 2015-05-12 | Michael Stephen Fiske |
| Based upon the principle of Turing incomputability, and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an Active Element Machine (AEM). AEM programs are designed so that the purpose of the computation is difficult to apprehend by an adversary and hijack with malware. These methods can help hinder reverse engineering of proprietary algorithms and hardware design.Using quantum randomness, the AEM can deterministically execute a universal digital computer program with active element firing patterns that are Turing incomputable. In some embodiments, a more powerful computational procedure is demonstrated than Turing's computational procedure (digital computer procedure). Current digital computer algorithms can be derived or designed with a Turing machine computational procedure. A novel class of computing machines is built where the purpose of the program's execution is difficult to apprehend (Turing incomputable). | ||||||
QQ群二维码
意见反馈
意见反馈