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

Springer eBooks

Quantum Computing Methods

Jack D. Hidary

Published Jan 1, 2019• 1 citation
Publisher
DOI
10.1007/978-3-030-23922-0_9

Related papers

Qubit Adoption Method of a Quantum Computing-Based Metaheuristics Algorithm for Truss Structures Analysis

Donwoo Lee, Seungjae Lee, Sudeok Shon

Since the mention of the Fourth Industrial Revolution in 2016, quantum computers and quantum computing (QC) have emerged as key technologies. Many researchers are trying to realize quantum computers and quantum computing. In particular, most of the development and application of metaheuristics algorithms using quantum computing is focused on computer engineering fields. Cases in which the developed algorithm is applied to the optimal design of a building or the optimal design results presented by expanding the algorithm in various directions are very insufficient. Therefore, in this paper, we proposed four methods of adopting qubits to perform pitch adjusting in the optimization process of the QbHS (quantum-based harmony search) algorithm and applied it to TTO (truss topology optimization) using four methods to compare the results. The four methods of adopting qubits have the same or decreased number of qubits adopted as the number of iterations changes. As a result of applying TTO using four methods, convergence performance differed depending on the adoption method, and convergence performance was superior to conventional HS (harmony search) algorithms in all methods. The optimal design of structural engineering using such QC is expected to contribute to the revitalization of future technologies in the architectural field and the field of computer information systems.

Biomimetics•Dec 27, 2023•4 citations

Quantum Computing Methods

Jack D. Hidary

Springer eBooks•Jan 1, 2021•3 citations

Quantum Computing Algorithms

Andreas Bärtschi

•Feb 16, 2024•0 citations

Quantum Computing and Its Promise in Drug Discovery

Rakhi Mishra, Prem Shankar Mishra, Rupa Mazumder +2 more

It is widely accepted that quantum computation and the science of quantum computation mechanics are excellent tools for drug design and discovery because of their high precision in estimating numerous relevant parameters. A scientist can use quantum computing to perform hundreds of millions of comparisons of complex molecules at the same time to examine matches between the molecules, and both the positive and negative effects of a new therapeutic approach can be predicted. These approaches make the most significant contribution to the development of drugs in clinical use or clinical trials. These methods emerge and develop in tandem with the experimental approaches used in drug design. Quantum Computational (QC) methods offer a highly precise description of protein–ligand interactions. This method defines nuclei and electron behavior and explains molecular interactions in terms of distribution and motion. Quantum computers have the potential to revolutionize computation by solving previously intractable problems. Quantum computers are extremely fast and efficient. They can perform calculations that would take decades or even millennia on today's supercomputers in a matter of seconds. Experts refer to this fact as quantum superiority over other traditional methods. Second, QCs can also be archetypal complicated structures that will allow researchers to understand the interaction of both small molecules and biologics before the preclinical and clinical stages of drug development. In practice, quantum computational methods will not be able to take over every task performed by classical computational methods—at least not anytime soon. However, in the future, these methods may be combined with traditional computational technologies such as machine learning (ML) and artificial intelligence (AI) to pave a new and groundbreaking path toward the goal of drug discovery and development.

Wiley eBooks•Jul 1, 2024•8 citations

Quantum computing and algorithms

Author 1 - Mr. K. Suresh Babu Author 2 : Dr. T. P. Anish Author 3 : Dr. Cornelius K

•Dec 3, 2025•0 citations

An Efficient Quantum Computing technique for cracking RSA using Shor’s Algorithm

Vaishali Bhatia, K. R. Ramkumar

Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor's algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor's technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor's algorithm is able to crack RSA.

International Conference on Computing, Communication and Automation•Oct 30, 2020•117 citations
Since the mention of the Fourth Industrial Revolution in 2016, quantum computers and quantum computing (QC) have emerged as key technologies. Many researchers are trying to realize quantum computers and quantum computing. In particular, most of the development and application of metaheuristics algorithms using quantum computing is focused on computer engineering fields. Cases in which the developed algorithm is applied to the optimal design of a building or the optimal design results presented by expanding the algorithm in various directions are very insufficient. Therefore, in this paper, we proposed four methods of adopting qubits to perform pitch adjusting in the optimization process of the QbHS (quantum-based harmony search) algorithm and applied it to TTO (truss topology optimization) using four methods to compare the results. The four methods of adopting qubits have the same or decreased number of qubits adopted as the number of iterations changes. As a result of applying TTO using four methods, convergence performance differed depending on the adoption method, and convergence performance was superior to conventional HS (harmony search) algorithms in all methods. The optimal design of structural engineering using such QC is expected to contribute to the revitalization of future technologies in the architectural field and the field of computer information systems.
It is widely accepted that quantum computation and the science of quantum computation mechanics are excellent tools for drug design and discovery because of their high precision in estimating numerous relevant parameters. A scientist can use quantum computing to perform hundreds of millions of comparisons of complex molecules at the same time to examine matches between the molecules, and both the positive and negative effects of a new therapeutic approach can be predicted. These approaches make the most significant contribution to the development of drugs in clinical use or clinical trials. These methods emerge and develop in tandem with the experimental approaches used in drug design. Quantum Computational (QC) methods offer a highly precise description of protein–ligand interactions. This method defines nuclei and electron behavior and explains molecular interactions in terms of distribution and motion. Quantum computers have the potential to revolutionize computation by solving previously intractable problems. Quantum computers are extremely fast and efficient. They can perform calculations that would take decades or even millennia on today's supercomputers in a matter of seconds. Experts refer to this fact as quantum superiority over other traditional methods. Second, QCs can also be archetypal complicated structures that will allow researchers to understand the interaction of both small molecules and biologics before the preclinical and clinical stages of drug development. In practice, quantum computational methods will not be able to take over every task performed by classical computational methods—at least not anytime soon. However, in the future, these methods may be combined with traditional computational technologies such as machine learning (ML) and artificial intelligence (AI) to pave a new and groundbreaking path toward the goal of drug discovery and development.
Quantum Computing is a prominent word in this era as it allows computation to be performed in no time. The motive of using Quantum Computing (QC) is that even exponentially large number of problems can be solved using it which was earlier difficult with the classical computing. Conventional methods are based on usage of bits which consist of 0's and 1's while QC works with qubits. The main issue is that conventional computing has issue of storage as well as computation even when parallel computation is performed on it. Concept of quantum parallelism allows the computation to be performed in exponentially very low time as compared to conventional method. This paper will discuss about Quantum Computing Algorithms and how Shor's algorithm is able to break RSA algorithms is discussed. Entanglement and superposition of qubits helps fast computation. The demonstration of the applicability has been evaluated based on Computation time, storage capacity, accuracy, confidentiality, efficiency, integrity, and availability. Among various algorithms Shor's technique is able to break various encryption algorithm with more supremacy as compared to conventional computing methods. In nutshell, paper will discuss about various QC algorithms and will illustrate how shor's algorithm is able to crack RSA.