Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph $${\mathcal {G}}$$ G : a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into $${\mathcal {G}}$$ G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph $$K_{N,N}$$ K N , N has a MSC of N minors, from which $$K_{N+1}$$ K N + 1 is identified as the largest clique minor of $$K_{N,N}$$ K N , N . The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

Loading next page...
 
/lp/springer_journal/identifying-the-minor-set-cover-of-dense-connected-bipartite-graphs-fKadWpUn59
Publisher
Springer US
Copyright
Copyright © 2017 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-016-1513-7
Publisher site
See Article on Publisher Site

Abstract

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph $${\mathcal {G}}$$ G : a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into $${\mathcal {G}}$$ G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph $$K_{N,N}$$ K N , N has a MSC of N minors, from which $$K_{N+1}$$ K N + 1 is identified as the largest clique minor of $$K_{N,N}$$ K N , N . The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.

Journal

Quantum Information ProcessingSpringer Journals

Published: Feb 23, 2017

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 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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