Professional Documents
Culture Documents
Quantum Computing: Vision and Challenges
Quantum Computing: Vision and Challenges
b Oxford e-Research Centre (OeRC), Department of Engineering Science, University of Oxford, Oxford, UK,
c Dipartimento di Matematica e Fisica, Università della Campania “Luigi Vanvitelli”, Italy,
d Quantum and High Performance Computing Group, Computer Science Department, University of Oviedo, Oviedo, Spain,
e Quantum Information Science Section, Oak Ridge National Laboratory, Oak Ridge, TN, USA,
f Detecon International GmbH, Munich, Germany,
g Center for Applied Mathematics, Tianjin University, Tianjin, China,
h Department of Computer Science and York Centre for Quantum Technologies, University of York, York, UK,
i Fujitsu Research of America, Inc., Santa Clara, CA, USA,
j Information Networking Institute, Carnegie Mellon University, USA,
k Cymax Group Technologies, British Columbia, Canada,
l Microsoft, Schiphol, Netherlands,
m Mathematics and Computational Research Division, Argonne National Laboratory, IL, USA,
n School of Computer Science, University of Bristol, UK,
o Department of Computer Science, Faculty of Computers and Artificial Intelligence, South Valley University, Hurghada, Egypt,
p Department of Information Systems University of Maryland, Baltimore County (UMBC), Baltimore, USA,
q Retired Professor, The University of Melbourne, Victoria, Australia,
∗ Correspondenceto: School of Electronic Engineering and Computer Science, Queen Mary University of London, London, E1 4NS, UK.
s.s.gill@qmul.ac.uk (S.S. Gill); oktay.cetinkaya@eng.ox.ac.uk (O. Cetinkaya); stefano.marrone@unicampania.it (S.
Marrone); efernandezca@uniovi.es (E.F. Combarro); claudinodc@ornl.gov (D. Claudino); david.haunschild@detecon.com (D.
Haunschild); leon.schlote@detecon.com (L. Schlote); whming@tju.edu.cn (H. Wu); carlo.ottaviani@york.ac.uk (C. Ottaviani);
xliu@fujitsu.com (X. Liu); smachupa@andrew.cmu.edu (S.P. Machupalli); kamalpreet.k@cymax.com (K. Kaur);
priyansh.arora@microsoft.com (P. Arora); ji.liu@anl.gov (J. Liu); bh22503@bristol.ac.uk (S. Shamshad);
ahmed.farouk@sci.svu.edu.eg (A. Farouk); songh@umbc.edu (H.H. Song); steve.uhlig@qmul.ac.uk (S. Uhlig);
rkotagiri@gmail.com (K. Ramamohanarao)
ORCID (s): 0000-0002-3913-0369 (S.S. Gill)
Businesses • Logistics, Telecommuting, Electrical Power, Banking (for rapid Risk Estimation,
Commerce, Shaky Markets Portfolios Improvement) and Design Robotics
Applications • Digital Privacy, Medical Services (for Rapid Radiation Treatments, Accurate
Diagnoses, and Solid Evidence) and Automotive Industry
When applied to classical data, QAI has the potential to greatly accelerate machine intelligence techniques [20].
Quantum neural networks, quantum support vector machines, and quantum principle component evaluation have
all been proposed previously [21, 22]. New research has demonstrated encouraging findings [23], although it is
still not completely known if quantum neural networks will provide better computing efficiency than traditional
machine learning executions. Because quantum computers use less energy due to algorithmic advantage and quantum
mechanical properties, using QAI methods to tackle data-driven issues may lower energy costs and decrease our
dependence on energy sources [24].
There exist several different quantum computing paradigms. The most popular ones are measurement-based or
one-way quantum computing, adiabatic quantum computing (usually implemented in practice as quantum annealing),
and the quantum circuit framework for gate-based general quantum computing [25]. Since it is possible to re-program
quantum computers according to particular issues, the quantum circuit model stands out as an especially feasible option
[26]. Currently, only a high-level programming language specific to quantum computing, such as Qiskit, PennyLane,
and similar libraries, exists at this time; however, they need transpilation. Instead, a circuit architecture needs to build
the quantum circuits by organising the necessary quantum gates (these are just "instructions" that are executed in
sequence) and operations according to a pre-designed architecture.
The study of post-quantum crytography is yet another hot topic in quantum information processing. The purpose
of cybersecurity is to prevent data from falling into the wrong hands [25]. Even though quantum cryptography uses
quantum features to share a quantum key (Quantum Key Distribution (QKD)) [25], post-quantum encryption relies on
building conventional cryptographic methods that are difficult for a quantum computer to crack [27]. Multiple methods,
including those based on lattices, hashes, and codes are now the subject of intense development for use in post-quantum
cryptography [28].
Investigation into quantum computing is booming, with exciting new advances in several areas, including hardware,
software, algorithms, error correction on NISQ devices, and technologies. Scientists and industry experts researching
a variety of subjects may benefit from this article’s thorough and up-to-date information on current advances and
potential future developments. For instance, Figure 1 shows that quantum computing has several benefits for users,
programmers, and various business sectors by delegating key tasks.
QUANTUM PROPERTIES
SUPERPOSITION ENTANGLEMENT
?
0
Located Having an
impact over
“here” “there”
of quantum physics, qubits can not only be either ‘0’ or ‘1’, but even ‘0’ and ‘1’ at the same time. As a result, the
numerical representation of a qubit is 𝑎|0⟩ + 𝑏|1⟩, whereby 𝑎 and 𝑏 are parameters that enable the combination or
superposition of the ‘0’ and ‘1’ states [2]. Using qubit superposition, a vast computational space becomes available,
allowing for the solution of several problems of extreme complexity. Even a very limited number of qubits can be used
to solve substantially larger dataset issues, thanks to the rapidly expanding computational domain as a function of the
total number of qubits. This demonstrates the potential of quantum computing. Figure 2 shows the relevant quantum
properties.
Entanglement is another essential aspect of quantum computation [4]. While classical bits are independent of each
other when setting bit values, qubits allow for the placement of bits in an entangled state. When qubits are in an
entangled state, their characteristics are interdependent, even if they are physically apart. As a result, all qubits in an
entangled state can have their characteristics changed even if only one of them is analysed. When used for dense coding
or quantum simulation of linked networks, entanglement becomes a valuable asset [29]. Commonly, a well-specified
set of instructions is followed when a computing issue is simulated on a quantum computer [30]. The subsequent
quantum algorithm makes use of stochastic operations, quantum entanglement and the properties of the superpositions
to increase the likelihood of the desired results while decreasing the likelihood of adverse outcomes [31]. Quantification
is the last stage of quantum computing; it collapses the stochastic quantum state into a deterministic state. Although
quantum algorithms promise that the correct outcome has the highest likelihood, the stochastic nature of the process
cannot guarantee that the correct outcome is actually sampled. Therefore, the detection and prevention of such adverse
outcomes called quantum error correction play an essential role in the viability of resilient quantum computing.
2.1. An Overview
A massive quantum machine’s fundamental components are a control unit (quantum central processing unit),
quantum gates, quantum management and monitoring circuits, quantum error identification and correction devices,
and quantum memories [26]. The fundamental functions are carried out via quantum gates in quantum computers
[27]. Additionally, quantum recognition and correction codes can locate and correct any errors made by the quantum
gates during their operations. Given their uses, quantum gates can be implemented in different configurations, including
shallow networks [25] and simultaneous quantum polynomial-time networks [28]. Quantum memories are collections
of different quantum states in different superposition configurations. The quantum states of a quantum circuit can be
stored in quantum memory through the use of quantum registers. By assembling robust quantum systems from arrays of
quantum states, quantum storage has recently been realised [34]. After the development of large-scale, error-correcting
computers with quantum memory in the future, the quantum processor, an integral part of a quantum computer, will be
able to communicate with other components of the system via the quantum network [19]. When it comes to quantum
operations, correction of errors, and detection, quantum machines need a quantum control and measuring system to
keep an eye on all the different quantum state manipulations [35]. Utilizing ancillary qubits, an error in quantum
machines can be found without affecting the data stored in data qubits [36]. It should be mentioned that quantum
computers detect faults differently than regular error-correcting codes in traditional computing systems. This is due to
the fact that changes to a quantum state’s magnitude or state can cause faults in quantum machines [37].
2.2. Algorithms
A quantum computer is based on the principles of quantum mechanics and uses these principles to its advantage
[16]. From their origins in quantum physics models to many modern computer science uses, quantum algorithms
have come a long way. A highly coveted step towards attaining the processing capacity of its type, an industrial-
scale quantum computer would certainly have ramifications in several domains, including cybersecurity and others
[13]. Daniel Simon presented the first quantum method to beat classical algorithms in terms of performance [34].
Deutsch-Jozsa Algorithm, Bernstein-Vazirani Algorithm, Simon’s Algorithm, and Shor’s Algorithm were introduced
to focus on problems that require exponential queries (i.e. cutting down on the amount of computing power required to
examine algorithms and assess their balance or robustness with certainty), efficient solutions of black-box problems,
faster computation, speedup, and integer factorisation, and discrete logarithm problems, respectively [4, 38]. These
algorithms were based on the quantum Fourier transform. Furthermore, Grover’s algorithm and quantum counting
were developed to concentrate on searching unstructured databases for marked entries and generalised searches,
respectively [34, 39]. Both of these algorithms were created based on amplitude amplification, which is a robust
strategy to make quantum computers capable of solving challenges quickly and effectively that might be impossible
to solve with traditional approaches. Numerous quantum algorithms rely on this, such as those for quantum machine
learning, quantum simulation, and quantum search. Finally, a quantum approximate optimisation approach centered
on the solution of graph theory issues has been recently proposed. This approach is built on a hybrid quantum/classical
algorithm [34, 40].
From a foundational point of view, all software-related aspects are based on two different computational models,
which determine some differences in the programming paradigms as well as in applications and technical aspects: the
quantum gate [41] and quantum annealing models [42]. The gate model uses quantum gates to perform operations on
qubits. These gates manipulate qubits in a manner similar to classical logic gates, with the ability to exploit quantum-
related features such as entanglement and superposition. This is a universal computational model in which the above-
mentioned Shor’s and Grover’s algorithms can be implemented; hence, the applications based on this model have
the widest range. From a technical point of view, decoherence is the main problem, and error correction is the most
required practice. On the other hand, quantum annealing is an approximate implementation of adiabatic quantum
computing, which is itself equivalent to the digital model, which seems to be a promising alternative to the gate model
for solving large optimisation problems. This paradigm is based on the natural tendency of quantum systems to find
low-energy states. It relies on the natural quantum mechanical process of tunneling and requires maintaining a coherent
quantum state over the annealing process. It is somewhat less sensitive to errors compared to the gate model because
it exploits the quantum system’s natural tendency to find a low-energy state, making it robust against certain types of
computational errors.
[25, 34]. Instead of using conventional algorithms founded on arithmetic that uses fewer resources and is easier to use,
quantum security makes use of the basic quantum principles (entanglement) [28]. Furthermore, since it is impossible
to recreate the exact quantum state of a set of qubits and the information encoded within it, it is significantly more
difficult for an adversary to develop an attack since they would require continuous access [27]. This also simplifies
the implementation of snooping detection. Further, quantum-based principles make novel approaches to network
design and architecture possible. This approach, known as quantum internet, promises security improvements through
quantum authenticity, long- and short-distance entanglement, improved data analysis driven by quantum computing
accelerated machine learning (ML), and quantum-specific anomaly detection. Some of the methods used for anomaly
detection focus on recognizing efficiency mismatches, detector blinding, detection system dead-time, beam-splitter,
spatial mode, and eavesdropping [26].
Quantum
- Statistical Modelling of Climate
Modelling
Computing
Climate
- Numerical weather predictions
- Global Warming and Carbon Neutrality
state and erase the information in qubits. A large number of physical qubits are needed to execute a quantum algorithm
successfully; this necessitates a tight and constant link between the classical structure and the quantum device, which in
turn creates a massive control burden [28]. Additionally, the connection and overhead costs increase the complexity of
the run-time control, design, and installation for quantum computing processes. At the moment, the qubit count serves
as a measure of quantum computing equipment’s computational capacity. However, this metric is off by a significant
margin, and it raises questions about the viability of supercomputer-level quantum machines with over a thousand
qubits. Qubit design necessitates an efficient cooling component to manage heat, which AI-driven systems may be
able to do. This increases scalability and allows for the solution of dynamically scaled, tricky issues.
provide trustworthy service in the years to come, state-of-the-art AI/ML-based methods may be utilised for automatic
error identification and rectification on the fly [61]. Nonetheless, it results in additional expenses for training AI/ML
methods [62].
However, improving the dependability of computations does not only pass through more reliable hardware. In their
seminal work, Avižienis at al. [63] defines a taxonomy of dependable computing reporting applicable countermeasures
at hardware and software levels. Software techniques to improve traditional computations and to tolerate hardware faults
are nowadays a common practice in computer engineering. The challenges are to extend such software engineering
practice to pursue highly dependable quantum programs [64]; on the other hand, correct-by-construction is still a
valid aim of software engineering, also applied to quantum computing: the application to quantum of model-driven
engineering, formal modelling, advanced verification and validation techniques are other future challenges to deal with
[13].
6.3. Quantum ML
The use of principal component analysis, quantifying vectors, classifiers, regression, and stochastic modelling
are common tools used by machine learning scientists [34]. Using quantum computers to manage massive datasets
with gadgets ranging from 100 to 1000 qubits may increase the effectiveness and scalability of AI methods [16].
Additionally, by rapidly creating and evaluating certain statistical distributions, including training in conventional and
quantum generative algorithms, quantum computers might pique the curiosity of the field of machine learning. As a
result of the increasing amount of inputs (the number of participants) for quantum recommendation algorithms, it is
becoming increasingly challenging to complete the task in a timely manner. Millions of qubits are required to deal
with big datasets and present demand. By supplying computational power and other machine learning tasks, hybrid
quantum-classical algorithms can overcome this challenge [37]. Limited qubit connection and increased decoherence in
the qubits caused by the device’s intrinsic noise are two additional important problems. The use of sophisticated AI/ML
can improve scalability and provide additional processing capacity to manage massive amounts of data produced by
different Internet of Things (IoT) gadgets [65].
difficulties with efficient data transformation due to long-distance entanglement dispersion. It will be more difficult
in the eventual quantum Internet to save the specifics of processes executed, which is a major drawback of current
quantum computing systems that rely on massive amounts of storage for processing and connectivity.
extensive number of gadgets (100–1000 qubits) might enhance the effectiveness and scalability of AI methods. To
realistically apply hybrid computing (quantum and conventional computing) and tackle today’s most difficult business
challenges, further effort is required. The advent of quantum computing will have far-reaching benefits for many other
areas, including computer security, biology, economics, and the production of new substances.
8. Conclusions
This article offers a vision and identifies various potential challenges on the topic of quantum computing. It has
been found that entanglement and superposition, two quantum mechanics instances, are anticipated to be crucial for
resolving computer issues. We discussed a number of quantum software methods and technologies, industrial quantum
computers, and cryptography after quantum computers. Finally, we highlights a number of concerns that have yet to
be solved, as well as promising new prospects for research and development in the field of quantum technology.
Conflict of Interest
On behalf of all authors, the corresponding authors state that there are no conflicts of interest.
Acknowledgements
We thank the Editor-in-Chief (Prof. Lin Liu), Associate Editor (Prof. Yunpeng Chai), and anonymous reviewers
for their insightful comments and recommendations to improve the overall quality. We would also like to express our
gratitude to Prof. Marcello Caleffi (University of Naples Federico II, Naples, Italy) and Prof. Ajith Kumar Parlikad
(University of Cambridge, Cambridge, UK) for their thoughtful remarks and valuable suggestions.
References
[1] T. Hey, “Richard Feynman and computation,” Contemporary Physics, vol. 40, no. 4, pp. 257–265, 1999.
[2] J. Preskill, “Quantum computing 40 years later,” in Feynman Lectures on Computation, pp. 193–244, CRC Press, 2023.
[3] V. Silva, “Richard Feynman, demigod of physics, father of the quantum computer,” in Quantum Computing by Practice: Python Programming
in the Cloud with Qiskit and IBM-Q, pp. 49–85, Springer, 2023.
[4] Z. Yang, M. Zolanvari, and R. Jain, “A survey of important issues in quantum computing and communications,” IEEE Communications Surveys
& Tutorials, 2023.
[5] M. Mikkelsen, J. Berezovsky, N. Stoltz, L. Coldren, and D. Awschalom, “Optically detected coherent spin dynamics of a single electron in a
quantum dot,” Nature Physics, vol. 3, no. 11, pp. 770–773, 2007.
[6] S. S. Gill, H. Wu, P. Patros, C. Ottaviani, P. Arora, V. C. Pujol, D. Haunschild, A. K. Parlikad, O. Cetinkaya, H. Lutfiyya, et al., “Modern
computing: Vision and challenges,” Telematics and Informatics Reports, vol. 13, pp. 1–38, 2024.
[7] S. Nadj-Perge, S. Frolov, E. Bakkers, and L. P. Kouwenhoven, “Spin–orbit qubit in a semiconductor nanowire,” Nature, vol. 468, no. 7327,
pp. 1084–1087, 2010.
[8] N. Hendrickx, W. Lawrie, L. Petit, A. Sammak, G. Scappucci, and M. Veldhorst, “A single-hole spin qubit,” Nature communications, vol. 11,
no. 1, p. 3478, 2020.
[9] A. Vourdas, “Quantum systems with finite hilbert space,” Reports on Progress in Physics, vol. 67, no. 3, p. 267, 2004.
[10] M. Singh et al., “Quantum artificial intelligence for the science of climate change,” in Artificial Intelligence, Machine Learning and Blockchain
in Quantum Satellite, Drone and Network, pp. 199–207, CRC Press, 2022.
[11] A. Kumar et al., “Securing the future internet of things with post-quantum cryptography,” Security and Privacy, vol. 5, no. 2, p. e200, 2022.
[12] S. Chen, J. Cotler, H.-Y. Huang, and J. Li, “The complexity of NISQ,” Nature Communications, vol. 14, no. 1, p. 6001, 2023.
[13] M. Piattini, M. Serrano, R. Perez-Castillo, G. Petersen, and J. L. Hevia, “Toward a quantum software engineering,” IT Professional, vol. 23,
no. 1, pp. 62–66, 2021.
[14] J. Howard, A. Lidiak, C. Jameson, B. Basyildiz, K. Clark, T. Zhao, M. Bal, J. Long, D. P. Pappas, M. Singh, et al., “Implementing two-qubit
gates at the quantum speed limit,” Physical Review Research, vol. 5, no. 4, p. 043194, 2023.
[15] M. AbuGhanem and H. Eleuch, “Two-qubit entangling gates for superconducting quantum computers,” Results in Physics, vol. 56, p. 107236,
2024.
[16] M. De Stefano, F. Pecorelli, D. Di Nucci, F. Palomba, and A. De Lucia, “Software engineering for quantum programming: How far are we?,”
Journal of Systems and Software, vol. 190, p. 111326, 2022.
[17] M. N. Leuenberger and D. Loss, “Quantum computing in molecular magnets,” Nature, vol. 410, no. 6830, pp. 789–793, 2001.
[18] A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum
eigensolver for small molecules and quantum magnets,” nature, vol. 549, no. 7671, pp. 242–246, 2017.
[19] A. D. Córcoles, A. Kandala, A. Javadi-Abhari, D. T. McClure, A. W. Cross, K. Temme, P. D. Nation, M. Steffen, and J. M. Gambetta,
“Challenges and opportunities of near-term quantum computing systems,” Proceedings of the IEEE, vol. 108, no. 8, pp. 1338–1352, 2019.
[20] M. Krenn, J. Landgraf, T. Foesel, and F. Marquardt, “Artificial intelligence and machine learning for quantum technologies,” Physical Review
A, vol. 107, no. 1, p. 010101, 2023.
[21] M. Mafu and M. Senekane, “Design and implementation of efficient quantum support vector machine,” in 2021 International Conference on
Electrical, Computer and Energy Technologies (ICECET), pp. 1–4, IEEE, 2021.
[22] P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,” Physical review letters, vol. 113,
no. 13, p. 130503, 2014.
[23] C. Ding, T.-Y. Bao, and H.-L. Huang, “Quantum-inspired support vector machine,” IEEE Transactions on Neural Networks and Learning
Systems, vol. 33, no. 12, pp. 7210–7222, 2021.
[24] S. S. Gill and R. Kaur, “ChatGPT: Vision and challenges,” Internet of Things and Cyber-Physical Systems, vol. 3, pp. 262–271, 2023.
[25] S. Pirandola and S. L. Braunstein, “Physics: Unite to build a quantum internet,” Nature, vol. 532, no. 7598, pp. 169–171, 2016.
[26] G. G. Rozenman, N. K. Kundu, R. Liu, L. Zhang, A. Maslennikov, Y. Reches, and H. Y. Youm, “The quantum internet: A synergy of quantum
information technologies and 6g networks,” IET Quantum Communication, vol. 4, no. 4, pp. 147–166, 2023.
[27] J. Illiano, M. Caleffi, A. Manzalini, and A. S. Cacciapuoti, “Quantum internet protocol stack: A comprehensive survey,” Computer Networks,
vol. 213, p. 109092, 2022.
[28] A. S. Cacciapuoti, M. Caleffi, F. Tafuri, F. S. Cataliotti, S. Gherardini, and G. Bianchi, “Quantum internet: Networking challenges in distributed
quantum computing,” IEEE Network, vol. 34, no. 1, pp. 137–143, 2019.
[29] S. S. Gill, “Quantum and blockchain based serverless edge computing: A vision, model, new trends and future directions,” Internet Technology
Letters, p. e275, 2021.
[30] L. M. Procopio, A. Moqanaki, M. Araújo, F. Costa, I. Alonso Calafell, E. G. Dowd, D. R. Hamel, L. A. Rozema, Č. Brukner, and P. Walther,
“Experimental superposition of orders of quantum gates,” Nature communications, vol. 6, no. 1, p. 7913, 2015.
[31] A. S. Rab, E. Polino, Z.-X. Man, N. Ba An, Y.-J. Xia, N. Spagnolo, R. Lo Franco, and F. Sciarrino, “Entanglement of photons in their dual
wave-particle nature,” Nature communications, vol. 8, no. 1, p. 915, 2017.
[32] M. Ying, “Quantum computation, quantum theory and ai,” Artificial Intelligence, vol. 174, no. 2, pp. 162–176, 2010.
[33] R. Buyya, S. N. Srirama, G. Casale, R. Calheiros, Y. Simmhan, B. Varghese, E. Gelenbe, B. Javadi, L. M. Vaquero, M. A. Netto, et al., “A
manifesto for future generation cloud computing: Research directions for the next decade,” ACM Computing Surveys (CSUR), vol. 51, no. 5,
pp. 1–38, 2018.
[34] A. Singh, K. Dev, H. Siljak, H. D. Joshi, and M. Magarini, “Quantum internet—applications, functionalities, enabling technologies, challenges,
and research directions,” IEEE Communications Surveys & Tutorials, vol. 23, no. 4, pp. 2218–2247, 2021.
[35] N. P. De Leon, K. M. Itoh, D. Kim, K. K. Mehta, T. E. Northup, H. Paik, B. Palmer, N. Samarth, S. Sangtawesin, and D. W. Steuerman,
“Materials challenges and opportunities for quantum computing hardware,” Science, vol. 372, no. 6539, p. eabb2823, 2021.
[36] W. Gilbert, T. Tanttu, W. H. Lim, M. Feng, J. Y. Huang, J. D. Cifuentes, S. Serrano, P. Y. Mai, R. C. Leon, C. C. Escott, et al., “On-demand
electrical control of spin qubits,” Nature Nanotechnology, vol. 18, no. 2, pp. 131–136, 2023.
[37] S. S. Gill, A. Kumar, H. Singh, M. Singh, K. Kaur, M. Usman, and R. Buyya, “Quantum computing: A taxonomy, systematic review and
future directions,” Software: Practice and Experience, vol. 52, no. 1, pp. 66–114, 2022.
[38] Y. Atia and D. Aharonov, “Fast-forwarding of hamiltonians and exponentially precise measurements,” Nature communications, vol. 8, no. 1,
p. 1572, 2017.
[39] N. K. Parida, C. Jatoth, V. D. Reddy, M. M. Hussain, and J. Faizi, “Post-quantum distributed ledger technology: a systematic survey,” Scientific
Reports, vol. 13, no. 1, p. 20729, 2023.
[40] V. Dixit and S. Jian, “Quantum Fourier transform to estimate drive cycles,” Scientific Reports, vol. 12, no. 1, p. 654, 2022.
[41] C. P. Williams, Quantum Gates, pp. 51–122. London: Springer London, 2011.
[42] W. Du, B. Li, and Y. Tian, “Quantum annealing algorithms: State of the art,” Jisuanji Yanjiu yu Fazhan/Computer Research and Development,
vol. 45, no. 9, p. 1501 – 1508, 2008.
[43] M. A. Serrano, J. A. Cruz-Lemus, R. Perez-Castillo, and M. Piattini, “Quantum software components and platforms: Overview and quality
assessment,” ACM Computing Surveys, vol. 55, no. 8, pp. 1–31, 2022.
[44] R. Pérez-Castillo, M. A. Serrano, and M. Piattini, “Software modernization to embrace quantum technology,” Advances in Engineering
Software, vol. 151, p. 102933, 2021.
[45] D. Vietz, J. Barzen, F. Leymann, and K. Wild, “On decision support for quantum application developers: categorization, comparison, and
analysis of existing technologies,” in International Conference on Computational Science, pp. 127–141, Springer, 2021.
[46] M. Aramon, G. Rosenberg, E. Valiante, T. Miyazawa, H. Tamura, and H. G. Katzgraber, “Physics-inspired optimization for quadratic
unconstrained problems using a digital annealer,” Frontiers in Physics, vol. 7, no. APR, 2019.
[47] T. Sasaki, Y. Yamamoto, and M. Koashi, “Practical quantum key distribution protocol without monitoring signal disturbance,” Nature, vol. 509,
no. 7501, pp. 475–478, 2014.
[48] D. J. Bernstein and T. Lange, “Post-quantum cryptography,” Nature, vol. 549, no. 7671, pp. 188–194, 2017.
[49] C. R. García, S. Rommel, S. Takarabt, J. J. V. Olmos, S. Guilley, P. Nguyen, and I. T. Monroy, “Quantum-resistant transport layer security,”
Computer Communications, vol. 213, pp. 345–358, 2024.
[50] M. D. Reed, L. DiCarlo, S. E. Nigg, L. Sun, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf, “Realization of three-qubit quantum error correction
with superconducting circuits,” Nature, vol. 482, no. 7385, pp. 382–385, 2012.
[51] G. Q. AI, “Suppressing quantum errors by scaling a surface code logical qubit,” Nature, vol. 614, no. 7949, pp. 676–681, 2023.
[52] A. J. Daley, I. Bloch, C. Kokail, S. Flannigan, N. Pearson, M. Troyer, and P. Zoller, “Practical quantum advantage in quantum simulation,”
Nature, vol. 607, no. 7920, pp. 667–676, 2022.
[53] S. Biswas and P. Das, “Analysis of quantum cryptology and the RSA algorithms defense against attacks using shor’s algorithm in a post
quantum environment,” in International Conference on Computational Intelligence in Communications and Business Analytics, pp. 72–87,
Springer, 2023.
[54] D. Claudino, B. Peng, K. Kowalski, and T. S. Humble, “Modeling singlet fission on a quantum computer,” The Journal of Physical Chemistry
Letters, vol. 14, pp. 5511–5516, 2023.
[55] Y. Nam, J.-S. Chen, N. C. Pisenti, K. Wright, C. Delaney, D. Maslov, K. R. Brown, S. Allen, J. M. Amini, J. Apisdorf, et al., “Ground-state
energy estimation of the water molecule on a trapped-ion quantum computer,” npj Quantum Information, vol. 6, no. 1, p. 33, 2020.
[56] M. Sisodia, “Comparison the performance of five-qubit IBM quantum computers in terms of bell states preparation,” Quantum Information
Processing, vol. 19, no. 8, p. 215, 2020.
[57] M. Motta, C. Sun, A. T. Tan, M. J. O’Rourke, E. Ye, A. J. Minnich, F. G. Brandao, and G. K.-L. Chan, “Determining eigenstates and thermal
states on a quantum computer using quantum imaginary time evolution,” Nature Physics, vol. 16, no. 2, pp. 205–210, 2020.
[58] S. Premaratne, S. Johri, X. Zou, R. Sagastizabal, M. A. Rol, B. Klaver, M. Moreira, C. Almudever, L. DiCarlo, and A. Matsuura, “Efficient
variational generation of thermofield double states on a superconducting quantum processor: Theory (part 1),” Bulletin of the American
Physical Society, vol. 65, 2020.
[59] A. Kumar et al., Quantum and Blockchain for Modern Computing Systems: Vision and Advancements. Springer, 2022.
[60] T. Subramanian et al., Artificial Intelligence, Machine Learning and Blockchain in Quantum Satellite, Drone and Network. CRC Press, 2022.
[61] S. S. Gill, M. Xu, C. Ottaviani, P. Patros, R. Bahsoon, A. Shaghaghi, M. Golec, V. Stankovski, H. Wu, A. Abraham, et al., “Ai for next
generation computing: Emerging trends and future directions,” Internet of Things, vol. 19, p. 100514, 2022.
[62] G. K. Walia et al., “AI-empowered fog/edge resource management for iot applications: A comprehensive review, research challenges and
future perspectives,” IEEE Communications Surveys & Tutorials, 2023.
[63] A. Avižienis, J.-C. Laprie, B. Randell, and C. Landwehr, “Basic concepts and taxonomy of dependable and secure computing,” IEEE
Transactions on Dependable and Secure Computing, vol. 1, no. 1, p. 11 – 33, 2004.
[64] A. Paler and S. J. Devitt, “An introduction into fault-tolerant quantum computing,” in 2015 52nd ACM/EDAC/IEEE Design Automation
Conference (DAC), pp. 1–6, 2015.
[65] R. Singh et al., “Edge AI: a survey,” Internet of Things and Cyber-Physical Systems, vol. 3, pp. 71–92, 2023.
[66] S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,” Science, vol. 362, no. 6412, p. eaam9288, 2018.