Differential geometric treewidth estimation in adiabatic quantum computation

DOI10.1007/s11128-016-1394-9zbMath1348.81185OpenAlexW2502459817WikidataQ115381353 ScholiaQ115381353MaRDI QIDQ332093

Chi Wang, Todd A. Brun, Edmond A. Jonckheere

Publication date: 27 October 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-016-1394-9

zbMATH Keywords

treewidthadiabatic quantum computationChimera architectureminor embeddingOllivier-Ricci curvature

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ Emergence of the circle in a statistical model of random cubic graphs

Uses Software

• EMD
• LibTW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Faster parameterized algorithms for minor containment
• Treewidth computations. I: Upper bounds
• Ricci curvature of Markov chains on metric spaces
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• A spectral lower bound for the treewidth of a graph and its consequences
• Treewidth. Computations and approximations
• Graph minors. XIII: The disjoint paths problem
• A case study in programming a quantum annealer for hard operational planning problems
• Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
• Adiabatic quantum programming: minor embedding with hard faults
• The Elimination form of the Inverse and its Application to Linear Programming
• Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
• Asymptotic Modularity of Some Graph Classes
• The Structure and Number of Obstructions to Treewidth
• On the Complexity of Computing Treelength
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• On Exact Algorithms for Treewidth
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Optimal Transport

This page was built for publication: Differential geometric treewidth estimation in adiabatic quantum computation