Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

River Publishers eBooks

Quantum Computing Trends

Ahmed Banafa

Published Jan 16, 2023• 0 citations
Publisher

Abstract

Classical computing relies, at its ultimate level, on principles expressed by the Boolean algebra. Physical qubits are the physical qubits in quantum computer, whereas logical qubits are groups of physical qubits that the peoples use as a single qubit in our computation to fight noise and improve error correction. Distinguishing between physical and logical qubits is important. Quantum annealer is a special purpose quantum computer designed to only run combinatorial optimization problems, not general-purpose computing, or cryptography problems. New cryptographic systems would secure against both quantum and conventional computers and can interoperate with existing communication protocols and networks. The symmetric key algorithms of the commercial national security algorithm suite were selected to be secure for national security systems usage even if a cryptographically relevant quantum computer is developed.

DOI
10.1201/9781003339175-10

Related papers

Quantum Computing Trends

Ahmed Banafa

Quantum computing is the area of study focused on developing computer technology based on the principles of quantum theory. As we progress to smaller and faster circuits, we begin to reach the physical limits of materials and the threshold for classical laws of physics to apply. Classical computers use transistors as the physical building blocks of logic, while quantum computers may use trapped ions, superconducting loops, quantum dots or vacancies in a diamond. Physical qubits are the physical qubits in a quantum computer, whereas logical qubits are groups of physical qubits we use as a single qubit in our computation to fight noise and improve error correction. There are many estimates as to how many qubits the authors will need to perform certain calculations, but some of these estimates talk about logical qubits and others talk about physical qubits. For example, to break RSA cryptography we would need thousands of logical qubits but millions of physical qubits.

River Publishers eBooks•Jul 13, 2023•2 citations

Quantum Computing: Unleashing the Power of Efficient Problem Solving

Sadaquat Ali Ruk, Maham Shahid, Areeba Raees +1 more

Quantum computing aims to outperform classical computers for some specific calculations. It relies on the additional resources given by the qubit superposition states, which can be used to design more efficiently. Reversibility of quantum computation may help in solving NP problems, which are easy in one direction but hard in the opposite sense. Quantum computers can enhance data processing and analysis tasks. The potential impact of quantum algorithms on optimization problems, simulation of quantum systems, and machine learning tasks such as clustering and classification. It also includes efforts to standardize quantum hardware and software interfaces, enabling interoperability and accelerating the adoption of quantum computing. The barriers we face while adopting Quantum computing are the accuracy of the information, lack of technical experts, and organizational interest in adopting the new process. We find one more critical barrier is the lack of standards of secure communication techniques while adopting quantum computing. While numerous challenges lie ahead, the promise of quantum computing in solving complex problems and driving innovation is too significant to ignore. We will examine the existing quantum algorithms and applications that have demonstrated quantum advantage or potential utility in various domains. The quantum computing field is expected to transition from physical qubits to error-corrected logical qubits. AI is likely to be unleashed by quantum computing for formidable progress advances in speed, cost, and algorithm learning function. Quantum computing solves one or two problems, with little practical use, and costs a fortune to run. Additionally, we will assess the challenges associated with scaling up quantum systems, addressing the issues of quantum coherence, error correction, and noise reduction.

Journal of Interdisciplinary Innovational Letters•Dec 31, 2024•0 citations

Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer

Feng Hu, Lucas Lamata, Chao Wang +3 more

The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the superexponential size $\mathcal{O}({2}^{{2}^{n}})$ of the associated space, finding $n$-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has already been addressed employing generic low-connected incoherent D-Wave quantum annealers. However, the limited connectivity of the Chimera graph, together with the exponential growth in the complexity of the Boolean-function design problem, limit the problem scalability. Here, we propose a special-purpose coherent quantum-annealing architecture with three couplers per qubit, designed to optimally encode the bent-function design problem. A coherent quantum annealer with this tree-type architecture has the potential to solve the eight-variable bent-function design problem, which is classically unsolved, with only $127$ physical qubits and $126$ couplers. This paves the way to reach useful quantum supremacy within the framework of quantum annealing for cryptographic purposes.

arXiv:1906.08140•Physical Review Applied•May 26, 2020•9 citations

Quantum Algorithms: Application Perspective

Renata Wong, Amandeep Singh Bhatia

In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.

Advances in information security, privacy, and ethics book series•Jan 1, 2021•2 citations

Design and Evaluation of Quantum-Resilient Cryptographic Protocols for National Information Systems Security

Emmanuel Philip Nittala

The rapid progress of quantum computing now poses a substantial security risk to the information infrastructures of various nations, which are fundamentally reliant on classical cryptographic systems. Encryption algorithms such as RSA, ECC, and, notably, Satyamani’s, Shor, and Grover algorithms are vulnerable to quantum attacks; indeed, these algorithms can compromise code creation and encryption protocols within seconds when subjected to powerful quantum computing devices. In response to this emerging threat, this paper presents the design and evaluation of a quantum-resilient cryptographic protocol suite intended for national information systems security. The proposed version integrates lattice-based key exchange and hash-based digital signatures, rendering it post-quantum and compatible with the existing Public Key Infrastructure (PKI) and network protocol stack. Formal security analysis and performance evaluation were conducted using simulated nationwide network environments. Experimental results demonstrate that the proposed scheme achieves a computational latency reduction of up to 45% compared to baseline post-quantum algorithms, while maintaining high resilience against both classical and quantum adversaries. The scalability test indicates that quantum-resilient cryptography can be deployed across various government apparatuses, promoting national cybersecurity and digital autonomy, while maintaining security and interoperability

