A Review on the Impact of Quantum Computing on Blockchain Technology

Abstract: Blockchain is a promising revolutionary technology and is scalable for countless applications. The use of mathematically complex algorithms and hashes secure a blockchain from the risk of potential attacks and forgery. Advanced quantum computing algorithms like Shor’s and Grover’s are at the heart of breaking many known asymmetric cyphers and pose a severe threat to blockchain systems. Although a fully functional quantum computer capable of performing these attacks might not be developed until the next decade or century, we need to rethink designing the blockchain resistant to these threats. This paper discusses the potential impacts of quantum computing on blockchain technology and suggests remedies for making blockchain technology more secure and resistant to such technological advances. Keywords: Quantum Computing, Blockchain, Shor’s Algorithm, Grover’s Algorithm, Cryptography

Download Full-text

Quantum Computing II

Quantum Mechanics for Beginners ◽

10.1093/oso/9780198854227.003.0016 ◽

2020 ◽

pp. 245-262

Author(s):

M. Suhail Zubairy

Keyword(s):

Fourier Transform ◽

Quantum Computing ◽

Quantum Entanglement ◽

Arbitrary Number ◽

Quantum Fourier Transform ◽

Grover’S Algorithm ◽

Computing Algorithm ◽

Shor's Algorithm ◽

Grover's Algorithm

This chapter deals with some of the most prominent successes of quantum computing. The most well-known quantum computing algorithm, Shor’s algorithm for factoring a number in its prime factors, is discussed in details. The key to Shor’s algorithm is the quantum Fourier transform that is explained with the help of simple examples. The role of quantum entanglement is also discussed. The next important quantum computing algorithm is Grover’s algorithm that helps in searching an item in an unsorted database. This algorithm is motivated by first discussing a quantum shell game in which a pea hidden under one of the four shells is found in one measurement with certainty each time. This amazing result is then generalized to an arbitrary number of objects and Grover’s algorithm.

Download Full-text

Introduction to Quantum Computing

Cryptographic Primitives in Blockchain Technology ◽

10.1093/oso/9780198862840.003.0008 ◽

2020 ◽

pp. 259-264

Author(s):

Andreas Bolfing

Keyword(s):

Quantum Computing ◽

Quantum Theory ◽

Large Scale ◽

Quantum Computer ◽

Quantum Algorithms ◽

Public Key ◽

Public Key Cryptosystems ◽

Shor's Algorithm ◽

Mathematical Problems ◽

The Impact

This chapter gives a brief introduction to quantum computing, which is the discipline of studying algorithms based on the principles of quantum theory. It outlines the two fundamental quantum algorithms, which are known as Grover’s and Shor’s algorithm, which are able to solve number-theoretical problems that are intractable for present conventional computers. Thus, this chapter also shows the impact of these quantum algorithms on present cryptography under the assumption of the existence of a large-scale quantum computer, concluding that quantum computing poses a serious threat to public-key cryptosystems, because their underlying mathematical problems can be solved efficiently by using Shor’s algorithm.

Download Full-text

The Evaluation of Software Security through Quantum Computing Techniques: A Durability Perspective

Applied Sciences ◽

10.3390/app112411784 ◽

2021 ◽

Vol 11 (24) ◽

pp. 11784

Author(s):

Hashem Alyami ◽

Mohd Nadeem ◽

Abdullah Alharbi ◽

Wael Alosaimi ◽

Md Tarique Jamal Ansari ◽

...

Keyword(s):

Quantum Computing ◽

Weather Forecasting ◽

Quantum Computer ◽

Software Security ◽

Future Research ◽

Hybrid Technique ◽

Analytic Hierarchy ◽

Second Stage ◽

The Impact ◽

Hierarchy Process

The primary goal of this research study, in the field of information technology (IT), is to improve the security and durability of software. A quantum computing-based security algorithm springs quite a lot of symmetrical approaches and procedures to ensure optimum software retreat. The accurate assessment of software’s durability and security is a dynamic aspect in assessing, administrating, and controlling security for strengthening the features of security. This paper essentially emphasises the demarcation and depiction of quantum computing from a software security perspective. At present, different symmetrical-based cryptography approaches or algorithms are being used to protect different government and non-government sectors, such as banks, healthcare sectors, defense, transport, automobiles, navigators, weather forecasting, etc., to ensure software durability and security. However, many crypto schemes are likely to collapse when a large qubit-based quantum computer is developed. In such a scenario, it is necessary to pay attention to the security alternatives based on quantum computing. Presently, the different factors of software durability are usability, dependability, trustworthiness, and human trust. In this study, we have also classified the durability level in the second stage. The intention of the evaluation of the impact on security over quantum duration is to estimate and assess the security durability of software. In this research investigation, we have followed the symmetrical hybrid technique of fuzzy analytic hierarchy process (FAHP) and fuzzy technique for order of preference by similarity to ideal solution (FTOPSIS). The obtained results, and the method used in this estimation, would make a significant contribution to future research for organising software security and durability (SSD) in the presence of a quantum computer.

Download Full-text

Digital Anti-Corruption Tools and Their Implementation in Various Legal Systems Around the World

SHS Web of Conferences ◽

10.1051/shsconf/202110003005 ◽

2021 ◽

Vol 100 ◽

pp. 03005

Author(s):

Andrii Halai ◽

Viktoriia Halai ◽

Roksolana Hrechaniuk ◽

Kateryna Datsko

Keyword(s):

Information Technology ◽

Information Technologies ◽

Legal Systems ◽

Blockchain Technology ◽

Technological Advances ◽

