6662 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL.

71, 2024

Quantum Computing Review: A Decade of Research

Sandeep Kumar Sood and Pooja

Abstract—Quantum computing (QC) has the potential to be the

next abstruse technology, with a wide range of possible applications
and ramifications for organizations and markets. QC provides
an exponential speedup by employing quantum mechanics prin-
ciples, including superposition and entanglement. The potential
advantages offered by the revolutionary paradigm have propelled
scientific productions. Therefore, a highly pertinent investigation
is required to elucidate the evolution of path-breaking trajectories
for scientific advances. This study confronts the idea by presenting
a scientometric analysis for the recent decade of literature col-
lected from the Web of Science database in the computer science
discipline. The scientometric implications of the article identify
the significant research domains and provide an intensive insight Fig. 1. Representation of classical bit and Q-bit.
into the publication patterns, country collaboration, geographical
analysis, citation patterns, eminent journals, and research frontiers
of each domain of QC. The scholarly literature analysis identifies The ability of superposition allows the creation of an ex-
key challenges in the QC knowledge domain. Overall, the inference ponentially large number of states; e.g., a 64-qubit quantum
reveals an evolutionary pathway for future research directives
and collaboration in the domains of QC research. The research computer can represent 264 states simultaneously, enabling the
findings provide innovative significance to information scientists by execution of 264 permutations of a dataset concurrently. As a
presenting a comprehensive overview of QC research to help them result, quantum computers are more efficient and powerful than
find relevant applications, research topics, and key challenges. their classical analogs. However, it is challenging to engineer
Index Terms—CiteSpace, quantum algorithms, quantum and program quantum computers due to the problems of de-
machine learning, scientometric analysis, Web of Science (WoS). coherence, noise, and highly fragile complex quantum states.
At present, many organizations such as IBM, Google, D-wave,
Rigetti, IonQ, Honeywell, and Microsoft have built quantum
I. INTRODUCTION computers [1]. Furthermore, countries such as the USA and
Peoples R China have claimed to achieve quantum supremacy
UANTUM computer operates on the principles of quan-
Q tum mechanics and utilizes the properties of quantum
(microscopic) particles, i.e., superposition and entanglement, to
by generating bit strings from a distribution that was otherwise
hard to simulate on classical computers [2], [3].
Although quantum computing (QC) is still in its infancy, it
perform computation. In contrast to classical computers, where has the potential of ground-breaking developments in fields such
information is stored in bits that can only be either 0 or 1, as machine learning, financial modeling, risk analysis, medical
quantum computers store information on qubits, which can exist drug design, communication, and cryptography to lead new
either in state 0 or 1 or in the superposition of both states. inventions that boost science and market globally [4], [5]. Quan-
Mathematically, the state of a qubit can be represented as tum cryptography offers absolute security based on principles
|γ >= α|0 > +β|1 > (1) of quantum mechanics (entanglement, no-cloning theorem, to
name a few) and has emerged as a key subfield and research
where α and β are associated with the probability amplitudes of trend in modern cryptography systems [6]. Additionally, quan-
corresponding states. The probabilities of a qubit being in the 0 tum communication is an innovative, multidisciplinary branch
and 1 states are given by α and β, respectively. The distinction of research that offers significant advancements in communi-
between a qubit and a conventional bit is shown in Fig. 1. cations that are inaccessible to the classical communication
Normalization of the state to unity guarantees the following methods [7]. Furthermore, the quantum-inspired algorithms will
relation: α2 + β 2 = 1. overpower classical data analytic methods by providing expo-
nential speedup and optimization benefits [8], [9], [10]. The
possible future benefits have encouraged countries and regions
Manuscript received 23 November 2022; revised 26 February 2023 and to manifest deliberate quantum drives and massive billion USD
19 May 2023; accepted 1 June 2023. Date of publication 28 June 2023; date
of current version 5 April 2024. Review of this manuscript was arranged by expenditure, including in the U.K., Peoples R China, India,
Department Editor F. Tietze. (Corresponding author: Pooja.) Australia, Germany, USA, Japan, and Canada [11], [12], [13],
The authors are with the Department of Computer Science and Applications, [14].
National Institute of Technology Kurukshetra, Thanesar 136119, India (e-mail:
[email protected]; [email protected]). Due to the potential benefits of QC, there is an extensive lit-
Digital Object Identifier 10.1109/TEM.2023.3284689 erature in this field; however, little is known about QC evolution
1558-0040 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6663

in the computer science discipline to help develop innovation

trajectories. Scientometric analysis generates pathways for new
technological trajectories to establish interactions within and
between research scholars. Therefore, the current study tackles
the research gap by performing a scientometric analysis on QC
publications over the 2013–2022 time frame.
To this end, the current research pursue to answer the follow-
ing questions.
1) What are the significant research domains of QC?
2) What are the QC publications trends in terms of time and
affiliated countries?
3) What are the potential sources and the quality of work
published in each domain?
4) What are the research frontiers and key challenges in this Fig. 2. Framework of research methodology.
knowledge domain?
To present the QC literature analysis, the article is arranged
into eight sections. Section II describes the approach adopted An extensive forage of the popular databases shows that very few
for data collection and tool selection for processing the data. It reviews have been performed in the QC domain. Moreover, the
also identifies the research domains of QC by document coci- research conducted to perform a survey on QC-based scientific
tation cluster analysis and segregates the complete dataset into knowledge is not confined to a specific stream. Therefore, this
domains obtained using WoS subqueries. Section III presents research provides a novelty exploration to fill the gap found in
the publications’ growth, geographical distribution, and country the scientific literature. The current analysis endeavors to explore
collaboration. Section IV presents the citation patterns of publi- the state-of-the-art of QC over the recent decade in the computer
cations and the most prominent journals in various QC domains. science stream.
SectionV sets the stage for determining potential research di- Science maps are an effective method to represent how various
rectives. Section VI presents a systematic literature review to fields and technologies evolve over time using data from scien-
determine the future scope and key challenges in each domain. tific research. The scientometric approach is utilized to explore
Discussion is provided in Section VII, whereas Section VIII the macrostructure of many emerging fields such as 3-D print-
presents the conclusion, implications, and future directions of ing [21], 4-D printing [22], and smart disaster management [23].
the study. Additionally, it provides a roadmap for future research agenda
and practices in respective fields [24], [25], [26], [27], [28]. In
fact, scientometric analysis has shown its usefulness in broad
A. Literature Review fields to sort the tangled streams of scientific proliferation.
QC is a nascent technology, and the publications in this However, systematic literature reviews summarize the literature,
domain are at a surge. It specifies that there is a need to organize provide collective insights through theoretical analysis, and
the research domain singlehandedly to develop a roadmap for ac- identify key challenges in the research domain [29]. Conse-
quiring future research directions. In this context, Scheidsteger quently, this article contributes to the field by presenting an
et al. [15] present the timelined evolution of four main domains evolutionary pathway through comprehensive analysis as well
of quantum technology considering the publications count and as the gaps to provide guidelines for scholars to position their
country collaborations. The science maps are also maintained to future research. The current study has adopted a scientometric
recognize the development of research topics in three consec- approach used by the authors in copious sectors [30], [31], [32].
utive periods. Wang et al. [16] present a comprehensive global The scientometric approach identifies the significant research
development status of QC using multiple bibliometric metrics domains in QC through document cocitation cluster analysis
for scientific research and decision making. Coccia et al. [17] using the CiteSpace visualization tool. Furthermore, the study
have developed science maps of keywords on QC for three presents the publication growth analysis, country collaboration,
successive periods 1990–2000, 2001–2010, and 2011–2020. geographical distribution, citation patterns analysis, prominent
The study measures dynamic changes in terms of degree cen- journals, and research frontiers in each domain. Moreover, a
trality, betweenness centrality, and closeness centrality, which systematic literature review analysis is performed over the most
concludes that QC is a promising technology for growth and cited publications to reveal key challenges in this knowledge
impact in science and marketing. Dhawan et al. [18] map the domain. The following section presents the methodology of the
global development of QC from the period of 2007–2016 using study used for data collection, data processing, and analysis.
data from Scopus. The findings indicate that computer science
is one of the most popular research fields in QC technology. II. METHODOLOGY
Bhasin and Tripathi [19] perform an extensive literature survey
A. Framework
of QC to depict the state-of-the-art and future application scope
of quantum computers. The bibliometric analysis presented by The current study employs a scientometric approach to ex-
Gill et al. [20] is also performed over the overall QC literature. plore the evolutionary paradigms and future directions. Fig. 2

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6664 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

shows the framework to demonstrate the methodology followed

