Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1806.10682 · Quantum Science and Technology

Molecular realization of a quantum NAND tree

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

Published Nov 20, 2018• 9 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/2058-9565/aaf24b

Related papers

Discrete-query quantum algorithm for NAND trees

Andrew M. Childs, Richard Cleve, Stephen P. Jordan +1 more

Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating nand trees that runs in time O ( √ N log N) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using O(N 1/2+ǫ) queries in the conventional quantum query model, for any fixed ǫ> 0. A nand tree of depth n is a balanced binary tree whose internal vertices represent nand gates. Placing bits x1,...,x2 n at the leaves, the root of the nand tree evaluates to the function fn(x1,...,x2 n), where fn: {0, 1} 2n → {0, 1} is defined recursively as follows. For n = 0, f0(x) = x, and for n> 0, fn(x1,..., x2 n) = ¬ ( fn−1(x1,..., x 2 n−1) ∧ fn−1(x 2 n−1 +1,...,x2 n)). (1) The goal of the nand tree problem is to evaluate fn(x1,..., x2 n), making as few queries to the bits x1,..., x2 n as possible. The optimal classical randomized algorithm for this problem makes Θ(N 0.753) queries, where N = 2 n [7, 8, 9]. Until now, no better quantum algorithm was known, whereas the best known quantum lower bound is only Ω ( √ N) [1]. Here we show that for any fixed ǫ> 0, the quantum query complexity of evaluating nand trees is O(N 1/2+ǫ).

•Feb 16, 2007•55 citations

A New Type of Classical Logic Circuit with Exponential Speedup

Yingji Zhang, Tian Chen, Xiaoxue Tong +2 more

Compared with classical algorithms, quantum algorithms can show the advantage of exponential speedup in solving some problems. Solving the NAND‐Tree problem is a typical example, which can be speed up exponentially by quantum walk. This scheme is groundbreaking due to the universality of the negative‐AND (NAND) gate. In fact, the NAND gate is also universal for classical computation, making it an important target for development. Herein, the quantum NAND‐Tree onto the classical circuit network is mapped and a new type of classical logic circuit with the NAND gate that can perform the quantum algorithms is designed. These classical logic gates that are designed have exponential speedup functions compared with conventional ones. Because classical circuit networks possess good scalability and stability, the present scheme is expected to have potential applications for information processing in the era of big data.

Advanced Intelligent Systems•Jan 19, 2023•8 citations

A quantum dot implementation of the quantum NAND algorithm

Jacob M. Taylor

We propose a physical implementation of the quantum NAND tree evaluation algorithm. Our approach, based on continuous time quantum walks, uses the wave interference of a single electron in a heirarchical set of tunnel coupled quantum dots. We find that the query complexity of the NAND tree evaluation does not suffer strongly from disorder and dephasing, nor is it directly limited by temperature or restricted dimensionality for 2-d structures. Finally, we suggest a potential application of this algorithm to the efficient determination of high-order correlation functions of complex quantum systems.

arXiv:0708.1484•Aug 10, 2007•2 citations

Quantum Computing for Chemistry: From Quantum Computing with Molecules to Algorithmic Design

Phillip W. K. Jensen

Determining properties of molecules and materials is one of the premier applications of quantum computing. A major question in the thesis is: how might we use long- and near-term quantum computers to solve problems of chemical interest? First, we give an overview of the standard model in electronic structure theory. Electronic structure methods have been improved significantly in the last decades; however, it is still a non-trivial task to fit experimental results for complex molecular systems. Second, we introduce quantum computation and quantum algorithms as an alternative device to solve the electronic structure problem. In the remaining part of the thesis, we describe the research projects. The thesis covers two (rather different) research directions: software and hardware projects. For the software part, we contribute with two new algorithms: Phase-Estimation Interval Target Energy Readout (PHILTER) and Recursive Variational Series Estimation (RVSE), where both are designed to be run on a quantum digital computer and extract materials and molecular properties. The PHILTER algorithm is a modification of the Quantum Phase Estimation and is designed to compute excited state energies within a target energy-interval for cases where good approximations for the states in the target energy-interval are either unknown or hard to prepare. For the RVSE algorithm, we pose the question: how might we use imperfect near-term quantum computers to solve problems of practical value? In this work, we introduce a method to compute expectation values of general functions of a Hamiltonian with respect to an input state using low depth quantum circuits suitable for noisy intermediate-scale quantum computers. For the hardware part, we propose a new chemical quantum computer by using molecular electronics as a basis for quantum computing. In this work, we pose the question: can scattering of electrons in molecules produce quantum gates? We construct one-qubit gates using one-electron scattering in molecules, and two-qubit controlled-phase gates using electron-electron scattering along metallic leads. We show initial applications of the framework by illustrating one-qubit gates using the molecular electronic structure of molecular hydrogen as a baseline model.

•Nov 1, 2022•0 citations

A Quantum Algorithm for the Hamiltonian NAND Tree

Edward Farhi, Jeffrey Goldstone, Sam Gutmann

We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a run time proportional to sqrt N. We also show a lower bound of sqrt N for the NAND tree problem in the Hamiltonian oracle model.

