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

DOI10.1007/s11128-018-2117-1zbMath1417.81102OpenAlexW2900823412WikidataQ128916490 ScholiaQ128916490MaRDI QIDQ669802

Chi Wang, Edmond A. 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 theoryquantum computingmachine learning algorithmsoptimal schedulingwireless application protocol

Mathematics Subject Classification ID

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

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Performance of two different quantum annealing correction codes
• Differential geometric treewidth estimation in adiabatic quantum computation
• Differential topology of adiabatically controlled quantum processes
• Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Ricci curvature of Markov chains on metric spaces
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Differential topology of numerical range
• Optimised simulated annealing for Ising spin glasses
• An augmentation algorithm for the maximum weighted stable set problem
• A case study in programming a quantum annealer for hard operational planning problems
• Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
• The quantum adiabatic optimization algorithm and local minima
• Quantum theory, the Church–Turing principle and the universal quantum computer
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The capacity of wireless networks
• Toward the first quantum simulation with quantum speedup
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Paths, Trees, and Flowers
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
• Reactive local search for the maximum clique problem

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