A Quantum Algorithm for the Hamiltonian NAND Tree

@article{Farhi2008AQA,
  title={A Quantum Algorithm for the Hamiltonian NAND Tree},
  author={Edward Farhi and Jeffrey Goldstone and Sam Gutmann},
  journal={Theory Comput.},
  year={2008},
  volume={4},
  pages={169-190}
}
We give a quantum algorithm for the binary NAND tree problem in the Hamil- tonian oracle model. The algorithm uses a continuous time quantum walk with a running time proportional to p N. We also show a lower bound of W( p N) for the NAND tree problem in the Hamiltonian oracle model. 

Discrete-Query Quantum Algorithm for NAND Trees

It is pointed out that the algorithm given by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann can be converted into an algorithm using N^[1/2 + o(1)] queries in the conventional (discrete) quantum query model.

A nearly optimal discrete query quantum algorithm for evaluating NAND formulas

We present an O(\sqrt{N}) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N^{{1/2}+O(\frac{1}{\sqrt{\log N}})}) discrete query quantum algorithm for evaluating

Universal computation by quantum walk.

It is shown that quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph, even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph.

Recent Developments in Quantum Algorithms and Complexity

This work surveys several recent developments in quantum algorithms and complexity, including Reichardt's characterization of quantum query algorithms via span programs and exact quantum algorithms with superlinear advantage over the best classical algorithm.

Quantum Random Walks - New Method for Designing Quantum Algorithms

This talk will describe the quantum walk method for designing search algorithms and show several of its applications.

Faster quantum algorithm for evaluating game trees

An O(√n log n)-query quantum algorithm for evaluating size-n AND-OR formulas and a novel tensor-product span program composition method, which generates graphs with vertices corresponding to minimal zero-certificates is given.

ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N ON A QUANTUM COMPUTER∗

A bounded-error quantum algorithm that solves the problem of evaluating an AND-OR formula on an N-bit black-box input in time N1/2+o(1) and in particular, approximately balanced formulas can be evaluated in O( √ N) queries, which is optimal.

Time independent universal computing with spin chains: quantum plinko machine

We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform

Quantum Proofs for Classical Theorems

This paper surveys results and the quantum toolbox they use in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations.

Efficient algorithms in quantum query complexity

These algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems and study the quantum query complexity of matrix multiplication and related problems over rings, semirings, and the Boolean semiring in particular.
...

References

SHOWING 1-10 OF 13 REFERENCES

Discrete-Query Quantum Algorithm for NAND Trees

It is pointed out that the algorithm given by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann can be converted into an algorithm using N^[1/2 + o(1)] queries in the conventional (discrete) quantum query model.

Lower Bounds on Quantum Query Complexity

This paper discusses here what quantum computers cannot do, and specifically how to prove limits on their computational power.

Quantum Algorithms for Evaluating Min-MaxTrees

A bounded-error quantum algorithm for evaluating Min - Max trees with N = 1 + o(1) queries, where N is the size of the tree and the allowable queries are comparisons of the form [x j k ].

Quantum computation and decision trees

This work devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree, and proves that if the classical strategy succeeds in reaching level $n$ in time polynomial in $n,$ then so does the quantum algorithm.

Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer

A bounded-error quantum algorithm that solves the problem of evaluating an AND-OR formula on an N-bit black-box input in time and in particular, approximately balanced formulas can be evaluated in O(\sqrt{N}) queries, which is optimal.

A lower bound on the quantum query complexity of read-once functions

  • H. BarnumM. Saks
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2002

Hamiltonian Oracles

A number of example Hamiltonian oracles are studied, including oracle interrogation and the problem of computing the xor of the hidden bits, which shows the problems require a query time proportional to n, even in the continuum limit.

Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer

It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.

Analog analogue of a digital quantum computation

We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system with a Hamiltonian of the form $E|w〉〈w|$ where $|w〉$

Strengths and Weaknesses of Quantum Computing

It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.