A Case for Multi-Programming Quantum Computers
The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
Existing and near-term quantum computers face significant reliability challenges because of high error rates caused by noise. Such machines are operated in the Noisy Intermediate Scale Quantum (NISQ) model of computing. As NISQ machines exhibit high error-rates, only programs that require a few qubits can be executed reliably. Therefore, NISQ machines tend to underutilize its resources. In this paper, we propose to improve the throughput and utilization of NISQ machines by using multi-programming and enabling the NISQ machine to concurrently execute multiple workloads.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 1×
“We are likely to see NISQ machines over the next decade and such machines are expected to solve important algorithms such as Quantum Approximate Optimization Algorithm (QAOA) [6] and Variational Quantum Eigensolver (VQE) [22, 30].”
MethodPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“Quantum computers can solve problems deemed hard on conventional computers [7, 11, 20, 32, 37].”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“Quantum computers can be protected against errors by leveraging Quantum Error Correction (QEC) codes [8, 10, 17], however, such codes require an overhead of 20x-100x (physical qubits per fault-tolerant qubit), so we are unlikely to see systems with such codes until the system reaches a capacity of several thousands of…”
BackgroundThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 2×
“Quantum computers can solve problems deemed hard on conventional computers [7, 11, 20, 32, 37].”
Background
Cited by
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
“Second, we would like to investigate the adaptation of such a mapping algorithm to a multiprogramming mechanism as introduced in [46].”
MethodTensorFlow Quantum: Impacts of Quantum State Preparation on Quantum Machine Learning Performance
Sierra-Sosa, D., Telahun, M., & Elmaghraby, A. (2020) · IEEE Access · doi:10.1109/access.2020.3040798 · Cited by 46
Patel, T., Potharaju, A., Li, B., Roy, R. B., & Tiwari, D. (2020) · SC20: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc41405.2020.00050 · Cited by 37
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19
Noise dynamics of quantum annealers: estimating the effective noise using idle qubits
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accbe6 · Cited by 12
Metadata
- Authors
- Das, P., Tannu, S. S., Nair, P. J., & Qureshi, M.
- Venue
- Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture
- Publisher
- ACM
- Published
- 2019-10-12
- Pages
- 291-303
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2979840408
- Cited by
- 123
- References
- 16
- FWCI
- 4.01
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Case for Multi-Programming Quantum Computers. https://app.cochat.ai/papers/10.1145/3352460.3358287
- The paper
- Das, P., Tannu, S. S., Nair, P. J., & Qureshi, M. (2019). A Case for Multi-Programming Quantum Computers. Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture. https://doi.org/10.1145/3352460.3358287
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.