## The biggest danger to Blockchain networks from quantum computing is its ability to break traditional encryption.

*Photo:Alexander Sinn/Unsplash*

Google sent shockwaves around the internet when it claimed, had built a quantum computer able to solve formerly impossible mathematical calculations–with some fearing crypto industry could be at risk. Google states that its experiment is the first experimental challenge against the extended Church-Turing thesis — also known as computability thesis — which claims that traditional computers can effectively carry out any “reasonable” model of computation.

**What is Quantum Computing?**

**Quantum computing** is the area of study focused on developing computer technology based on the principles of quantum theory. The quantum computer, following the laws of quantum physics, would gain enormous processing power through the ability to be in multiple states, and to perform tasks using all possible permutations simultaneously.

**A Comparison of Classical and Quantum Computing**

Classical computing relies, at its ultimate level, on principles expressed by Boolean algebra. Data must be processed in an exclusive binary state at any point in time or bits. While the time that each transistor or capacitor need be either in 0 or 1 before switching states is now measurable in billionths of a second, there is still a limit as to how quickly these devices can be made to switch state. 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. Beyond this, the quantum world takes over. In a quantum computer, a number of elemental particles such as electrons or photons can be used with either their charge or polarization acting as a representation of 0 and/or 1. Each of these particles is known as a quantum bit, or qubit, the nature and behavior of these particles form the basis of quantum computing.

**Quantum Superposition and Entanglement**

The two most relevant aspects of quantum physics are the principles of ** superposition** and

*entanglement.**Superposition**:* Think of a qubit as an electron in a magnetic field. The electron’s spin may be either in alignment with the field, which is known as a spin-up state, or opposite to the field, which is known as a spin-down state. According to quantum law, the particle enters a superposition of states, in which it behaves as if it were in both states simultaneously. Each qubit utilized could take a superposition of both 0 and 1.

** Entanglement:** Particles that have interacted at some point retain a type of connection and can be entangled with each other in pairs, in a process known as correlation. Knowing the spin state of one entangled particle – up or down – allows one to know that the spin of its mate is in the opposite direction. Quantum entanglement allows qubits that are separated by incredible distances to interact with each other instantaneously (not limited to the speed of light). No matter how great the distance between the correlated particles, they will remain entangled as long as they are isolated. Taken together, quantum superposition and entanglement create an enormously enhanced computing power. Where a 2-bit register in an ordinary computer can store only one of four binary configurations (00, 01, 10, or 11) at any given time, a 2-qubit register in a quantum computer can store all four numbers simultaneously, because each qubit represents two values. If more qubits are added, the increased capacity is expanded exponentially.

**Difficulties with Quantum Computers**

**Interference**: During the computation phase of a quantum calculation, the slightest disturbance in a quantum system (say a stray photon or wave of EM radiation) causes the quantum computation to collapse, a process known as de-coherence. A quantum computer must be totally isolated from all external interference during the computation phase.**Error correction**– Given the nature of quantum computing, error correction is ultra-critical – even a single error in a calculation can cause the validity of the entire computation to collapse.**Output observance**– Closely related to the above two, retrieving output data after a quantum calculation is complete risks corrupting the data.

**What is Quantum Supremacy**?

According to the Financial Times, Google claims to have successfully built the world’s most powerful quantum computer.

**Photo:Mitchell Luo/Unsplash**

What that means, according to Google’s researchers, is that calculations that normally take more than 10,000 years to perform, its computer was able to do in about 200 seconds, and potentially mean Blockchain, and the encryption that underpins it could be broken.

*Asymmetric cryptography* used in crypto relies on keypairs, namely a private and public key. Public keys can be calculated from their private counterpart, but not the other way around. This is due to the impossibility of certain mathematical problems. Quantum computers are more efficient in accomplishing this by magnitudes, and if the calculation is done the other way then the whole scheme breaks.

It would appear Google is still some way away from building a quantum computer that could be a threat to Blockchain cryptography or other encryption.

“Google’s supercomputer currently has 53 qubits,” said Dragos Ilie, a quantum computing and encryption researcher at Imperial College London.

“In order to have any effect on bitcoin or most other financial systems it would take at least about 1500 qubits and the system must allow for the entanglement of all of them,” Ilie said.

Meanwhile, scaling quantum computers is “a huge challenge,” according to Ilie.

Blockchain networks, including Bitcoin’s architecture, rely on two algorithms: **Elliptic Curve Digital Signature Algorithm (ECDSA)** for digital signatures and SHA-256 as a hash function. A quantum computer could use Shor’s algorithm to get your private from your public key, but the most optimistic scientific estimates say that even if this were possible, it won’t happen during this decade.

“A 160-bit elliptic curve cryptographic key could be broken on a quantum computer using around 1000 qubits while factoring the security-wise equivalent 1024-bit RSA modulus would require about 1500 to 2000 qubits.”

By comparison, **Google’s** measly 53 qubits are still no match for this kind of cryptography. According to research paper on the matter published by Cornell University.