Cited by 39Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

The Useful Quantum Computing Techniques for Artificial Intelligence Engineers

Choi, Jaeho, Oh, Seunghyeok, Kim, Joongheon·2020·2020 International Conference on Information Networking (ICOIN)

Abstract

The hottest topics for many researchers in the past five years were Artificial Intelligence (AI) and machine learning. With many kinds of researches using machine learning, numerous AI engineers are still emerging. If the center of current research trends is on AI and machine learning, the center of near-future research trends will be on quantum computing techniques. The qubit implementation via superconductivity, diamond NitrogenVacancy (NV) center, ion-trap, and etc. has made quantum computers really exist. And cloud computing has made it possible for researchers around the world to use quantum computers remotely to their researches. The universalization of quantum computing techniques is no longer a story of the distant future, even more so for numerous AI engineers. This paper introduces some useful quantum computing techniques for AI engineers such as Quadratic Unconstrained Binary Optimization (QUBO), Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Harrow-Hassidim-Lloyd (HHL) algorithm.

Integrity signals

Registry

Crossref · 10.1109/icoin48656.2020.9016555

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The most prominent problem formulations for CO on quantum computers are the Ising-model and the equivalent Quadratic Unconstrained Binary Optimization (QUBO) model.

    “The most prominent problem formulations for CO on quantum computers are the Ising-model [189] and the equivalent Quadratic Unconstrained Binary Optimization (QUBO) model [53, 150, 173].”

Cites

Flagged first, then by citations

4 of the 25 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Choi, J., Oh, S., & Kim, J.
Affiliations
  • Chung-Ang University (KR)
  • Korea University (KR)
Venue
2020 International Conference on Information Networking (ICOIN)
Publisher
IEEE
Published
2020-01
Pages
1-3
ISSN
1976-7684 (ISSN-L)
OpenAlex
W3010468967
Cited by
39
References
25
Citations by year
2025: 6 · 2024: 9 · 2023: 9 · 2022: 5 · 2021: 9 · 2020: 1
FWCI
2.29
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Information Networking (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum computing, artificial intelligence, machine learning, superconducting qubits, nitrogen-vacancy centers, cloud quantum computing, QUBO, variational quantum eigensolver, quantum approximate optimization algorithm, Harrow-Hassidim-Lloyd algorithm, quantum machine learning

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