The World ◽

International Donor ◽

Virtual And Augmented Reality ◽

Relationship Of ◽

The Impact

Just as there is no ideal society, there is no society without corruption. Fighting corruption is one way to achieve the UN-approved goals of sustainable development. The article summarizes the process of formation and implementation of international anti-corruption standards and their features in different national legal systems. It is determined that the adoption and recognition of standards does not in itself solve the problem, which is why the world is constantly looking for ways to combat corruption, testing new tools and mechanisms to influence corruption risks. This is confirmed by numerous projects funded by international donor organizations. Information technologies create endless opportunities not only for economics development (robotics, blockchain technology, neural networks, artificial intelligence, quantum virtual and augmented reality), but also for the fight against corruption: from e-government and courts, digital public services and tools that report about the facts of corruption, to the means of influencing society through social networks. The article analyzes scientific and professional research in the field of digitalization of anti-corruption activities and substantiates the relationship of these concepts from the standpoint of the impact of IT technologies on combating and preventing corruption. The article summarizes modern technological advances and their implementation in various national legal systems, defines the role of information technology in the fight against corruption and forms an understanding of information technology as a tool to control and combat corruption.

Download Full-text

Generalization of Grover’s algorithm to multiobject search in quantum computing, Part I: continuous time and dis- crete time

Mathematics of Quantum Computation ◽

10.1201/9781420035377-7 ◽

2002 ◽

pp. 151-176

Keyword(s):

Quantum Computing ◽

Continuous Time ◽

Grover’S Algorithm ◽

Grover's Algorithm

Download Full-text

Quantum Fourier transform to estimate drive cycles

Scientific Reports ◽

10.1038/s41598-021-04639-0 ◽

2022 ◽

Vol 12 (1) ◽

Author(s):

Vinayak Dixit ◽

Sisi Jian

Keyword(s):

Fourier Transform ◽

Quantum Computing ◽

Quantum Computer ◽

Quantum Fourier Transform ◽

Real World Data ◽

Drive Cycle ◽

Cycle Frequency ◽

Data Set ◽

Simple Method ◽

The Impact

AbstractDrive cycles in vehicle systems are important determinants for energy consumption, emissions, and safety. Estimating the frequency of the drive cycle quickly is important for control applications related to fuel efficiency, emission reduction and improving safety. Quantum computing has established the computational efficiency that can be gained. A drive cycle frequency estimation algorithm based on the quantum Fourier transform is exponentially faster than the classical Fourier transform. The algorithm is applied on real world data set. We evaluate the method using a quantum computing simulator, demonstrating remarkable consistency with the results from the classical Fourier transform. Current quantum computers are noisy, a simple method is proposed to mitigate the impact of the noise. The method is evaluated on a 15 qubit IBM-q quantum computer. The proposed method for a noisy quantum computer is still faster than the classical Fourier transform.

Download Full-text

Implementation of Shor’s Quantum Factoring Algorithm using ProjectQ Framework

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.f1009.0986s319 ◽

2019 ◽

Vol 8 (6S3) ◽

pp. 52-56

Keyword(s):

Quantum Computing ◽

Computer Science ◽

Polynomial Time ◽

Quantum Computer ◽

Quantum Algorithm ◽

Prime Factorization ◽

Shor's Algorithm ◽

Computer Simulators ◽

Testing And Evaluation ◽

Factoring Algorithm

Prime number factorization is a problem in computer science where the solution to that problem takes super-polynomial time classically. Shor’s quantum factoring algorithm is able to solve the problem in polynomial time by harnessing the power of quantum computing. The implementation of the quantum algorithm itself is not detailed by Shor in his paper. In this paper, an approach and experiment to implement Shor’s quantum factoring algorithm are proposed. The implementation is done using Python and a quantum computer simulator from ProjectQ. The testing and evaluation are completed in two computers with different hardware specifications. User time of the implementation is measured in comparison with other quantum computer simulators: ProjectQ and Quantum Computing Playground. This comparison was done to show the performance of Shor’s algorithm when simulated using different hardware. There is a 33% improvement in the execution time (user time) between the two computers with the accuracy of prime factorization in this implementation is inversely proportional to the number of qubits used. Further improvements upon the program that has been developed for this paper is its accuracy in terms of finding the factors of a number and the number of qubits used, as previously mentioned.

Download Full-text

Quantum Fourier Transform to Estimate Drive Cycles

10.21203/rs.3.rs-772223/v1 ◽

2021 ◽

Author(s):

Vinayak Dixit ◽

Sisi Jian

Keyword(s):

Fourier Transform ◽

Quantum Computing ◽

Quantum Computer ◽

Quantum Fourier Transform ◽

Real World Data ◽

Drive Cycle ◽

Cycle Frequency ◽

Data Set ◽

Simple Method ◽

The Impact

Abstract Drive cycles in vehicle systems are important determinants for energy consumption, emissions, and safety. Estimating the frequency of the drive cycle quickly is important for control applications related to fuel efficiency, emission reduction and improving safety. Quantum computing has established the computational efficiency that can be gained. A drive cycle frequency estimation algorithm based on the quantum Fourier transform is exponentially faster than the classical Fourier transform. The algorithm is applied on real world data set. We evaluate the method using a quantum computing simulator, demonstrating remarkable consistency with the results from the classical Fourier Transform. Current quantum computers are noisy, a simple method is proposed to mitigate the impact of the noise. The method is evaluated on a 15 qbit IBM-q quantum computer. The proposed method for a noisy quantum computer is still faster than the classical Fourier transform.

Download Full-text