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
Authors: 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
Recommendations
- Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
- Quantum annealing versus digital computing. An experimental comparison
- Quantum annealing of hard problems
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- Benchmarking the quantum approximate optimization algorithm
simulated annealinggraph theoryoptimal schedulingquantum computingmachine learning algorithmswireless application protocol
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A case study in programming a quantum annealer for hard operational planning problems
- A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems
- An augmentation algorithm for the maximum weighted stable set problem
- Differential geometric treewidth estimation in adiabatic quantum computation
- Differential topology of adiabatically controlled quantum processes
- Differential topology of numerical range
- Euclidean versus hyperbolic congestion in idealized versus experimental networks
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
- Optimised simulated annealing for Ising spin glasses
- Optimization by simulated annealing
- Paths, Trees, and Flowers
- Performance of two different quantum annealing correction codes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Reactive local search for the maximum clique problem
- Ricci curvature of Markov chains on metric spaces
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
- The capacity of wireless networks
- The quantum adiabatic optimization algorithm and local minima
- Toward the first quantum simulation with quantum speedup
Cited In (2)
Uses Software
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)
