2018/06/30 by Phillip W. K. Jensen, Phillip W K Jensen, Chengjun Jin +4 · 8 citations
Computer Science · Engineering · Physics and Astronomy · #Controlled NOT gate #Molecular Junctions and Nanostructures #NAND gate #Quantum #Quantum Computing Algorithms and Architecture #Quantum algorithm #Quantum circuit #Quantum computer #Quantum error correction #Quantum gate #Quantum-Dot Cellular Automata #Realization (probability) #physics.chem-ph #quant-ph
paper · pdf · doi:10.1088/2058-9565/aaf24b
published in Quantum Science and Technology 4(1), 015013 (IOP Publishing) · 17 pages, 6 figures, 1 table
openalex created_date 2018/07/10 · openalex publication_date 2018/11/20 · arxiv created 2018/12/27 · arxiv updated 2018/12/31 · openalex updated_date 2026/08/05
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.