Network Community Detection on Small Quantum Computers
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. The proposed approach is applied to the network community detection problem. QLS is hardware‐agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2‐community detection problem on graphs of sizes of up to 410 vertices using the 16‐qubit IBM quantum computer and D‐Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state‐of‐the‐art solvers in terms of quality of the solution including reaching the optimal solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Romero, J., Babbush, R., McClean, J. R., Hempel, C., Love, P. J., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/aad3e4 · Cited by 726
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
A quantum-inspired classical algorithm for recommendation systems
Tang, E. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316310 · Cited by 360
Quantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337 · cited 1×
“optimization algorithm (QAOA) for a similar problem (max-cut) requires at least several hundred qubits [3].”
MethodQuantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Distributed secure quantum machine learning
Sheng, Y.-B., & Zhou, L. (2017) · Science Bulletin · doi:10.1016/j.scib.2017.06.007 · Cited by 245
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206653 · Cited by 140 · cited 1×
“IARPA’s QEO effort [30] and other researchers [31] have achieved a lot of progress in developing a system implementing QA [28] and applying it to a variety of problems, including optimization problems on graphs [20], machine learning [32], traffic flow optimization [33], and simulation problems [34].”
BackgroundDetecting multiple communities using quantum annealing on the D-Wave system
Negre, C. F. A., Ushijima-Mwesigwa, H., & Mniszewski, S. M. (2020) · PLOS ONE · doi:10.1371/journal.pone.0227538 · Cited by 80
Self-citationQuantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays
Pichler, H., Wang, S.-T., Zhou, L., Choi, S., & Lukin, M. D. (2018) · arXiv · doi:10.48550/arxiv.1808.10816 · Cited by 35
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
Cited by
XY mixers: Analytical and numerical results for the quantum alternating operator ansatz
Wang, Z., Rubin, N. C., Dominy, J. M., & Rieffel, E. G. (2020) · Physical Review A · doi:10.1103/physreva.101.012320 · Cited by 190
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., & Balaprakash, P. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i03.5616 · Cited by 117
Self-citationMultistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
Self-citationLayer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3140190 · Cited by 78
“Community detection has been extensively studied classically [41], [48], as well as by using the D-Wave quantum annealer [49]–[52] and QAOA [50], [52], [53].”
MethodSelf-citationTransferability of optimal QAOA parameters between random graphs
Galda, A., Liu, X., Lykov, D., Alexeev, Y., & Safro, I. (2021) · 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00034 · Cited by 72
Self-citation
Metadata
- Authors
- Shaydulin, R., Ushijima‐Mwesigwa, H., Safro, I., Mniszewski, S., & Alexeev, Y.
- Venue
- Advanced Quantum Technologies
- Publisher
- Wiley
- Published
- 2019-06-03
- Volume
- 2
- Issue
- 9
- ISSN
- 2511-9044 (ISSN-L)
- OpenAlex
- W2898784085
- Cited by
- 56
- References
- 17
- FWCI
- 4.14
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.