Challenges of adiabatic quantum evaluation of NAND trees

Challenges of adiabatic quantum evaluation of NAND trees The quantum adiabatic algorithm solves problems by evolving a known initial state towards the ground state of a Hamiltonian encoding the answer to a problem. Although continuous- and discrete-time quantum algorithms exist capable of evaluating tree graphs consisting of N vertexes in $$O(\sqrt{N})$$ O ( N ) time, a quadratic improvement over their classical counterparts, no quantum adiabatic procedure is known to exist. In this work, we present a study of the main issues and challenges surrounding quantum adiabatic evaluation of NAND trees. We focus on a number of issues ranging from: (1) mapping mechanisms; (2) spectrum analysis and remapping; (3) numerical evaluation of spectrum gaps; and (4) algorithmic procedures. These concepts are then used to provide numerical evidence for the existence of a $$\frac{N^{2}}{\log {N^{2}}}$$ N 2 log N 2 gap. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Challenges of adiabatic quantum evaluation of NAND trees

Loading next page...
 
/lp/springer_journal/challenges-of-adiabatic-quantum-evaluation-of-nand-trees-NCWD5v5ntq
Publisher
Springer Journals
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-1137-3
Publisher site
See Article on Publisher Site

Abstract

The quantum adiabatic algorithm solves problems by evolving a known initial state towards the ground state of a Hamiltonian encoding the answer to a problem. Although continuous- and discrete-time quantum algorithms exist capable of evaluating tree graphs consisting of N vertexes in $$O(\sqrt{N})$$ O ( N ) time, a quadratic improvement over their classical counterparts, no quantum adiabatic procedure is known to exist. In this work, we present a study of the main issues and challenges surrounding quantum adiabatic evaluation of NAND trees. We focus on a number of issues ranging from: (1) mapping mechanisms; (2) spectrum analysis and remapping; (3) numerical evaluation of spectrum gaps; and (4) algorithmic procedures. These concepts are then used to provide numerical evidence for the existence of a $$\frac{N^{2}}{\log {N^{2}}}$$ N 2 log N 2 gap.

Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 5, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off