Cited by 44Quantum Computing Algorithms and ArchitectureAdvanced Wireless Network OptimizationQuantum Information and Cryptography

Quantum Approximation for Wireless Scheduling

Open access
Choi, Jaeho, Oh, Seunghyeok, Kim, Joongheon·2020·Applied Sciences

Abstract

This paper proposes an application algorithm based on a quantum approximate optimization algorithm (QAOA) for wireless scheduling problems. QAOA is one of the promising hybrid quantum-classical algorithms to solve combinatorial optimization problems and it provides great approximate solutions to non-deterministic polynomial-time (NP) hard problems. QAOA maps the given problem into Hilbert space, and then it generates the Hamiltonian for the given objective and constraint. Then, QAOA finds proper parameters from the classical optimization loop in order to optimize the expectation value of the generated Hamiltonian. Based on the parameters, the optimal solution to the given problem can be obtained from the optimum of the expectation value of the Hamiltonian. Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS) algorithm is proposed. The proposed QAOS designs the Hamiltonian of the wireless scheduling problem which is formulated by the maximum weight independent set (MWIS). The designed Hamiltonian is converted into a unitary operator and implemented as a quantum gate operation. After that, the iterative QAOS sequence solves the wireless scheduling problem. The novelty of QAOS is verified with simulation results implemented via Cirq and TensorFlow-Quantum.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/app10207116

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Standard QAOA has been applied to the cluster head selection problem, the wireless scheduling problem, the vehicle routing problem, multi-coloring graph problems, the graph isomorphism problem, and a satellite scheduling problem.

    “Standard QAOA has been applied to: the cluster head selection problem [28], the wireless scheduling problem [29], the vehicle routing problem [14], multi-coloring graph problems [104], the graph isomorphism problem [66], and a satellite scheduling problem [128].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. Farhi, E.; Goldstone, J.; Gutmann, S. A Quantum Approximate Optimization Algorithm. arXiv 2014, arXiv:1411.4028. · arXiv
  2. Hadfield, S. On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing. arXiv 2018, arXiv:1804.09130. · arXiv
  3. Broughton, M.; Verdon, G.; McCourt, T.; Martinez, A.; Yoo, J.; Isakov, S.V.; Massey, P.; Niu, M.Y.; Halavati, R.; Peters, E.; et al. TensorFlow Quantum: A Software Framework for Quantum Machine Learning. arXiv 2020, arXiv:2003.02989. · arXiv
  4. Kingma, D.P.; Ba, J. Adam: A Method for Stochastic Optimization. arXiv 2014, arXiv:1412.6980. · arXiv
  5. Farhi, E.; Harrow, A.W. Quantum Supremacy through the Quantum Approximate Optimization Algorithm. arXiv 2016, arXiv:1602.07674. · arXiv
  6. Bravyi, S.; Gosset, D.; König, R. Quantum Advantage with Shallow Circuits. Science 2018, 362, 308-311.

Cited by

Sorted by citations

Authors
Choi, J., Oh, S., & Kim, J.
Affiliations
  • Chung-Ang University (KR)
  • Korea University (KR)
Corresponding author
Kim, Joongheon
Venue
Applied Sciences
Publisher
MDPI AG
Published
2020-10-13
Volume
10
Issue
20
Pages
7116
ISSN
2076-3417 (ISSN-L)
OpenAlex
W3127021372
Cited by
44
References
28
Citations by year
2026: 9 · 2025: 9 · 2024: 6 · 2023: 7 · 2022: 6 · 2021: 7
FWCI
1.96
Type
journal article
Language
en
Open access
Locations
  • Applied Sciences (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • National Research Foundation
  • National Research Foundation of Korea (2019M3E3A1084054, NRF-2019M3E3A1084054, 2019M3E4A1080391)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum approximate optimization algorithm, wireless scheduling, maximum weight independent set, hybrid quantum-classical algorithms, combinatorial optimization, Hamiltonian design, quantum gate implementation, NP-hard problems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review