in the current article to visualize and analyze the literature on
QC. The analysis steps are as follows.
1) The authors retrieved the literature from the WoS database
based on different restriction criteria. The records are
downloaded and saved in a CiteSpace compatible format.
2) The document cocitation network is generated using the
CiteSpace visualization tool to explore broad domains
of QC literature. Furthermore, the complete dataset is
segregated domainwise using WoS subqueries.
3) A descriptive scientometric analysis is performed con-
cerning all QC categories. A domainwise examination of
the QC literature revealed the publication growth, coun-
try collaboration, and high-yield countries. The citation
pattern analysis shows citation distribution and the most
influential journals in each domain.
4) A cocitation cluster analysis based on the references re-
vealed research frontiers in the respective domains for
future study.
5) Finally, the key challenges in this knowledge domain are
specified by conducting the literature review.
All the steps are explained in detail ahead.

Fig. 3. PRISMA flow diagram for record selection.

B. Database and Tools Selection
This research article focus on the analysis of the QC literature
graphical visualization. It also includes commands for 2-D and
over a computer science domain. For scientific literature, a
3-D data visualization to customize the graphics’ appearance
number of databases are accessible, including Scopus, Web of
appropriately.
Science (WoS), IEEE Explore, Google Scholar, and Science
Direct [33]. But WoS is chosen in this study to extract required
literature that houses large impact scientific journals, and the C. Data Search Strategy
papers in these indexes are of higher quality. It has vast con- The Preferred Reporting Items for Systematic Reviews and
tent coverage from 1990 and contains higher impact scientific Meta-Analysis (PRISMA) approach proposed by Liberati et
literature as compared to Scopus [34]. Furthermore, WoS pro- al. [44] has become a widely popular and most appropriate
vides on-site analysis and visualization of structured data of method to gauge scientific data. The current study used PRISMA
publications in terms of bar charts and tree map charts based on to collect the most relevant scientific literature on QC. As
various parameters, such as authors, publication year, document displayed in Fig. 3, the initial stage retrieved a substantial count
types, WoS categories, affiliations, publication titles, publishers, of 109 279 records from the WoS database using the following
editors, research area, country/region, and languages. query:
Furthermore, manual processing of large volumes of biblio- ALL (Quantum Computing OR Quantum Computation).
metric data is both cost-intensive and labor-intensive. A vi- Furthermore, the data selection process focused on extracting
sualization tool is required for the scientometric analysis of records based on title, abstract, and keywords fields, resulting in
structured input and to extract hidden information from the a collection of 49 675 articles. During the screening stage, the
data [35]. There are many data visualization tools available to use authors eliminated 15 541 records by restricting the results to
viz. CiteSpace [36], Gephi [37], VOSviewer [38], SciMAT [39], DOCUMENT TYPES (“Article”), LANGUAGES (“English”),
UCInet [40], etc. The authors have used the CiteSpace tool and PUBLICATION YEARS (“2013-2022”). Reviewing the ar-
to process the data as it is a freely available software, which ticles for eligibility, papers that do not contribute to the computer
offers the unique facility of more evaluative analysis through science subject area were eliminated using the WoS CATE-
network visualization [41]. Additionally, CiteSpace software GORIES (“Computer Science Artificial Intelligence OR Com-
comprehensively sort the results by generating clusters to il- puter Science Cybernetics OR Computer Science Information
luminate the research areas and overall trends [42]. Various Systems OR Computer Science Interdisciplinary Applications
parameters such as citation burstiness, silhouette score, modu- OR Computer Science Software Engineering OR Computer
larity, and centrality have been provided in CiteSpace to validate Science Theory Methods OR Quantum Science Technology”)
the results obtained through visualization [43]. Furthermore, the and RESEARCH AREAS (“Computer Science”) filters. After
MATLAB tool is employed to graphically plot the publication completing the eligibility stage, the CiteSpace tool was utilized
pattern in this article since MATLAB is an easy-to-use integrated to eliminate duplicate records from the pool of 5104 articles.
development environment for programming, computations, and Based upon the above retrieval strategy, a total of 5096 records

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6665

TABLE I
OVERALL CLUSTERS SUMMARY OF QC

Fig. 4. QC literature: Cocitation network.

TABLE II
WOS SUBQUERIES FOR EACH DOMAIN
were obtained for scientometric analysis. The search was further
narrowed by manually screening the abstract on full-text articles
for the foundation of an in-depth review process. This meticu-
lous exercise ensures that the resulting collection is free from
redundancy and enhances the overall accuracy and reliability of
the study.

D. Identification of Research Domains

