QUANTUM ADDER OF CLASSICAL NUMBERS

被引：1

作者：

Cherkas, A. V. ^{[1
]}

Chivilikhin, S. A. ^{[1
]}

机构：

[1] ITMO Univ, St Petersburg, Russia

来源：

INTERNATIONAL CONFERENCE OF YOUNG SCIENTISTS AND SPECIALISTS OPTICS-2015 | 2016年 / 735卷

关键词：

D O I：

10.1088/1742-6596/735/1/012083

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

In this article we show the precise algorithm of functioning of quantum adder on the example of addition of two 2-bit numbers. It consists of the quantum Fourier transformer and conditional rotation gates that let us use the minimum number of qubits to get the addition realization of the sum. Despite the fact that the algorithm uses the minimum amount of operations this accelerates the process of the adder.

引用

页数：4

共 7 条

[1] Efficient networks for quantum factoring
Beckman, D
Chari, AN
Devabhaktuni, S
Preskill, J
[J]. PHYSICAL REVIEW A, 1996, 54 (02): : 1034 - 1063
[2] RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION
DEUTSCH, D
JOZSA, R
[J]. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907): : 553 - 558
[3] QUANTUM-THEORY, THE CHURCH-TURING PRINCIPLE AND THE UNIVERSAL QUANTUM COMPUTER
DEUTSCH, D
[J]. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1985, 400 (1818): : 97 - 117
[4] Gossett P., 1998, ARXIVQUANTPH9808061
[5] Factoring in a dissipative quantum computer
Miquel, C
Paz, JP
Perazzo, R
[J]. PHYSICAL REVIEW A, 1996, 54 (04): : 2605 - 2613
[6] Quantum networks for elementary arithmetic operations
Vedral, V
Barenco, A
Ekert, A
[J]. PHYSICAL REVIEW A, 1996, 54 (01) : 147 - 153
[7] Zalka C, 1998, ARXIVQUANTPH9806084

← 1 →