IEICE TRANSACTIONS on Electronics
Analog Computation Using Quantum Structures--A Promising Computation Architecture for Quantum Processors--
Summary :
Analog computation is a processing method that solves problems utilizing an analogy of a physical system to the problem. As it is based on actual physical effects and not on symbolic operations, it is therefore a promising architecture for quantum processors. This paper presents an idea for relating quantum structures with analog computation. As an instance, a method is proposed for solving an NP-complete (nondeterminis-tic polynomial time complete) problem, the three-color-map problem, by using a quantum-cell circuit. The computing process is parallel and instantaneous, so making it possible to obtain the solution in a short time regardless of the size of the problem.
- Publication
- IEICE TRANSACTIONS on Electronics Vol.E79-C No.11 pp.1481-1486
- Publication Date
- 1996/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section INVITED PAPER (Special Issue on Quantum Effect Devices and Their Fabrication Technologies)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoshihito AMEMIYA, "Analog Computation Using Quantum Structures--A Promising Computation Architecture for Quantum Processors--" in IEICE TRANSACTIONS on Electronics,
vol. E79-C, no. 11, pp. 1481-1486, November 1996, doi: .
Abstract: Analog computation is a processing method that solves problems utilizing an analogy of a physical system to the problem. As it is based on actual physical effects and not on symbolic operations, it is therefore a promising architecture for quantum processors. This paper presents an idea for relating quantum structures with analog computation. As an instance, a method is proposed for solving an NP-complete (nondeterminis-tic polynomial time complete) problem, the three-color-map problem, by using a quantum-cell circuit. The computing process is parallel and instantaneous, so making it possible to obtain the solution in a short time regardless of the size of the problem.
URL: https://global.ieice.org/en_transactions/electronics/10.1587/e79-c_11_1481/_p
Copy
@ARTICLE{e79-c_11_1481,
author={Yoshihito AMEMIYA, },
journal={IEICE TRANSACTIONS on Electronics},
title={Analog Computation Using Quantum Structures--A Promising Computation Architecture for Quantum Processors--},
year={1996},
volume={E79-C},
number={11},
pages={1481-1486},
abstract={Analog computation is a processing method that solves problems utilizing an analogy of a physical system to the problem. As it is based on actual physical effects and not on symbolic operations, it is therefore a promising architecture for quantum processors. This paper presents an idea for relating quantum structures with analog computation. As an instance, a method is proposed for solving an NP-complete (nondeterminis-tic polynomial time complete) problem, the three-color-map problem, by using a quantum-cell circuit. The computing process is parallel and instantaneous, so making it possible to obtain the solution in a short time regardless of the size of the problem.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Analog Computation Using Quantum Structures--A Promising Computation Architecture for Quantum Processors--
T2 - IEICE TRANSACTIONS on Electronics
SP - 1481
EP - 1486
AU - Yoshihito AMEMIYA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Electronics
SN -
VL - E79-C
IS - 11
JA - IEICE TRANSACTIONS on Electronics
Y1 - November 1996
AB - Analog computation is a processing method that solves problems utilizing an analogy of a physical system to the problem. As it is based on actual physical effects and not on symbolic operations, it is therefore a promising architecture for quantum processors. This paper presents an idea for relating quantum structures with analog computation. As an instance, a method is proposed for solving an NP-complete (nondeterminis-tic polynomial time complete) problem, the three-color-map problem, by using a quantum-cell circuit. The computing process is parallel and instantaneous, so making it possible to obtain the solution in a short time regardless of the size of the problem.
ER -
English
