Molecular realization of a quantum NAND tree

Phillip W. K. Jensen; Chengjun Jin; Pierre-Luc Dallaire-Demers; Alán Aspuru-Guzik; Gemma C. Solomon

doi:10.1088/2058-9565/aaf24b

Molecular realization of a quantum NAND tree

Phillip W. K. Jensen, Chengjun Jin, Pierre-Luc Dallaire-Demers, Alán Aspuru-Guzik, Gemma C. Solomon

Department of Chemistry

3 Citations (Scopus)

Abstract

The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green's function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.

Original language	English
Article number	015013
Journal	Quantum Science and Technology
Volume	4
Issue number	1
Number of pages	9
DOIs	https://doi.org/10.1088/2058-9565/aaf24b
Publication status	Published - Jan 2019

Keywords

unimolecular electronics
transmission logic gates
quantum computing
quantum scattering
non-equilibrium Green's function

Access to Document

10.1088/2058-9565/aaf24b

Cite this

@article{c570fe55599445a9a7ffc4907acb5e02,

title = "Molecular realization of a quantum NAND tree",

abstract = "The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green's function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.",

keywords = "unimolecular electronics, transmission logic gates, quantum computing, quantum scattering, non-equilibrium Green's function",

author = "Jensen, {Phillip W. K.} and Chengjun Jin and Pierre-Luc Dallaire-Demers and Al{\'a}n Aspuru-Guzik and Solomon, {Gemma C.}",

year = "2019",

month = jan,

doi = "10.1088/2058-9565/aaf24b",

language = "English",

volume = "4",

journal = "Quantum Science and Technology",

issn = "2058-9565",

publisher = "Institute of Physics Publishing",

number = "1",

}

TY - JOUR

T1 - Molecular realization of a quantum NAND tree

AU - Jensen, Phillip W. K.

AU - Jin, Chengjun

AU - Dallaire-Demers, Pierre-Luc

AU - Aspuru-Guzik, Alán

AU - Solomon, Gemma C.

PY - 2019/1

Y1 - 2019/1

N2 - The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green's function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.

AB - The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum scattering yielding a quantum algorithm that evaluates the output faster than any classical algorithm. Here, we derive the NAND outputs analytically from scattering theory using a tight-binding (TB) model and show the restrictions on the TB parameters in order to still maintain the NAND gate function. We map the quantum NAND tree onto a conjugated molecular system, and compare the NAND output with non-equilibrium Green's function transport calculations using density functional theory and TB Hamiltonians for the electronic structure. Further, we extend our molecular platform to show other classical gates that can be realized for quantum computing by scattering on graphs.

KW - unimolecular electronics

KW - transmission logic gates

KW - quantum computing

KW - quantum scattering

KW - non-equilibrium Green's function

U2 - 10.1088/2058-9565/aaf24b

DO - 10.1088/2058-9565/aaf24b

M3 - Journal article

SN - 2058-9565

VL - 4

JO - Quantum Science and Technology

JF - Quantum Science and Technology

IS - 1

M1 - 015013

ER -

Molecular realization of a quantum NAND tree

Abstract

Keywords

Access to Document

Fingerprint

Cite this