Differential geometric treewidth estimation in adiabatic quantum computation

DOI10.1007/S11128-016-1394-9zbMATH Open1348.81185OpenAlexW2502459817WikidataQ115381353 ScholiaQ115381353MaRDI QIDQ332093FDOQ332093

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

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

Recommendations

• Geodesic derivative in quantum circuit complexity analysis
• Differential geometry of quantum computation
• Bounds for the adiabatic approximation with applications to quantum computation
• A geometric approach to quantum circuit lower bounds
• Geometric quantum computing and dissipation models
• The complexity of the quantum adiabatic algorithm
• A near-quadratic lower bound for the size of quantum circuits of constant treewidth
• Geometric quantum computation
• The geometry of quantum computation
• Quantum computational geodesics

zbMATH Keywords

treewidthadiabatic quantum computationChimera architectureminor embeddingOllivier-Ricci curvature

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Optimal Transport
• Title not available (Why is that?)
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Ricci curvature of Markov chains on metric spaces
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Graph minors. XIII: The disjoint paths problem
• Adiabatic quantum programming: minor embedding with hard faults
• Euclidean versus hyperbolic congestion in idealized versus experimental networks
• Title not available (Why is that?)
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• On Exact Algorithms for Treewidth
• Treewidth. Computations and approximations
• Algorithmic Aspects of Vertex Elimination on Graphs
• Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
• A case study in programming a quantum annealer for hard operational planning problems
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• Treewidth computations. I: Upper bounds
• A spectral lower bound for the treewidth of a graph and its consequences
• Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
• The elimination form of the inverse and its application to linear programming
• Treewidth: computational experiments
• Asymptotic modularity of some graph classes
• The Structure and Number of Obstructions to Treewidth
• On the Complexity of Computing Treelength
• Title not available (Why is that?)
• A survey of Ricci curvature for metric spaces and Markov chains
• Faster parameterized algorithms for minor containment

Cited In (3)

• Emergence of the circle in a statistical model of random cubic graphs
• Efficiently embedding QUBO problems on adiabatic quantum computers
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling

Uses Software

• EMD
• LibTW

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332093)