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