Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

ISSN： 1570-0755

Source： Quantum Information Processing, Vol.10, Iss.3, 2011-06, pp. : 343-353

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On computing graph minor obstruction sets

By Cattell K. Dinneen M.J. Downey R.G. Fellows M.R. Langston M.A.

Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. : 107-127

Elsevier

Access to resources Recommend Favorite

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

By Demaine Erik D. Hajiaghayi Mohammad Taghi

Algorithmica, Vol. 40, Iss. 3, 2004-08 ,pp. : 211-215

Springer Publishing Company

Access to resources Recommend Favorite

Quantum Computation of Universal Link Invariants

By Garnerone Silvano

Open Systems and Information Dynamics, Vol. 13, Iss. 4, 2006-12 ,pp. : 373-382

Springer Publishing Company

Access to resources Recommend Favorite

A study of heuristic guesses for adiabatic quantum computation

By Perdomo-Ortiz Alejandro

Quantum Information Processing, Vol. 10, Iss. 1, 2011-02 ,pp. : 33-52

Springer Publishing Company

Access to resources Recommend Favorite

Associative Memory Design via Path Embedding into a Graph

By Müezzinoğlu Mehmet Kerem Güzeli Cüneyt

Neural Processing Letters, Vol. 19, Iss. 3, 2004-06 ,pp. : 205-209

Springer Publishing Company

Access to resources Recommend Favorite