Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing We construct a nearest-neighbor interaction whose ground states encode the solutions to the NP-complete problem “independent set” for cubic planar graphs. The important difference to previously used Hamiltonians in adiabatic quantum computing is that our Hamiltonian is spatially local. Due to its special structure our Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by “physically reasonable” Hamiltonians like short-range interactions. Therefore, this “universal resource Hamiltonian” can be used for different graphs by applying suitable control operations. This is in contrast to a previous proposal where the Hamiltonians have to be wired in hardware for each graph. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing

Loading next page...
 
/lp/springer_journal/treating-the-independent-set-problem-by-2d-ising-interactions-with-J7NQEg7bNM
Publisher
Springer Journals
Copyright
Copyright © 2003 by Plenum Publishing Corporation
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.1023/B:QINP.0000020075.20455.5f
Publisher site
See Article on Publisher Site

Abstract

We construct a nearest-neighbor interaction whose ground states encode the solutions to the NP-complete problem “independent set” for cubic planar graphs. The important difference to previously used Hamiltonians in adiabatic quantum computing is that our Hamiltonian is spatially local. Due to its special structure our Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by “physically reasonable” Hamiltonians like short-range interactions. Therefore, this “universal resource Hamiltonian” can be used for different graphs by applying suitable control operations. This is in contrast to a previous proposal where the Hamiltonians have to be wired in hardware for each graph.

Journal

Quantum Information ProcessingSpringer Journals

Published: Oct 11, 2004

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