arXiv:quant-ph/0702144•Feb 14, 2007•169 citations

Efficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning

Thomas Mullor, David Vigouroux, Louis Béthune

Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easily readable, executable on circuit based quantum computers and simulators and optimal on the usage of resources. We propose a strategy to compose quantum circuit that performs quantum walk on binary trees following universal gate model quantum computation principles. We give a particular attention to NAND formula evaluation algorithm as it could have many applications in game theory and reinforcement learning. We therefore propose an application of this algorithm and show how it can be used to train a quantum reinforcement learning agent in a two player game environment.

arXiv:2210.06784•IEEE/ACM Symposium on Edge Computing (SEC)•Dec 1, 2022•2 citations
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.
Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating nand trees that runs in time O ( √ N log N) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using O(N 1/2+ǫ) queries in the conventional quantum query model, for any fixed ǫ> 0. A nand tree of depth n is a balanced binary tree whose internal vertices represent nand gates. Placing bits x1,...,x2 n at the leaves, the root of the nand tree evaluates to the function fn(x1,...,x2 n), where fn: {0, 1} 2n → {0, 1} is defined recursively as follows. For n = 0, f0(x) = x, and for n> 0, fn(x1,..., x2 n) = ¬ ( fn−1(x1,..., x 2 n−1) ∧ fn−1(x 2 n−1 +1,...,x2 n)). (1) The goal of the nand tree problem is to evaluate fn(x1,..., x2 n), making as few queries to the bits x1,..., x2 n as possible. The optimal classical randomized algorithm for this problem makes Θ(N 0.753) queries, where N = 2 n [7, 8, 9]. Until now, no better quantum algorithm was known, whereas the best known quantum lower bound is only Ω ( √ N) [1]. Here we show that for any fixed ǫ> 0, the quantum query complexity of evaluating nand trees is O(N 1/2+ǫ).
Compared with classical algorithms, quantum algorithms can show the advantage of exponential speedup in solving some problems. Solving the NAND‐Tree problem is a typical example, which can be speed up exponentially by quantum walk. This scheme is groundbreaking due to the universality of the negative‐AND (NAND) gate. In fact, the NAND gate is also universal for classical computation, making it an important target for development. Herein, the quantum NAND‐Tree onto the classical circuit network is mapped and a new type of classical logic circuit with the NAND gate that can perform the quantum algorithms is designed. These classical logic gates that are designed have exponential speedup functions compared with conventional ones. Because classical circuit networks possess good scalability and stability, the present scheme is expected to have potential applications for information processing in the era of big data.
We propose a physical implementation of the quantum NAND tree evaluation algorithm. Our approach, based on continuous time quantum walks, uses the wave interference of a single electron in a heirarchical set of tunnel coupled quantum dots. We find that the query complexity of the NAND tree evaluation does not suffer strongly from disorder and dephasing, nor is it directly limited by temperature or restricted dimensionality for 2-d structures. Finally, we suggest a potential application of this algorithm to the efficient determination of high-order correlation functions of complex quantum systems.
Determining properties of molecules and materials is one of the premier applications of quantum computing. A major question in the thesis is: how might we use long- and near-term quantum computers to solve problems of chemical interest? First, we give an overview of the standard model in electronic structure theory. Electronic structure methods have been improved significantly in the last decades; however, it is still a non-trivial task to fit experimental results for complex molecular systems. Second, we introduce quantum computation and quantum algorithms as an alternative device to solve the electronic structure problem. In the remaining part of the thesis, we describe the research projects. The thesis covers two (rather different) research directions: software and hardware projects. For the software part, we contribute with two new algorithms: Phase-Estimation Interval Target Energy Readout (PHILTER) and Recursive Variational Series Estimation (RVSE), where both are designed to be run on a quantum digital computer and extract materials and molecular properties. The PHILTER algorithm is a modification of the Quantum Phase Estimation and is designed to compute excited state energies within a target energy-interval for cases where good approximations for the states in the target energy-interval are either unknown or hard to prepare. For the RVSE algorithm, we pose the question: how might we use imperfect near-term quantum computers to solve problems of practical value? In this work, we introduce a method to compute expectation values of general functions of a Hamiltonian with respect to an input state using low depth quantum circuits suitable for noisy intermediate-scale quantum computers. For the hardware part, we propose a new chemical quantum computer by using molecular electronics as a basis for quantum computing. In this work, we pose the question: can scattering of electrons in molecules produce quantum gates? We construct one-qubit gates using one-electron scattering in molecules, and two-qubit controlled-phase gates using electron-electron scattering along metallic leads. We show initial applications of the framework by illustrating one-qubit gates using the molecular electronic structure of molecular hydrogen as a baseline model.
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easily readable, executable on circuit based quantum computers and simulators and optimal on the usage of resources. We propose a strategy to compose quantum circuit that performs quantum walk on binary trees following universal gate model quantum computation principles. We give a particular attention to NAND formula evaluation algorithm as it could have many applications in game theory and reinforcement learning. We therefore propose an application of this algorithm and show how it can be used to train a quantum reinforcement learning agent in a two player game environment.