Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling

DOI10.1007/S11128-018-2117-1zbMATH Open1417.81102OpenAlexW2900823412WikidataQ128916490 ScholiaQ128916490MaRDI QIDQ669802FDOQ669802

Chi Wang, Edmond Jonckheere

Publication date: 15 March 2019

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

Full work available at URL: https://doi.org/10.1007/s11128-018-2117-1

zbMATH Keywords

simulated annealinggraph theoryoptimal schedulingquantum computingmachine learning algorithmswireless application protocol

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Searching and sorting (68P10) Quantum computation (81P68)

Cites Work

• Optimised simulated annealing for Ising spin glasses
• Optimization by Simulated Annealing
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Paths, Trees, and Flowers
• Ricci curvature of Markov chains on metric spaces
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Performance of two different quantum annealing correction codes
• Euclidean versus hyperbolic congestion in idealized versus experimental networks
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• An augmentation algorithm for the maximum weighted stable set problem
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• The capacity of wireless networks
• 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
• Reactive local search for the maximum clique problem
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Differential geometric treewidth estimation in adiabatic quantum computation
• The quantum adiabatic optimization algorithm and local minima
• Differential topology of numerical range
• Differential topology of adiabatically controlled quantum processes
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
• Title not available (Why is that?)
• A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
• Toward the first quantum simulation with quantum speedup
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• DIMACS

This page was built for publication: Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling

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