The DOI matches its Crossref record; 229 of the 229 references it cites were found in a registry or an index.
Quantum computing: A taxonomy, systematic review and future directions
Open accessAbstract
Quantum computing (QC) is an emerging paradigm with the potential to offer significant computational advantage over conventional classical computing by exploiting quantum‐mechanical principles such as entanglement and superposition. It is anticipated that this computational advantage of QC will help to solve many complex and computationally intractable problems in several application domains such as drug design, data science, clean energy, finance, industrial chemical development, secure communications, and quantum chemistry. In recent years, tremendous progress in both quantum hardware development and quantum software/algorithm has brought QC much closer to reality. Indeed, the demonstration of quantum supremacy marks a significant milestone in the Noisy Intermediate Scale Quantum (NISQ) era—the next logical step being the quantum advantage whereby quantum computers solve a real‐world problem much more efficiently than classical computing. As the quantum devices are expected to steadily scale up in the next few years, quantum decoherence and qubit interconnectivity are two of the major challenges to achieve quantum advantage in the NISQ era. QC is a highly topical and fast‐moving field of research with significant ongoing progress in all facets. A systematic review of the existing literature on QC will be invaluable to understand the state‐of‐the‐art of this emerging field and identify open challenges for the QC community to address in the coming years. This article presents a comprehensive review of QC literature and proposes taxonomy of QC. The proposed taxonomy is used to map various related studies to identify the research gaps. A detailed overview of quantum software tools and technologies, post‐quantum cryptography, and quantum computer hardware development captures the current state‐of‐the‐art in the respective areas. The article identifies and highlights various open challenges and promising future directions for research and innovation in QC.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Items 201–229 of 229
Creating a Challenge for Ideal Lattices.
Plantard, T., & Schneider, M. (2013) · Cited by 15
Classical Control of Large-Scale Quantum Computers
Devitt, S. J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08494-7_3 · Cited by 14
Nearly Optimal Pseudorandomness From Hardness
Doron, D., Moshkovitz, D., Oh, J., & Zuckerman, D. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00102 · Cited by 14
Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dotPreprint
Fedichkin, L. E., Yanchenko, M., & Valiev, K. A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0006097 · Cited by 12
Synthesis of Flexible Accelerators for Early Adoption of Ring-LWE Post-quantum Cryptography
Nejatollahi, H., Valencia, F. A., Banik, S., Regazzoni, F., Cammarota, R., & Dutt, N. D. (2020) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3378164 · Cited by 12
Toolbox for linear optics in a one-dimensional lattice via minimal control
Compagno, E., Banchi, L., & Bose, S. (2015) · Physical Review A · doi:10.1103/physreva.92.022701 · Cited by 11
QSWalk.jl: Julia package for quantum stochastic walks analysis
Glos, A., Miszczak, J. A., & Ostaszewski, M. (2018) · Computer Physics Communications · doi:10.1016/j.cpc.2018.09.001 · Cited by 11
Liu, H., Yu, Z., Zou, M., Tang, Y.-L., Zhao, Y. S., Zhang, J., Wang, X., Chen, T., & Pan, J.-W. (2019) · Physical Review A · doi:10.1103/physreva.100.042313 · Cited by 10
Quantum-Kit: Simulating Shor's Factorization of 24-Bit Number on DesktopPreprint
Tankasala, A., & Ilatikhameneh, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.07187 · Cited by 10
A Necessary Condition for the Security of Coherent-One-Way Quantum Key Distribution Protocol
Mafu, M., Marais, A., & Petruccione, F. (2014) · Applied Mathematics & Information Sciences · doi:10.12785/amis/080612 · Cited by 9
Kumar, K. N. P., Sharma, N. A., Prasad, R., Deo, A., Khorshed, M. T., Prasad, M., Dutt, A. V., & Ali, A. B. M. S. (2015) · Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE) · doi:10.1109/apwccse.2015.7476130 · Cited by 9
Quantum Programming Language LanQ
Mlnařík, H. (2007) · Cited by 9
TOWARDS A NOVEL ENVIRONMENT FOR SIMULATION OF QUANTUM COMPUTING
Patrzyk, J., Patrzyk, B., Rycerz, K., & Bubak, M. (2015) · Computer Science · doi:10.7494/csci.2015.16.1.103 · Cited by 8
Quantum Communication Networks: Design and Simulation
Bassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2020) · Foundations in signal processing, communications and networking · doi:10.1007/978-3-030-62938-0_6 · Cited by 8
Q#, a quantum computation package for the .NET platformPreprint
Tolba, A. S., Rashad, M. Z., & El-dosuky, M. A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.5133 · Cited by 7
Physical synthesis of quantum circuits using templates
Mirkhani, Z., & Mohammadzadeh, N. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1377-x · Cited by 7
Quantum Annealing for Automated Feature Selection in Stress Detection
Nath, R. K., Thapliyal, H., & Humble, T. S. (2021) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi51109.2021.00089 · Cited by 7
Quantum++ - A C++11 quantum computing libraryPreprint
Gheorghiu, V. (2014) · arXiv (Cornell University) · Cited by 6
A Grid Enabled Quantum Computer Simulator
Caraiman, S., Archip, A., & Manta, V. (2009) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2009.57 · Cited by 6
Time-optimal implementations of quantum algorithms
de Albornoz, A. C. C., Taylor, J. R., & Cărare, V. (2019) · Physical Review A · doi:10.1103/physreva.100.032329 · Cited by 5
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., & Tillich, J. (2019) · HAL · doi:10.48550/arxiv.1910.00810 · Cited by 5
Noise management to achieve superiority in quantum information systems
Nemoto, K., Devitt, S. J., & Munro, W. J. (2017) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2016.0236 · Cited by 4
An End to End Cloud Computing Privacy Framework Using Blind Processing
Gahi, Y., Alaoui, I. E., & Guennoun, M. (2020) · International Journal of Smart Security Technologies · doi:10.4018/ijsst.2020010101 · Cited by 3
Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems
Vybornyi, I., Trichili, A., & Alouini, M. (2021) · Springer eBooks · doi:10.1007/978-3-030-55366-1_4 · Cited by 3
В., И. О., Korenkov, V., Tyatyushkina, O., Ulyanov, S. V., & Fukuda, T. (2020) · System Analysis in Science and Education · doi:10.37005/2071-9612-2020-1-52-84 · Cited by 3
How to simulate free will in a computational device
Freivalds, R. (1999) · ACM Computing Surveys · doi:10.1145/333580.333594 · Cited by 2
Analysis of an Atom-Optical Architecture for Quantum Computation
Devitt, S. J., Stephens, A. M., Munro, W. J., & Nemoto, K. (2015) · Lecture notes in physics · doi:10.1007/978-4-431-55756-2_19 · Cited by 2
Quintuple: a Python 5-qubit quantum computer simulator to facilitate cloud quantum computingPreprint
Moran, C. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09225 · Cited by 2
Azuma, H., & Ban, M. (2019) · arXiv (Cornell University) · Cited by 2
Cited by
AI for next generation computing: Emerging trends and future directions
Gill, S. S., Xu, M., Ottaviani, C., Patros, P., Bahsoon, R., Shaghaghi, A., Golec, M., Stankovski, V., Wu, H., Abraham, A., et al. (2022) · Internet of Things · doi:10.1016/j.iot.2022.100514 · Cited by 686
Self-citationModern computing: Vision and challenges
Gill, S. S., Wu, H., Patros, P., Ottaviani, C., Arora, P., Pujol, V. C., Haunschild, D., Parlikad, A. K., Cetinkaya, O., Lutfiyya, H., et al. (2024) · Telematics and Informatics Reports · doi:10.1016/j.teler.2024.100116 · Cited by 197
Self-citationFog computing: a taxonomy, systematic review, current trends and research challenges
Singh, J., Singh, P., & Gill, S. S. (2021) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2021.06.005 · Cited by 154
Self-citationSecuring the future internet of things with post‐quantum cryptography
Kumar, A., Ottaviani, C., Gill, S. S., & Buyya, R. (2022) · SECURITY AND PRIVACY · doi:10.1002/spy2.200 · Cited by 108
Self-citationSingh, H., Tyagi, S., Kumar, P., Gill, S. S., & Buyya, R. (2021) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2021.102353 · Cited by 104
Self-citation
Metadata
- Authors
- Gill, S. S., Kumar, A., Singh, H., Singh, M., Kaur, K., Usman, M., & Buyya, R.
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 2021-10-07
- Volume
- 52
- Issue
- 1
- Pages
- 66-114
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W3095846505
- Cited by
- 476
- References
- 229
- FWCI
- 6.64
- 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.