International Journal of Emerging Trends in Computer Science and Information Technology•Jan 1, 2024•3 citations

Quantum Computing

Ordinary computers process signals that represent binary digits. Specialized circuits realize logical gates that are used to process these signals. Quantum computers harness and exploit properties of matter at the quantum level to represent bits and to process them. Thus quantum computing is an alternative method to compute and one that looks quite promising.

WORLD SCIENTIFIC (EUROPE) eBooks•Apr 20, 2017•0 citations
Classical computing relies, at its ultimate level, on principles expressed by the Boolean algebra. Physical qubits are the physical qubits in quantum computer, whereas logical qubits are groups of physical qubits that the peoples use as a single qubit in our computation to fight noise and improve error correction. Distinguishing between physical and logical qubits is important. Quantum annealer is a special purpose quantum computer designed to only run combinatorial optimization problems, not general-purpose computing, or cryptography problems. New cryptographic systems would secure against both quantum and conventional computers and can interoperate with existing communication protocols and networks. The symmetric key algorithms of the commercial national security algorithm suite were selected to be secure for national security systems usage even if a cryptographically relevant quantum computer is developed.
Quantum computing is the area of study focused on developing computer technology based on the principles of quantum theory. As we progress to smaller and faster circuits, we begin to reach the physical limits of materials and the threshold for classical laws of physics to apply. Classical computers use transistors as the physical building blocks of logic, while quantum computers may use trapped ions, superconducting loops, quantum dots or vacancies in a diamond. Physical qubits are the physical qubits in a quantum computer, whereas logical qubits are groups of physical qubits we use as a single qubit in our computation to fight noise and improve error correction. There are many estimates as to how many qubits the authors will need to perform certain calculations, but some of these estimates talk about logical qubits and others talk about physical qubits. For example, to break RSA cryptography we would need thousands of logical qubits but millions of physical qubits.
Quantum computing aims to outperform classical computers for some specific calculations. It relies on the additional resources given by the qubit superposition states, which can be used to design more efficiently. Reversibility of quantum computation may help in solving NP problems, which are easy in one direction but hard in the opposite sense. Quantum computers can enhance data processing and analysis tasks. The potential impact of quantum algorithms on optimization problems, simulation of quantum systems, and machine learning tasks such as clustering and classification. It also includes efforts to standardize quantum hardware and software interfaces, enabling interoperability and accelerating the adoption of quantum computing. The barriers we face while adopting Quantum computing are the accuracy of the information, lack of technical experts, and organizational interest in adopting the new process. We find one more critical barrier is the lack of standards of secure communication techniques while adopting quantum computing. While numerous challenges lie ahead, the promise of quantum computing in solving complex problems and driving innovation is too significant to ignore. We will examine the existing quantum algorithms and applications that have demonstrated quantum advantage or potential utility in various domains. The quantum computing field is expected to transition from physical qubits to error-corrected logical qubits. AI is likely to be unleashed by quantum computing for formidable progress advances in speed, cost, and algorithm learning function. Quantum computing solves one or two problems, with little practical use, and costs a fortune to run. Additionally, we will assess the challenges associated with scaling up quantum systems, addressing the issues of quantum coherence, error correction, and noise reduction.
The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the superexponential size O(22n)\mathcal{O}({2}^{{2}^{n}})O(22n) of the associated space, finding nnn-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has already been addressed employing generic low-connected incoherent D-Wave quantum annealers. However, the limited connectivity of the Chimera graph, together with the exponential growth in the complexity of the Boolean-function design problem, limit the problem scalability. Here, we propose a special-purpose coherent quantum-annealing architecture with three couplers per qubit, designed to optimally encode the bent-function design problem. A coherent quantum annealer with this tree-type architecture has the potential to solve the eight-variable bent-function design problem, which is classically unsolved, with only 127127127 physical qubits and 126126126 couplers. This paves the way to reach useful quantum supremacy within the framework of quantum annealing for cryptographic purposes.
In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.
The rapid progress of quantum computing now poses a substantial security risk to the information infrastructures of various nations, which are fundamentally reliant on classical cryptographic systems. Encryption algorithms such as RSA, ECC, and, notably, Satyamani’s, Shor, and Grover algorithms are vulnerable to quantum attacks; indeed, these algorithms can compromise code creation and encryption protocols within seconds when subjected to powerful quantum computing devices. In response to this emerging threat, this paper presents the design and evaluation of a quantum-resilient cryptographic protocol suite intended for national information systems security. The proposed version integrates lattice-based key exchange and hash-based digital signatures, rendering it post-quantum and compatible with the existing Public Key Infrastructure (PKI) and network protocol stack. Formal security analysis and performance evaluation were conducted using simulated nationwide network environments. Experimental results demonstrate that the proposed scheme achieves a computational latency reduction of up to 45% compared to baseline post-quantum algorithms, while maintaining high resilience against both classical and quantum adversaries. The scalability test indicates that quantum-resilient cryptography can be deployed across various government apparatuses, promoting national cybersecurity and digital autonomy, while maintaining security and interoperability