The cocitation clusters created by the connections between
several publications reveal similar research axes and central
issues. Based on the degree of corelation between documents,
a clustering analysis can divide a huge number of research arti-
cles into multiple units to determine various research domains
of emerging technology. Therefore, QC research domains are
identified by generating document cocitation clusters over the quantum-enhanced analysis methods (QEAM) (#0, #1, #5, #13),
records obtained from the WoS database using the CiteSpace quantum cryptography and information security (QCIS) (#4, #8,
visualization tool. Fig. 4 represents the clusters using different #12), and quantum computational complexity (QCC) (#3, #10).
colors for each cluster. The number followed by # represents the Furthermore, for exploring the QC domains obtained through
cluster id and the phrase afterward determines the cluster tag. document cocitation clustering, the entire dataset is dissected us-
The log-likelihood ratio (LLR) algorithm is used to generate ing subqueries in the WoS database. Table II represents the WoS
clusters since it generates clusters with high quality and high query used to segregate data into corresponding domains and
intraclass similarity [45]. Modularity (Q) and mean silhouette the number of records obtained in each domain. The subquery
score (S) determine the quality of clusters. The “Q” value gauges includes the most relevant and frequent keywords to precisely
how easily a network may be broken up into several modules divide the whole data into separate domains. Subsequently, the
and the “S” determines the homogeneity of clusters. The network record contents are downloaded and saved in plain text file
has a high level of overall clarity when S and Q values are near format for further evaluation.
1.0. The clusters obtained on the document cocitation analysis
have the Q value 0.84 and the S value of 0.95, indicating that III. PUBLICATION PATTERNS
the clusters are highly reliable. Table I lists the top 14 most
significant clusters of cocited documents along with the cluster A. Temporal Distribution of Publications
id, size, silhouette score, mean year (MY), and cluster tag. Each The publications’ analysis represents the changing patterns
significant cluster includes the most frequently cited articles of developmental trends over the years to specify the literature
and the cluster tag indicates the main research topic in QC. progress in QC. Fig. 5 represents the yearwise development of
Based on the cluster tag, all the clusters obtained are broadly QC literature from 2013 to 2022. The trending line for total pub-
classified into five domains: quantum communication (QCo) lications denotes the total number of publications received every
(#2, #16), quantum algorithm and simulation (QAS) (#6, #7, #9), year and the cumulative frequency depicts the growth rate of the

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6666 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

TABLE III
DOMAINWISE TEMPORAL DISTRIBUTION OF PUBLICATIONS

Fig. 6. Domainwise overall publication growth in QC.

Fig. 5. Yearwise overall publication growth in QC.

literature. The cumulative number of papers per publication year each domain is higher from 2018, but there is a remarkable
indicates a steady growth in scientific literature throughout the surge in the publications quantity of the QAS domain from 2018
decade, depicting the revolutionary paradigm of the field. The (168) to 2021 (304). Additionally, the number of publications
analysis presents that there is a steady growth of publications has almost doubled in the period from 2019 (66) to 2020 (128) in
till 2016, but an abrupt increase in publications is observed after the QEAM domain. This analysis presents that QAS and QEAM
2018. The publications are doubled from 2018 (444) to 2020 domains are prevalent among researchers from the last five
(829), indicating that QC-related research has spiked in the last years. The temporal distribution of publications in Fig. 6 shows
five years. Furthermore, a decline in publications is observed positive growth throughout the period in all domains. However,
in 2022 because the data up to June 2022 are included in the a decline in number of publications has been observed in QCo
dataset. (in 2017), QEAM (in 2017), and QCIS (in 2015), respectively.
The overall analysis explores that QEAM has the highest growth
B. Domainwise Temporal Distribution of Publications rate (24.12%), which signifies that the domain is the most active
research domain in QC technology.
A quantitative analysis approach is used to present the basic
structure of research advancements in each domain. A total of
5096 documents are retrieved from the WoS database from 2013 C. Country Collaboration
to 2022. Furthermore, all the collected records are segregated Country collaboration analysis states the quality of literature
according to the QC domains using the WoS subquery. Table III produced and cooperative relationship between countries in a
presents the growth of each domain with total publications (tp) specific field. This study presents the country collaboration
and percentage share (tp%) in every year corresponding to each analysis using the CiteSpace visualization tool over the QC liter-
domain. According to the data from the table, highest number ature. Fig. 7 shows the country collaboration network diagram,
of records are from QAS (1859), followed by QCo (1099) and containing 106 nodes and 908 links, where a node represents
QCIS (871). In contrast, QCC (582) reports a minimum number the number of publications produced in collaboration with other
of publications, followed by QEAM (685). The analysis depicts countries and the link between two countries determines the
that QAS is the most explored domain among researchers, degree of co-operation among them. The larger node size indi-
whereas minimum efforts are imposed in the QCC domain. cates a higher publication count for the specified country, and the
Fig. 6 visualizes the yearwise publications over the QC domains higher number of links depicts close intercountry co-operation.
graphically. It is observed that the percentage share (tp%) in The pink circle around a node presenting the centrality value

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6667

TABLE IV
OVERALL COUNTRY COLLABORATION

the domainwise geographic distribution analysis that highlights

the top contributing countries in each domain of QC. The
table lists the five most productive countries, with respective
publications count and publication share in each domain. The
results indicate that Peoples R China is the leading contrib-
utor to literature writing across all the domains of QC, fol-
lowed by the USA. India is the third-largest producer of lit-
erature in the fields of QCo (30.63%), QCIS (21.51%), and
QCC (15.44%), whereas Australia holds third position in QAS
(46.13%) and QEAM (26.81%) domains. The overall analysis
shows that Peoples R China, USA, India, and Australia are the
most leading contributors of scientific literature in all domains
of QC.

IV. CITATION PATTERNS

Fig. 7. Overall country collaboration network diagram. A. Citation Patterns Analysis
Citation matrices analysis is one of the major aspects to
depicts the quality of publications. Table IV represents the rank- evaluate the quality and significance of published publications.
wise enlistment of the top 10 countries along with the frequency Table VI represents the citations count varying from 0 to 100 and
of publications, number of neighbor nodes/number of links, and exceeding 100, possessed by the publications in each domain.
centrality in the QC literature. The analysis explores the fact The statistics in the table display the percentage of publications
that Germany shows the highest degree of co-operation among that have been cited. The results show that all domains contain
countries with a maximum number of links (52) between nodes 21%–26% publications that are not cited even once. It is also
in the country collaboration network. Peoples R China, USA, observed that 9%–13% of publications have received one cita-
Australia, England, and India are five countries with the highest tion across all domains of QC. Additionally, the statistics depict
intercountry cooperation, followed by Germany. Furthermore, that publications with 5–10 and 11–20 citations mutually have
the analysis indicates that Peoples R China is the leading con- a considerably significant share in each domain. According to
tributor to the QC literature, with 1419 publications. USA and the analysis, QAS acquires minimum zero citation publications,
Australia are the two most significant contributors, followed which represents the importance and research influence of the
by Peoples R China; then, England and India hold fourth and domain in QC. Furthermore, the QEAM domain possesses the
fifth positions, respectively. From the context of centrality, USA highest percentage of publications that acquire greater than
(0.19), Peoples R China (0.17), and England (0.17) are the 21 citations, which shows its significance as the most widely
top three countries, indicating the highest quality publications. followed domain in QC. Additionally, the analysis has depicted
Some countries, such as Canada (0.14) and Germany (0.09), that QAS has maximum publications (42) having greater than
possess lower publications count but higher centrality, indi- 100 citations.
cating that the QC literature published in these countries is
less but of higher quality. In contrast, the publications count B. Influential Journals Identification
of Australia (435) is remarkable, but the low centrality (0.06)
The citation pattern of journals in a scientometric analysis
indicates the requirement of researcher’s efforts on quality
provides the most influential journals in a particular area for
enhancement.
the researchers to unearth an impactful platform for scientific
writing. This analysis determines the most prestigious jour-
D. Geographic Distribution
nals in each domain of the discipline by total citation count.
The geographic distribution analysis represents the contri- Table VII shows the list of highly cited journals with the citations
bution of countries over a research area. Table V presents count, the publications count (TP), average citation count over

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6668 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

TABLE V
TOP FIVE PRODUCTIVE NATIONS IN EACH DOMAIN

TABLE VI
CITATION PATTERNS OF PUBLICATIONS IN EACH DOMAIN

TABLE VII
FIVE MOST INFLUENTIAL JOURNALS IN EACH DOMAIN OF QC

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6669

each publication (ACPP), share of publications (TP%), and

the impact factor (IF) of journals. The analysis depicts that
IEEE TRANSACTIONS ON INFORMATION THEORY has the highest
number of citations (1475) in the QCo domain and Computer
Physics Communications has the highest number of citations
in domains QAS (4858) and QCC (1939). The IEEE TRANS-
ACTIONS ON IMAGE PROCESSING has the highest number of
citations (2891) in the QEAM domain and Information Sciences
has the highest number of citations (1820) in the QCIS domain.
Journal of Computational Physics has a considerable impact
with maximum ACPP (218.83) in QEAM among all domains.
Computer Physics Communications in the QAS domain received
a maximum number of total citations (4858) among all domains,
thus depicting the most active domain of QC. Furthermore, IEEE
ACCESS is the most followed journal among the researchers
with maximum publications in all domains of QC. IEEE
Fig. 8. Document cocitation network diagram of the QCo domain.
COMMUNICATIONS SURVEYS AND TUTORIALS, IEEE TRANSAC-
TIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,
and IEEE TRANSACTIONS ON CYBERNETICS are the journals A. Cluster Analysis of QCo Domain
with the highest impact factor, i.e., 33.84, 24.314, and 19.118,
The network diagram (see Fig. 8) of the QCo domain contains
respectively.
452 members and 411 links, with a network density value 0.004.
The S and Q values are 0.976 and 0.934, respectively, specifying
V. CLUSTER ANALYSIS a highly reliable network. The articles under the QCo domain
are categorized into five clusters with a size of more than 15.
Cluster analysis based on a document cocitation network is
Cluster #0, entitled “teleportation” is the largest cluster with 34
conducted to identify research frontiers in each domain of QC.
members. The S value and MY are 0.947 and 2020, respectively.
The clusters in the visualization map form an overview of how
The MY depicts that the cluster is a member of recent research
the scientific field and underlying technologies have evolved
in the QCo domain. The cluster is highly active during the
over time. Clusters are portrayed on the basis of indexed terms
2017–2020 time quantum. Cluster #1, entitled “quantum error
extracted from highly cited references of the dataset using the
correction” is the second largest cluster with a size of 32. The
LLR algorithm in the CiteSpace visualization tool. The pruning
S value and MY are 0.959 and 2014, respectively. The cluster
technique is used to avoid unnecessarily cluttered network vi-
is highly active during the 2010–2016 time window. Cluster
sualizations and to ensure that the display will not obscure the
#3, named “quantum walks” is the third largest cluster with 20
essential patterns. A minimum spanning tree is preferred over
members. The S value and MY are 0.974 and 2020, respectively.
pathfinder pruning as the former approach guarantees that the
The MY depicts that the cluster is a member of active research in
number of links in the network is always N −1 for N nodes [46].
the QCo domain. The cluster is highly active during the 2018–
Furthermore, each domain uses a G index measure with distinct
2020 time quantum. Cluster #8, named “quantum information,”
scale factors (k). G index considers the citation count of an
is the fourth largest cluster with 17 members. The S value and
author’s most important publications. The S (−1, 1) and Q
MY are 0.995 and 2017, respectively. The cluster is highly
(0, 1) specify the quality score of the network [47]. Different
active during the 2011–2017 time quantum. Cluster #10, named
color-shaded regions in the network diagrams highlight clusters
“privacy amplification,” contains 16 members. The S value and
in corresponding domains. The yellowish clusters in the network
MY are 0.922 and 2013, respectively. The active duration of this
represent the recent publications close to 2022, whereas purple
cluster is 2008–2012.
color clusters signify the former publications close to 2013. The
cluster tag depicts the research frontier in each corresponding
domain. The nodes in each cluster represent highly cited papers B. Cluster Analysis of QAS Domain
and the links indicate the cocitation relationship among nodes. The network diagram (see Fig. 9) of the QAS domain contains
Nodes with outer pink rings depict the reference with a high 572 nodes, 557 edges, and a network density value 0.003. The
betweenness centrality value. Top terms based on the cluster S and Q values are 0.971 and 0.898, respectively, specifying a
explorer table represent the key research areas corresponding highly reliable network. The articles under the QAS domain are
to each subdomain. The MY of a cluster depicts the average categorized into six different clusters with a size of more than 15.
publication year for the majority of candidates in that cluster. Cluster #0, entitled “quantum algorithm” is the largest cluster
Table VIII represents different attributes of each domain, i.e., with 38 members. The S value and the MY are 0.923 and 2016,
cluster ID, publication count(size), silhouette score, MY, re- respectively. The cluster is highly active during the 2012–2018
search frontiers [cluster tag (LLR)], and key research areas [top time quantum. Cluster #1, entitled “quantum machine learning”
terms (LLR)]. is the second largest cluster with a size of 37. The S value is

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6670 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

TABLE VIII
CLUSTER SUMMARY OF THE QC DOMAINS

oscillator algorithm” is the fourth largest cluster with a size of

28. The S value and MY are 0.972 and 2019, respectively. The
MY depicts that the cluster is a member of recent research in
the QAS domain. The cluster has been active from 2016 through
2020. Cluster #7, is the fifth most giant cluster named “particle
swarm optimization” with a size of 28. The S value and MY are
0.975 and 2014, respectively. The active duration of this cluster
is 2011–2014. Cluster #13, named “market research” is the sixth
largest cluster with 18 members. The S value and MY are 1 and
2021, respectively. The MY depicts that the cluster is a member
of recent research in the QAS domain. The active duration of
this cluster is 2017–2019.

Fig. 9. Document cocitation network diagram of the QAS domain.

C. Cluster Analysis of QEAM Domain
The network diagram (see Fig. 10) of the QEAM domain
0.985, and the MY is 2019 of the cluster. The MY depicts that accommodates 497 nodes, 1825 edges, and a network density
the cluster is a member of recent research in the QAS domain. value 0.0148. The S and Q values are 0.918 and 0.805, respec-
The cluster is highly active during the 2009–2019 time quantum. tively, specifying a highly reliable network. The articles under
Cluster #3, named “quantum image processing” is the third- the QEAM domain are divided into six different clusters. Cluster
biggest cluster with 33 members. The S value and MY are 0.961 #0, entitled “quantum machine learning” is the largest cluster
and 2018, respectively. The cluster is active for the 2013–2019 comprising 75 members. The S value and the MY are 0.83
time frame. Cluster #6, entitled “multiscale quantum harmonic and 2020, respectively. The MY 2020 depicts that the cluster

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6671

Fig. 10. Document cocitation network diagram of the QEAM domain.

is a member of recent research in the QEAM domain. The

active duration of this cluster is 2016–2020. Cluster #1, entitled Fig. 11. Document cocitation network diagram of the QCIS domain.
“quantum image processing” is the second largest cluster with
a size of 68. The S value and the MY are 0.901 and 2017,
is the fourth cluster consisting of 34 members. The S value and
respectively. The cluster is highly active during the 2009–2020
MY are 0.970 and 2018, respectively. The cluster is active for
time frame. Cluster #2, entitled “image captioning” is the third
the 2014–2018 time frame. Cluster #4, entitled “quantum key
cluster containing 42 members. The S value and MY are 0.971
distribution” is the fifth cluster containing 30 members. The S
and 2020, respectively. The MY 2020 depicts that the cluster is
value and MY are 0.921 and 2019, respectively. The cluster is
a member of recent research in the QEAM domain. The cluster
active for the period 2012–2020. Cluster #12, entitled “isogeny
is active for the 2014–2020 time frame. Cluster #3, entitled
based cryptography” is the sixth cluster containing 14 members.
“memcomputing” is the fourth cluster with 36 members. The
The S value and MY are 0.989 and 2020, respectively. The MY
S value and MY are 0.96 and 2018, respectively. The cluster
2020 depicts that the cluster is a member of recent research in
is highly active during the 2014–2018 time quantum. Cluster
the QCIS domain. The cluster is active for the 2014–2018 time
#9, entitled “rotating machinery” is the fifth cluster containing
frame.
13. The S value and MY are 0.998 and 2018, respectively. The
cluster is active for 2014–2015. Cluster #10, entitled “6g” is
the sixth cluster containing 12 members. The S value and MY E. Cluster Analysis of QCC Domain
are 0.998 and 2021, respectively. The MY 2021 depicts that the The network diagram (see Fig. 12) of the QCC domain
cluster is a member of recent research in the subdomain. The contains 211 nodes, 480 edges, and a network density value
active duration of this cluster is 2019. 0.0217. The S and Q values are 0.9573 and 0.8626, respectively,
specifying a highly reliable network. The articles under the QCC
D. Cluster Analysis of QCIS Domain domain are divided into three different clusters. Cluster #0, en-
titled “quantum computing” is the largest cluster containing 31
The network diagram (see Fig. 11) of the QCIS domain members. The S value and MY are 0.943 and 2020, respectively.
contains 513 nodes, 1731 edges, and a network density value The MY 2020 depicts that the cluster is a member of recent re-
of 0.0132. The S and Q values are 0.948 and 0.850, respectively, search in the QCIS domain. The cluster is active for the duration
specifying a highly reliable network. The articles under the QCIS 2014–2019. Cluster #1, entitled “logic gates” is second cluster
domain are divided into six different clusters. Cluster #0, entitled containing 22 members. The S value and MY are 0.925 and 2021,
“blockchain” is the largest cluster containing 51 members. The respectively. The MY 2021 depicts that the cluster is a member
S value and MY are 0.907 and 2020, respectively. The MY 2020 of recent research in the QCIS domain. The cluster is active for
depicts that the cluster is a member of recent research in the QCIS the 2016–2020 time frame. Cluster #2, entitled “computational
domain. The cluster is active for the duration 2015–2020. Cluster complexity” is the third cluster having 18 documents. The S
#1, entitled “privacy” is the second cluster containing 43 mem- value and MY are 0.988 and 2016, respectively. The cluster has
bers. The S value and MY are 0.867 and 2020, respectively. The been active from 2013 to 2017.
MY 2020 depicts that the cluster is a member of recent research
in the QCIS domain. The cluster is active for the 2016–2020
time frame. Cluster #2, entitled “random number generator” is VI. SYSTEMATIC LITERATURE REVIEW
the third cluster having 41 documents. The S value and MY are Several studies have explored various aspects pertinent to QC
0.993 and 2016, respectively. The cluster has been active from in the recent decade. To acquire a thorough view of the state
2011 to 2016. Cluster #3, entitled “lattice based cryptography” of the art, it is required to investigate various works under one

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6672 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

using polarization-entangled photon pairs by exchanging 1366-b

string securely in 3 min under the noisy storage model. Bennett
and Brassard [60] discuss the significance of using the quantum
channel in conjunction with classical communication channels
to transmit information securely. The authors also present a coin
tossing protocol, which is secure to traditional attacks even when
the attackers use unlimited computation power.

B. Quantum Algorithm and Simulation (QAS)

Several quantum-based algorithms, such as quantum-classical
hybrid optimization, variational quantum eigensolver, QUBO al-
gorithms, quantum adiabatic algorithms, quantum walks, quan-
tum annealing based, quantum neural networks, and adiabatic
QC (AQC), have emerged, showcasing superior performance
compared to classical counterparts, and leveraging the principles
of quantum physics to tackle optimization problems. In this
context, the authors [61], [62] in their work present the theo-
retical and practical exposition of the hybrid quantum-classical
variational approach. The experimental performance shows that
the quantum eigensolver approach is immune to the quantum
Fig. 12. Document cocitation network diagram of the QCC domain. errors, which shows that this approach is viable in the near
future. Albash and Lida [63] present the significant develop-
ments, algorithmic accomplishments, limitations, scope, and
roof. The current study reveals several key challenges in QC possible resolutions in AQC. A review by Georgescu et al. [64]
by performing a systematic literature review on the selected explains the state of the art of quantum simulation and lists
pertinent publications. the difficulties and potential benefits of this rapidly expanding
discipline. Bernien et al. [65] demonstrated a quantum simulator
A. Quantum Communication (QCo) of a controlled many-body system using 51 Rydberg cold atoms
to study phase transition. Similarly, Zhang et al. [66] use 53
The authors in [48] and [49] have proposed various methods
trapped ion qubits to realize a quantum simulator to study the
such as finite-key security analysis and semiconductor single-
phase transition in the transverse-field Ising model and observed
photon detectors to successfully distribute quantum key over
high entanglement density among qubits. Preskill [67] stated that
833.8-km fiber channel. Cacciapuoti et al. [50] present quantum
NISQ (noisy intermediate-scale quantum computers ranging
teleportation to be a crucial phenomenon in order to transmit
up to 50–100 qubits) technology would be available in the
quantum information over the quantum network. The authors
near future. Furthermore, the popularity of quantum-inspired
also address a number of network design concerns for QCo.
metaheuristic algorithms has increased with the arrival of the
Hosseinidehaj et al. [51] present the state of the art of space-
NISQ era. In this context, the authors [68], [69], [70], [71]
based QCo to the continuous-variable regime. The continuous
have developed quantum-behaved particle swarm optimization
variable regime has the potential to improve quantum commu-
algorithm, quantum-enhanced multiobjective large-scale algo-
nication and quantum Internet efficiency. Aguado et al. [52]
rithm, quantum-inspired gravitational search algorithm, etc.,
present new programmable software network architectures that
to enhance the optimization efficiency. The current quantum-
integrate classical and QCo to reduce the gap between the present
inspired optimization algorithms outperformed various genetic,
cryptography system and the postquantum cryptography system.
evolutionary, and particle swarm optimization algorithms on
The flexibility of QCo in a telecommunication network was
combinatorial, 0–1 knapsack problems, Max-ones, and Royal-
made possible by software-defined networks (SDNs), which was
Road functions.
not conceivable by altering network devices to build a quantum
channel. Nguyen et al. [53] develop a quantum error correction
code using extrinsic information transfer charts to enhance the C. QEAM
performance close to hashing bound of entanglement-assisted Yan et al. [72] present the advancements made in quantum
quantum channels by using popular quantum devices. It is image processing and quantum image representation to follow
evident that security over bit commitment, coin flipping, digital advanced research in these areas. Dunjko et al. [73] describe
signatures, and fingerprinting, cannot achieved without absolute the quantum improvements in three broad categories of ma-
security offered by QCo. In this context, the authors in [54], chine learning viz., supervised learning, unsupervised learning,
[55], [56], [57], and [58] have claimed to achieve a secure and reinforcement learning. An improvement in the context of
bit commitment time of 15 ms over large separations using both quantum supervised and quantum unsupervised learning
QCo and special relativity. Erven et al. [59] provide an exper- is observed while a systematic approach is discussed for the
imental implementation of random oblivious transfer protocol quantum enhancements in reinforcement learning. Iliyasu et

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6673

al. [74] introduced a secure and keyless quantum-inspired frame- (quantum analogs of P, BPP, and NP, respectively). Bernstein
work for image watermarking and authentication on quantum and Vazirani [90] show the relationship between conventional
computers, achieving a 25% improvement and offering 7%– and quantum complexity classes as BPP ⊆ BQP ⊆ P, speci-
50.7% increased visibility compared to conventional schemes. fying the quantum Turing machine to be more powerful than
Cao et al. [75] proposed a quantum artificial neural network the classical probabilistic Turing machine. On the contrary,
inspired by a classical artificial neural network that can com- Adleman et al. [91] proved that all three QCC classes are
pute quantum states by providing information via a network to included in PP, hence in PSPACE. Furthermore, Spakowski et
take advantage of quantum computer speed. Nawaj et al. [76] al. [92] proved NQP ⊆ BQP and EQP=NQP using the closure
present the state of the art of beyond 5G enabling technologies properties of classical complexity classes WPP and AWPP. Lago
and propose a novel QC-assisted and QML-based framework et al. [93] describe three complexity classes based on problems
for 6G communication networks. Biamonte et al. [77] discuss decidable in polynomial time i.e., EQP, BQP, and ZQP, and
the significance of QML over conventional machine learning named it implicit computational complexity having machine-
and concerned hardware and software challenges. Carleo and free, mathematical-logic-based characterizations. The authors
Troyer [78] present a reinforcement-learning-based scheme of have shown a perfect correspondence between these classes
a many-body wave function to reduce its computational com- and polytime lambda calculus SQ for quantum computation.
plexity to a tractable form. Rebentrost et al. [79] have proposed Tanaka [94] shows that the computational complexity class of
to implement a support vector machine over the quantum com- quantum gate minimization is NQP-hard and that the problem of
puter, which is exponentially faster than traditional sampling determining whether a given classical description of a quantum
algorithms. Havlicek et al. [80] present two quantum classifier circuit is strictly equivalent to the identity or not is an NQP
algorithms and implement them over an NISQ superconducting complete problem. Nishimura and Ozawa [95] determine a new
processor. complexity class uniform quantum circuit families (QCFs) and
show it to be computationally equivalent to the quantum Turing
D. QCIS machine. The authors also prove that BQP, ZQP, and EQP are
equivalent to corresponding complexity classes of QCFs. Blier
Bos et al. [81] demonstrate lattice-based cryptographic key
and Tapp [96] introduce a new complexity class called PQMA-
exchange architecture immune to quantum computer attacks.
log(2) (Classical polynomial-time quantum Merlin Arthur with
Diamanti et al. [82] discuss practical challenges in QKD,
two unentangled logarithmic-size certificates). Furthermore, the
which include developing high-scale communication devices
authors show that PQMAlog(2) = NP, which signifies the power
and global-scale QKD networks. Additionally, QKD needs secu-
of quantum information and subtlety of entanglement.
rity proof of the attacks allowed by quantum mechanics. Berstein
et al. [83] proposed a scheme for a highly secure postquantum
state-less hash-based digital signature. The signature technique F. Discussion and Future Scope
is developed to offer long-term 2128 security even from hackers
QCo is a new discipline that uses quantum states to transmit
using quantum computers. Bos et al. [84] proposed a Chosen
information over a channel. QCo provides extreme security
cipher text attack secure key encapsulation mechanism that pro-
and measurement accuracy using quantum mechanics principles
vides postquantum security over 128 b. Ahmed et al. [85], [86]
such as no-cloning, quantum measurement, entanglement, and
present a survey on IoT systems’ security and propose a quantum
quantum teleportation. QCo has grown to the point where the
steganography protocol to securely transmit information over
implementation of secure two-party protocols, secure bit com-
the fog cloud IoT, effectively countering popular attacks such
mitment, secure coin tossing, and quantum oblivious transfer
as man-in-the-middle, message, and no-message attacks. Miller
can be done with security from traditional attacks. However,
and Shi [87] introduced a highly secure and robust exponentially
to effectively utilize the unique properties of quantum me-
expanding untrusted-device randomness expansion protocol that
chanics, a significant network-paradigm shift and transdisci-
achieves cryptographic-level security while maintaining noise
plinary efforts are needed. Maintaining compatibility between
tolerance and requiring minimal quantum memory resources.
classical and QCo is still an open research area, where the
Zhang et al. [88] introduced a protocol that is immune to
SDN architecture can provide more flexibility and an excit-
well-known vulnerabilities such as Trojan horse attacks across
ing opportunity. Furthermore, significant research needs to be
lossy and noisy quantum channels and enables three participants
performed on quantum networking protocols, quantum error
to compute the sum of their inputs without the aid of a reliable
correcting codes, highly fragile entangled states, and the chal-
third party. Xu et al. [89] developed a better protocol for quantum
lenges of sharing quantum resources. Recent theoretical and
secure direct communication to thwart disentanglement and fake
experimental results on quantum simulation (digital or analog)
entangled particle attacks.
and quantum algorithms (purely quantum, quantum-inspired,
or hybrid) lead us to believe that we can tackle the broader
E. Quantum Computational Complexity (QCC)
range of hard class problems. Although, the current technolog-
Quantum computational complexity represents the compu- ical limitations—such as deep circuit algorithms and limited
tational power of quantum algorithms over quantum comput- qubit numbers—impose challenges for researchers to avail the
ers. In quantum computational complexity theory, we study benefits of QC. Researchers have recently developed different
the quantum complexity classes, such as EQP, BQP, and NQP subroutines, such as amplitude amplification, quantum phase

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6674 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

estimation, and quantum annealing, to solve complex machine USA emerges as the primary producer of high-quality literature
learning, searching, classification, and optimization problems. in this domain. Moreover, the study emphasizes the need for
However, there are still challenges such as small scale and NISQ Canadian policymakers to initiate national research and devel-
computers leading to the loss of crucial information, encoding opment (R&D) programs focused on enhancing international
input data into quantum states, and measuring the degree of collaboration in the field of QC.
entanglement. QKD in quantum cryptography is one of the In order to answer the third research question, the citation
hottest topics among secure multiparty quantum computation, pattern analysis and prominent journals are identified. The
quantum secure direct communication, and quantum signature. citation pattern analysis determines that QEAM is the most
There is a number of ground-based approaches to securely widely followed domain because it contains the highest number
share key over the quantum network; however, a satellite-based of publications with citations greater than 21. The analysis
QKD technique has emerged rapidly due to the limited distance also reflects the impact of research in the QAS domain with
coverage problem in the former approach. With many challenges a maximum citation count. The citation analysis of journals
such as quantum attacks, imperfections in quantum devices, identifies that IEEE TRANSACTIONS ON INFORMATION THEORY,
cost, distance, secret key rate, and postquantum key exchange, Computer Physics Communications, IEEE TRANSACTIONS ON
quantum cryptography is still in the applied research phase and IMAGE PROCESSING, and Information Sciences are the most
must pass through multiple stages of maturity, certification, prominent journals receiving the maximum citations count in
and standardization before reaching market-ready status. The QC domains. Moreover, the analysis presents that IEEE AC-
implication of quantum complexity theory is to determine the CESS is the most followed journal by researchers in all do-
relationship of QC with the classical complexity classes and mains of QC. The fourth research question on research frontiers
Turing machine to determine its computational power. Although and critical challenges is addressed by performing a thorough
the literature in this field is limited, it is evident that QC can analysis of document cocitation visualizations and systematic
efficiently solve NP-hard class problems. literature review, respectively. The analysis found that teleporta-
tion, quantum error correction, quantum-inspired metaheuristic
algorithms, QML, quantum image processing, image caption-
VII. DISCUSSION ing, blockchain, QKD, postquantum cryptography, privacy and
This novel work portrayed an in-depth scientometric and random number generators, and logic gates are the research
systematic literature review analysis of WoS-indexed publica- frontiers. QC literature analysis unveils that constructing large-
tions related to QC in the computer science discipline over the scale quantum computers and high-quality QCo devices are
2013–2022 time span. A document cocitation cluster network is the key parameters requiring attention for the multifold rise of
generated to address the first query about significant research QC. Moreover, maintaining compatibility between classical and
domains in QC. The analysis identifies five broad research QCo, quantum networking protocols, quantum error correcting
domains of QC: quantum communication; quantum algorithm codes, highly fragile entangled states, developing shallow circuit
and simulation; quantum enhanced analysis methods; quantum algorithms, encoding input data into quantum states, measuring
cryptography and information security; and quantum computa- degree of entanglement, and postquantum key exchange are the
tional complexity. key challenges in QC research.
The second research question on publications’ and global
contribution in each domain is addressed by the yearwise
VIII. CONCLUSION, IMPLICATIONS, AND FUTURE DIRECTIONS
distribution of the publications, geographical distribution, and
country collaboration. The temporal analysis of publication As information scientists, the authors have tracked the ad-
growth shows a sudden spike from 2018, indicating that the vancements and trends of the collective knowledge of a dynamic
QC knowledge domain has acquired researchers’ attention in scientific community using a scientometric review approach.
the last five years. The domainwise publications distribution The key findings of QC research in the past decade indicate that
advocates that maximum research has been done in the QAS the quantum algorithm development in QEAM is a prominent
(1859) domain. The popularity of the QAS domain can be research frontier. Furthermore, publications in the QEAM do-
attributed to its application in practically every field. QEAM main have experienced substantial growth and higher quality. It
acquire the highest growth rate (24.12%), signifying a predomi- presents an intriguing opportunity for scientists and researchers
nant research domain. However, QCC (582) lags in publications, to contemplate future strategies for achieving a multifold rise
thus presenting the scope of research in the field. According and significant advancements in this field. The scholarly litera-
to geographical distribution analysis, Peoples R China, USA, ture analysis underscores the challenges that QC encounters,
India, and Australia are the top literature contributors in all including qubit instability, quantum decoherence, scalability
domains of QC, indicating that most research is concentrated issues, limited gate operations, and high resource requirements,
in relatively developed countries. Additionally, it is observed which necessitate resolution for unlocking its full potential and
that Peoples R China has outperformed then other countries enabling practical applications.
arguably due to its massive expenditure of about 11 billion USD, The five research domains identified in the study enable
made only in a short duration from 2019 to 2021, on QC and scientists to communicate and analyze for future research di-
QCo. Regarding country collaboration analysis, research written rectives. A further detailed examination of each QC domain
on the QC literature in collaboration with other countries is supports appropriate strategic management of innovation for
dominated by Peoples R China, USA, and Australia. Notably, the competitive advantages in the quantum industry. The overall
Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
SOOD AND : QUANTUM COMPUTING REVIEW: A DECADE OF RESEARCH 6675

analysis provides innovative significance to IT researchers by [20] S. S. Gill et al., “Quantum computing: A taxonomy, systematic review and
presenting a comprehensive overview of QC research to help future directions,” Softw., Pract. Experience, vol. 52, no. 1, pp. 66–114,
2022.
them find key challenges and research frontiers. In addition, the [21] S. K. Sood, K. S. Rawat, and G. Sharma, “3-D printing technologies
proposed study offers an insightful and focused examination to from infancy to recent times: A scientometric review,” IEEE Trans. Eng.
commercialize R&D in QC at a large scale. Manage., to be published, Jan. 5, 2022, doi: 10.1109/TEM.2021.3134128.
[22] Y. S. Lamba, S. K. Sood, K. S. Rawat, M. Chopra, and A. K. Singh,
The presented research can be further extended by incorporat- “Knowledge mapping of 4D printing technologies in computer engi-
ing institution co-occurrence analysis and author coauthorship neering,” Comput. Appl. Eng. Educ., vol. 30, no. 6, pp. 1959–1978,
analysis in the current study. Scholars can leverage other data 2022.
[23] S. Neelam and S. K. Sood, “A scientometric review of global research on
visualization tools and databases to gain valuable insights, un- smart disaster management,” IEEE Trans. Eng. Manage., vol. 68, no. 1,
cover patterns, and make informed decisions for further research pp. 317–329, Feb. 2021.
and exploration within the realm of QC. Also, the research [24] K. S. Rawat and S. K. Sood, “Emerging trends and global scope of Big
Data analytics: A scientometric analysis,” Qual. Quantity, vol. 55, no. 4,
contribution of subdomains can be determined further to extend pp. 1371–1396, 2021.
the breadth and depth of the study. [25] K. Bogusławski, J. Nasur, J. Li, M. Gil, K. Wróbel, and F. Goerlandts,
“A cross-domain scientometric analysis of situational awareness of au-
tonomous vehicles with focus on the maritime domain,” IEEE Access,
vol. 10, pp. 50047–50061, 2022, doi: 10.1109/ACCESS.2022.3174097.
[26] S. K. Sood, K. S. Rawat, and D. Kumar, “Analytical mapping of informa-
REFERENCES tion and communication technology in emerging infectious diseases using
CiteSpace,” Telematics Informat., vol. 69, 2022, Art. no. 101796.
[1] E. R. MacQuarrie, C. Simon, S. Simmons, and E. Maine, “The emerging [27] C. Zheng, J. Yuan, L. Zhu, Y. Zhang, and Q. Shao, “From digital
commercial landscape of quantum computing,” Nature Rev. Phys., vol. 2, to sustainable: A scientometric review of smart city literature between
no. 11, pp. 596–598, 2020. 1990 and 2019,” J. Cleaner Prod., vol. 258, 2020, Art. no. 120689,
[2] F. Arute et al., “Quantum supremacy using a programmable superconduct- doi: 10.1016/j.jclepro.2020.120689.
ing processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019. [28] S. Neelam and S. K. Sood, “A scientometric review of global research on
[3] C. Palmer, “Quantum computing quickly scores second claim of smart disaster management,” IEEE Trans. Eng. Manage., vol. 68, no. 1,
supremacy,” Engineering, vol. 7, no. 9, pp. 1199–1200, 2021. pp. 317–329, Feb. 2021, doi: 10.1109/TEM.2020.2972288.
[4] H. J. Kimble, “The quantum internet,” Nature, vol. 453, no. 7198, [29] S. K. Sood, K. S. Rawat, and G. Sharma, “Role of enabling technologies
pp. 1023–1030, 2008. in soft tissue engineering: A systematic literature review,” IEEE Eng.
[5] F. Bova, A. Goldfarb, and R. G. Melko, “Commercial applications of Manage. Rev., vol. 50, no. 4, pp. 155–169, Dec. 2022.
quantum computing,” EPJ Quantum Technol., vol. 8, no. 1, pp. 2–15, [30] L. Heilig and S. Voß, “A scientometric analysis of cloud computing
2021. literature,” IEEE Trans. Cloud Comput., vol. 2, no. 3, pp. 266–278,
[6] A. Kumar and S. Garhwal, “State-of-the-art survey of quantum cryptogra- Jul.–Sep. 2014.
phy,” Arch. Comput. Methods Eng., vol. 28, no. 5, pp. 3831–3868, 2021. [31] B. Raza, R. Ahmad, M. H. N. B. M. Nasir, and S. S. M. Fauzi, “Socio-
[7] A. Acín, J. I. Cirac, and M. Lewenstein, “Entanglement percolation in technical congruence as an emerging concept in software development: A
quantum networks,” Nature Phys., vol. 3, no. 4, pp. 256–259, 2007. scientometric analysis and critical literature review,” IEEE Access, vol. 9,
[8] U. Azad, B. K. Behera, E. A. Ahmed, P. K. Panigrahi, and A. Farouk, pp. 129051–129077, 2021.
“Solving vehicle routing problem using quantum approximate optimiza- [32] S. Ozcan and A. Corum, “A scientometric analysis of remanufacturing
tion algorithm,” IEEE Trans. Intell. Transp. Syst., to be published, by mapping scientific, organizational, and national concentration zones,”
doi: 10.1109/TITS.2022.3172241. IEEE Trans. Eng. Manage., vol. 68, no. 4, pp. 1055–1071, Aug. 2021.
[9] Y. Li, R.-G. Zhou, R. Xu, J. Luo, W. Hu, and P. Fan, “Implementing [33] A.-W. Harzing and S. Alakangas, “Google Scholar, Scopus and the Web
graph-theoretic feature selection by quantum approximate optimization of Science: A longitudinal and cross-disciplinary comparison,” Sciento-
algorithm,” IEEE Trans. Neural Netw. Learn. Syst., to be published, metrics, vol. 106, no. 2, pp. 787–804, 2016.
doi: 10.1109/TNNLS.2022.3190042. [34] A. A. Chadegani et al., “A comparison between two main academic
[10] V. Stooß, M. Ulmke, and F. Govaers, “Quantum computing for applications literature collections: Web of Science and Scopus databases,” vol. 9, no. 5,
in data fusion,” IEEE Trans. Aerosp. Electron. Syst., vol. 59, no. 2, 2013, arXiv:1305.0377, doi: 10.5539/ass.v9n5p18.
pp. 2002–2012, Apr. 2022, doi: 10.1109/TAES.2022.3212026. [35] C. Chen and M. Song, “Visualizing a field of research: A methodology
[11] P. Knight and I. Walmsley, “UK national quantum technology programme,” of systematic scientometric reviews,” PLoS One, vol. 14, no. 10, 2019,
Quantum Sci. Technol., vol. 4, no. 4, 2019, Art. no. 040502. Art. no. e0223994.
[12] Y. Yamamoto, M. Sasaki, and H. Takesue, “Quantum information science [36] C. Chen, Z. Hu, S. Liu, and H. Tseng, “Emerging trends in regenerative
and technology in Japan,” Quantum Sci. Technol., vol. 4, no. 2, 2019, medicine: A scientometric analysis in CiteSpace,” Expert Opin. Biol. Ther.,
Art. no. 020502. vol. 12, no. 5, pp. 593–608, 2012.
[13] B. Sussman, P. Corkum, A. Blais, D. Cory, and A. Damascelli, “Quantum [37] M. Jacomy, T. Venturini, S. Heymann, and M. Bastian, “ForceAtlas2,
Canada,” Quantum Sci. Technol., vol. 4, no. 2, 2019, Art. no. 020503. a continuous graph layout algorithm for handy network visualization
[14] Q. Zhang, F. Xu, L. Li, N.-L. Liu, and J.-W. Pan, “Quantum informa- designed for the Gephi software,” PLoS One, vol. 9, no. 6, 2014, Art. no.
tion research in China,” Quantum Sci. Technol., vol. 4, no. 4, 2019, e98679.
Art. no. 040503. [38] N. V. Eck and L. Waltman, “Software survey: VOSviewer, a com-
[15] T. Scheidsteger, R. Haunschild, L. Bornmann, and C. Ettl, “Bibliometric puter program for bibliometric mapping,” Scientometrics, vol. 84, no. 2,
analysis in the field of quantum technology,” Quantum Rep., vol. 3, no. 3, pp. 523–538, 2010.
pp. 549–575, 2021. [39] M. J. Cobo, A. G. López-Herrera, E. Herrera-Viedma, and F. Herrera,
[16] J. Wang, L. Shen, and W. Zhou, “A bibliometric analysis of quantum “SciMAT: A new science mapping analysis software tool,” J. Amer. Soc.
computing literature: Mapping and evidences from Scopus,” Technol. Inf. Sci. Technol., vol. 63, no. 8, pp. 1609–1630, 2012.
Anal. Strategic Manage., vol. 33, no. 11, pp. 1347–1363, 2021. [40] J. D. Johnson, “UCINET: A software tool for network analysis,” Commun.
[17] M. Coccia, S. Roshani, and M. Mosleh, “Evolution of quantum com- Educ., vol. 36, no. 1, pp. 92–94, 1987.
puting: Theoretical and innovation management implications for emerg- [41] C. Chen, “CiteSpace II: Detecting and visualizing emerging trends and
ing quantum industry,” IEEE Trans. Eng. Manage., to be published, transient patterns in scientific literature,” J. Amer. Soc. Inf. Sci. Technol.,
doi: 10.1109/TEM.2022.3175633. vol. 57, no. 3, pp. 359–377, 2006.
[18] S. Dhawan, B. Gupta, and S. Bhusan, “Global publications output in quan- [42] Y. Fang, J. Yin, and B. Wu, “Climate change and tourism: A scientometric
tum computing research: A scientometric assessment during 2007-16,” analysis using CiteSpace,” J. Sustain. Tourism, vol. 26, no. 1, pp. 108–126,
Emerg. Sci. J., vol. 2, no. 4, pp. 228–237, 2018. 2018.
[19] A. Bhasin and M. Tripathi, “Quantum computing at an inflection point: [43] C. Chen, “The CiteSpace manual,” College Comput. Inform., vol. 1, no. 1,
Are we ready for a new paradigm,” IEEE Trans. Eng. Manage., vol. 70, pp. 1–84, 2014.
no. 7, pp. 2546–2557, Jul. 2023.

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.
6676 IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, VOL. 71, 2024

[44] A. Liberati et al., “The PRISMA statement for reporting systematic reviews [71] H. Nezamabadi-Pour, “A quantum-inspired gravitational search algorithm
and meta-analyses of studies that evaluate health care interventions: Expla- for binary encoded optimization problems,” Eng. Appl. Artif. Intell.,
nation and elaboration,” Ann. Intern. Med., vol. 151, no. 4, pp. W-65–W-94, vol. 40, pp. 62–75, 2015.
2009. [72] F. Yan, A. M. Iliyasu, and S. E. Venegas-Andraca, “A survey of quantum
[45] T. Ma, Y. Liu, and M. Han, “Visualization analysis of organizational image representations,” Quantum Inf. Process., vol. 15, no. 1, pp. 1–35,
resilience research based on CiteSpace from 1990–2022,” IEEE Access, 2016.
vol. 10, pp. 65854–65872, 2022, doi: 10.1109/ACCESS.2022.3184686. [73] V. Dunjko, J. M. Taylor, and H. J. Briegel, “Quantum-enhanced machine
[46] C. Chen and S. Morris, “Visualizing evolving networks: Minimum span- learning,” Phys. Rev. Lett., vol. 117, no. 13, 2016, Art. no. 130501.
ning trees versus pathfinder networks,” in Proc. IEEE Symp. Inf. Visual., [74] A. M. Iliyasu, P. Q. Le, F. Dong, and K. Hirota, “Watermarking and authen-
2003, pp. 67–74, doi: 10.1109/INFVIS.2003.1249010. tication of quantum images based on restricted geometric transformations,”
[47] C. Chen, CiteSpace: A Practical Guide for Mapping Scientific Literature. Inf. Sci., vol. 186, no. 1, pp. 126–149, 2012.
Hauppauge, NY, USA: Nova Sci. Publishers, 2016. [75] H. Cao, F. Cao, and D. Wang, “Quantum artificial neural networks with
[48] B. Korzh et al., “Provably secure and practical quantum key distribution applications,” Inf. Sci., vol. 290, pp. 1–6, 2015.
over 307 km of optical fibre,” Nature Photon., vol. 9, no. 3, pp. 163–168, [76] S. J. Nawaz, S. K. Sharma, S. Wyne, M. N. Patwary, and M. Asaduzzaman,
2015. “Quantum machine learning for 6G communication networks: State-of-
[49] S. Wang et al., “Twin-field quantum key distribution over 830-km fibre,” the-art and vision for the future,” IEEE Access, vol. 7, pp. 46317–46350,
Nature Photon., vol. 16, no. 2, pp. 154–161, 2022. 2019.
[50] A. S. Cacciapuoti, M. Caleffi, F. Tafuri, F. S. Cataliotti, S. Gherar- [77] J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd,
dini, and G. Bianchi, “Quantum internet: Networking challenges in dis- “Quantum machine learning,” Nature, vol. 549, no. 7671, pp. 195–202,
tributed quantum computing,” IEEE Netw., vol. 34, no. 1, pp. 137–143, 2017.
Jan./Feb. 2019. [78] G. Carleo and M. Troyer, “Solving the quantum many-body problem with
[51] N. Hosseinidehaj, Z. Babar, R. Malaney, S. X. Ng, and L. Hanzo, “Satellite- artificial neural networks,” Science, vol. 355, no. 6325, pp. 602–606, 2017.
based continuous-variable quantum communications: State-of-the-art and [79] P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector ma-
a predictive outlook,” IEEE Commun. Surveys Tuts., vol. 21, no. 1, chine for Big Data classification,” Phys. Rev. Lett., vol. 113, no. 13, 2014,
pp. 881–919, Jan.–Mar. 2019. Art. no. 130503.
[52] A. Aguado et al., “The engineering of software-defined quantum key [80] V. Havlíček et al., “Supervised learning with quantum-enhanced feature
distribution networks,” IEEE Commun. Mag., vol. 57, no. 7, pp. 20–26, spaces,” Nature, vol. 567, no. 7747, pp. 209–212, 2019.
Jul. 2019. [81] J. W. Bos, C. Costello, M. Naehrig, and D. Stebila, “Post-quantum key
[53] H. V. Nguyen et al., “Exit-chart aided quantum code design improves the exchange for the TLS protocol from the ring learning with errors problem,”
normalised throughput of realistic quantum devices,” IEEE Access, vol. 4, in Proc. IEEE Symp. Secur. Privacy, 2015, pp. 553–570.
pp. 10194–10209, 2016, doi: 10.1109/ACCESS.2016.2591910. [82] E. Diamanti, H.-K. Lo, B. Qi, and Z. Yuan, “Practical challenges in
[54] T. Lunghi et al., “Experimental bit commitment based on quantum com- quantum key distribution,” NPJ Quantum Inf., vol. 2, no. 1, pp. 1–12,
munication and special relativity,” Phys. Rev. Lett., vol. 111, no. 18, 2013, 2016.
Art. no. 180504. [83] D. J. Bernstein et al., “Sphincs: Practical stateless hash-based signatures,”
[55] T. Lethen, “Bit commitment as an introduction to quantum cryptography,” in Proc. Annu. Int. Conf. Theory Appl. Cryptographic Techn., 2015,
Eur. J. Phys., vol. 43, no. 5, 2022, Art. no. 055402. pp. 368–397, doi: 10.1007/978-3-662-46800-5_15.
[56] M. Hayashi, “Secure list decoding and its application to bit-string commit- [84] J. Bos et al., “Crystals-kyber: A CCA-secure module-lattice-based
ment,” IEEE Trans. Inf. Theory, vol. 68, no. 6, pp. 3620–3642, Jun. 2022. KEM,” in Proc. IEEE Eur. Symp. Secur. Privacy, 2018, pp. 353–367,
[57] M. Khawasik, W. Elsayed, M. Rashad, and A. Younes, “A secured quantum doi: 10.1109/EuroSP.2018.00032.
two-bit commitment protocol for communication systems,” IEEE Access, [85] T. M. Fernández-Caramés, “From pre-quantum to post-quantum IoT se-
vol. 10, pp. 50218–50226, 2022. curity: A survey on quantum-resistant cryptosystems for the Internet of
[58] L. Li and R.-H. Shi, “A feasible and practically secure quantum bit Things,” IEEE Internet Things J., vol. 7, no. 7, pp. 6457–6480, Jul. 2020.
commitment protocol,” Modern Phys. Lett. A, vol. 36, no. 34, 2021, [86] A. A. Abd El-Latif, B. Abd-El-Atty, M. S. Hossain, S. Elmougy, and A.
Art. no. 2150247. Ghoneim, “Secure quantum steganography protocol for fog cloud Internet
[59] C. Erven, N. Ng, N. Gigov, R. Laflamme, S. Wehner, and G. Weihs, “An of Things,” IEEE Access, vol. 6, pp. 10332–10340, 2018.
experimental implementation of oblivious transfer in the noisy storage [87] C. A. Miller and Y. Shi, “Robust protocols for securely expanding ran-
model,” Nature Commun., vol. 5, no. 1, 2014, Art. no. 3418. domness and distributing keys using untrusted quantum devices,” J. ACM,
[60] C. H. Bennett and G. Brassard, “Quantum cryptography: Public key vol. 63, no. 4, pp. 1–63, 2016.
distribution and coin tossing,” vol. 560, pp. 7–11, 2020, arXiv:2003.06557. [88] C. Zhang, Z.-W. Sun, X. Huang, and D.-Y. Long, “Three-party quantum
[61] P. J. O’Malley et al., “Scalable quantum simulation of molecular energies,” summation without a trusted third party,” Int. J. Quantum Inf., vol. 13,
Phys. Rev. X, vol. 6, no. 3, 2016, Art. no. 031007. no. 2, 2015, Art. no. 1550011.
[62] J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, “The theory [89] G. Xu, K. Xiao, Z. Li, X.-X. Niu, and M. Ryan, “Controlled secure
of variational hybrid quantum-classical algorithms,” New J. Phys., vol. 18, direct communication protocol via the three-qubit partially entangled set
no. 2, 2016, Art. no. 023023. of states,” Comput. Mater. Continua, vol. 58, no. 3, pp. 809–827, 2019.
[63] T. Albash and D. A. Lidar, “Adiabatic quantum computation,” Rev. Modern [90] E. Bernstein and U. Vazirani, “Quantum complexity theory,” in Proc. 25th
Phys., vol. 90, no. 1, 2018, Art. no. 015002. Annu. ACM Symp. Theory Comput., 1993, pp. 11–20.
[64] I. M. Georgescu, S. Ashhab, and F. Nori, “Quantum simulation,” Rev. [91] L. M. Adleman, J. Demarrais, and M.-D. A. Huang, “Quantum computabil-
Modern Phys., vol. 86, no. 1, 2014, Art. no. 153. ity,” SIAM J. Comput., vol. 26, no. 5, pp. 1524–1540, 1997.
[65] H. Bernien et al., “Probing many-body dynamics on a 51-atom quantum [92] H. Spakowski, M. Thakur, and R. Tripathi, “Quantum and classical
simulator,” Nature, vol. 551, no. 7682, pp. 579–584, 2017. complexity classes: Separations, collapses, and closure properties,” Inf.
[66] J. Zhang et al., “Observation of a many-body dynamical phase transi- Computation, vol. 200, no. 1, pp. 1–34, 2005.
tion with a 53-qubit quantum simulator,” Nature, vol. 551, no. 7682, [93] U. D. Lago, A. Masini, and M. Zorzi, “Quantum implicit computational
pp. 601–604, 2017. complexity,” Theor. Comput. Sci., vol. 411, no. 2, pp. 377–409, 2010.
[67] J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum, [94] Y. Tanaka, “Exact non-identity check is NQP-complete,” Int. J. Quantum
vol. 2, 2018, Art. no. 79. Inf., vol. 8, no. 5, pp. 807–819, 2010.
[68] M. R. Singh and S. S. Mahapatra, “A quantum behaved particle swarm [95] H. Nishimura and M. Ozawa, “Perfect computational equivalence between
optimization for flexible job shop scheduling,” Comput. Ind. Eng., vol. 93, quantum turing machines and finitely generated uniform quantum circuit
pp. 36–44, 2016. families,” Quantum Inf. Process., vol. 8, pp. 13–24, 2009.
[69] B. Cao, S. Fan, J. Zhao, P. Yang, K. Muhammad, and M. Tanveer, [96] H. Blier and A. Tapp, “A quantum characterization of np,” Comput.
“Quantum-enhanced multiobjective large-scale optimization via paral- Complexity, vol. 21, pp. 499–510, 2012.
lelism,” Swarm Evol. Computation, vol. 57, 2020, Art. no. 100697.
[70] M. Soleimanpour-Moghadam, H. Nezamabadi-Pour, and M. M. Farsangi,
“A quantum inspired gravitational search algorithm for numerical function
optimization,” Inf. Sci., vol. 267, pp. 83–100, 2014.

Authorized licensed use limited to: National University Fast. Downloaded on November 22,2024 at 04:26:52 UTC from IEEE Xplore. Restrictions apply.