Quantum boolean circuit construction and layout under locality constraint

I. Ming Tsai; Sy Yen Kuo

doi:10.1109/NANO.2001.966403

Quantum boolean circuit construction and layout under locality constraint

I. Ming Tsai, Sy Yen Kuo

National Taiwan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale device, has been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational boolean logic using elementary quantum gates. The quantum circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the circuit.

Original language	English
Title of host publication	Proceedings of the 2001 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001
Publisher	IEEE Computer Society
Pages	111-116
Number of pages	6
ISBN (Electronic)	0780372158
DOIs	https://doi.org/10.1109/NANO.2001.966403
State	Published - 2001
Externally published	Yes
Event	1st IEEE Conference on Nanotechnology, IEEE-NANO 2001 - Maui, United States Duration: 28 10 2001 → 30 10 2001

Publication series

Name	Proceedings of the IEEE Conference on Nanotechnology
Volume	2001-January
ISSN (Print)	1944-9399
ISSN (Electronic)	1944-9380

Conference

Conference	1st IEEE Conference on Nanotechnology, IEEE-NANO 2001
Country/Territory	United States
City	Maui
Period	28/10/01 → 30/10/01

Bibliographical note

Publisher Copyright:
© 2001 IEEE.

Access to Document

10.1109/NANO.2001.966403

Cite this

@inproceedings{ded3df1f136d493f8ed74fcb82f10b50,

title = "Quantum boolean circuit construction and layout under locality constraint",

abstract = "The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale device, has been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational boolean logic using elementary quantum gates. The quantum circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the circuit.",

author = "Tsai, \{I. Ming\} and Kuo, \{Sy Yen\}",

note = "Publisher Copyright: {\textcopyright} 2001 IEEE.; 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001 ; Conference date: 28-10-2001 Through 30-10-2001",

year = "2001",

doi = "10.1109/NANO.2001.966403",

language = "英语",

series = "Proceedings of the IEEE Conference on Nanotechnology",

publisher = "IEEE Computer Society",

pages = "111--116",

booktitle = "Proceedings of the 2001 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001",

address = "美国",

}

Tsai, IM & Kuo, SY 2001, Quantum boolean circuit construction and layout under locality constraint. in Proceedings of the 2001 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001., 966403, Proceedings of the IEEE Conference on Nanotechnology, vol. 2001-January, IEEE Computer Society, pp. 111-116, 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001, Maui, United States, 28/10/01. https://doi.org/10.1109/NANO.2001.966403

Quantum boolean circuit construction and layout under locality constraint. / Tsai, I. Ming; Kuo, Sy Yen.
Proceedings of the 2001 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001. IEEE Computer Society, 2001. p. 111-116 966403 (Proceedings of the IEEE Conference on Nanotechnology; Vol. 2001-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Quantum boolean circuit construction and layout under locality constraint

AU - Tsai, I. Ming

AU - Kuo, Sy Yen

PY - 2001

Y1 - 2001

N2 - The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale device, has been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational boolean logic using elementary quantum gates. The quantum circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the circuit.

AB - The discovery of Shor's prime factorization and Grover's fast database search algorithm have made quantum computing the most rapidly expanding research field recently. Nanotechnology, in particular silicon-based nanoscale device, has been proposed as one of the candidates that can be used to implement a quantum computer. In this paper, we have derived a systematic procedure to realize any general m-to-n bit combinational boolean logic using elementary quantum gates. The quantum circuit layout under the locality constraint is then formulated, together with the gate count evaluation function, to reduce the total number of quantum gates required to implement the circuit.

UR - https://www.scopus.com/pages/publications/57649145355

U2 - 10.1109/NANO.2001.966403

DO - 10.1109/NANO.2001.966403

M3 - 会议稿件

AN - SCOPUS:57649145355

T3 - Proceedings of the IEEE Conference on Nanotechnology

SP - 111

EP - 116

BT - Proceedings of the 2001 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001

PB - IEEE Computer Society

T2 - 1st IEEE Conference on Nanotechnology, IEEE-NANO 2001

Y2 - 28 October 2001 through 30 October 2001

ER -

Quantum boolean circuit construction and layout under locality constraint

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this