Qantum computers could spur the development of breakthroughs in science, medications to save lives, machine learning methods to diagnose illnesses sooner, materials to make more efficient devices and structures, financial strategies to live well in retirement, and algorithms to quickly direct resources such as ambulances.

But what exactly is quantum computing, and what does it take to achieve these quantum breakthroughs? Today we will briefly discuss the quantum computer or quantum computing and the recent progress in this field. This blog will be mainly divided into two parts —

1. Basics of quantum computing
2. Recent progress and competition

1. Basics of Quantum Computing

Why Quantum Computing?

For problems above a specific size and complexity, we don’t have enough computational power on Earth to tackle them, i.e. using only standard classical computers, the solutions can not be achieved. Quantum computers are believed to solve specific computational problems, such as integer factorisation (which underlies RSA encryption), substantially faster than classical computers. Quantum machines promise to outstrip even the most capable of today’s — and tomorrow’s — supercomputers.

The secret of Quantum Computer:

By the last paragraph, you can assume that it’s neither like natural computers nor supercomputers. We have something special in it. So, what is it? It is quantum bits or qubits, which are typically subatomic particles such as electrons or photons. Some companies, such as IBM, Google, and Rigetti Computing, use superconducting circuits cooled to temperatures colder than deep space. Others, like IonQ, trap individual atoms in electromagnetic fields on a silicon chip in ultra-high-vacuum chambers. In both cases, the goal is to isolate the qubits in a controlled quantum state.

Qubits have some quirky quantum properties that mean a connected group can provide way more processing power than the same number of binary bits. Such two properties are —

1) Superposition: Qubits can represent numerous possible combinations of 1 and 0 at the same time [Fig-1.1]. This ability to simultaneously be in multiple states is called superposition.

2) Entanglement: Researchers can generate pairs of qubits that are “entangled,” which means the two members of a pair exist in a single quantum state [Fig-1.2]. Changing the state of one of the qubits will instantaneously change the state of the other one in a predictable way. This happens even if they are separated by very long distances.

Superposition [Figure 1.1], Entanglement [Figure 1.2] and Decoherence [Figure 1.3]

Superposition [Figure 1.1], Entanglement [Figure 1.2] and Decoherence [Figure 1.3]

You can learn more about quantum computing algorithms from another Medium article by YK Sugi

A Disadvantage of Quantum Computing:

The disadvantage is that quantum machines are way more error-prone than classical computers because of decoherence. The interaction of qubits with their environment in ways that cause their quantum behaviour to decay and ultimately disappear is called decoherence [Figure 1.3].

What is quantum supremacy?

Quantum supremacy is the point at which a quantum computer can complete a mathematical calculation that is demonstrably beyond the reach of even the most powerful supercomputer. In 2012, John Perskill proposed this terminology. It’s still unclear exactly how many qubits will be needed to achieve this because researchers keep finding new algorithms to boost classical machines’ performance, and supercomputing hardware keeps getting better. But one alternative is “quantum advantage,” which is also now widely used. But to me, “advantage” lacks the punch of “supremacy.” In a race, a horse has an advantage if it wins by a nose. In contrast, a quantum computer’s speed vastly exceeds that of classical computers for specific tasks. At least, that’s true in principle.

Hence, there’s plenty of debate in the research world about just how significant achieving this milestone will be. Rather than wait for supremacy to be declared, companies are already starting to experiment with quantum computers made by companies like IBM, Rigetti, and D-Wave, a Canadian firm. Chinese firms like Alibaba are also offering access to quantum machines.

However, if we achieve quantum supremacy, we can do a lot of things. You will be surprised by how many things, which seem to be impossible at this moment, can be done using the quantum computer. Please take a look at the video by multi-award-winning quantum physicist and Professor of Physics and Computer Science at Wilfrid Laurier University, Shohini Ghose

What can we do using a quantum computer?

Quantum Computer Developments:

Quantum computing models: Several quantum computing models are distinguished by the essential elements in which the computation is decomposed. The four main models of practical importance are-
[1] Quantum gate array
[2] One-way quantum computer
[3] Adiabatic quantum computer
[4] Topological quantum computer

Physical realisations: For physically implementing a quantum computer, many different candidates are being pursued —
[1] Superconducting quantum computing
[2] Trapped ion quantum computer
[3] Neutral atoms in Optical lattices
[4] Quantum dot computer, spin-based
[5] Quantum dot computer, spatial-based etc.

However, you can find a detailed explanation in a nutshell of what is a quantum computer in the following video —

Quantum Computer Explained in a nutshell

If you want to program a quantum computer, you should consider the Medium article by Dr James Wootton

2. Recent progress and competition

Quantum Pioneers:

There are many companies like IBM, Alibaba, Intel, Google, Microsoft, D-Wave Systems, IonQ, Honeywell, etc. Many of these firms work in conjunction with significant university research teams, continuing to accrue significant progress. Each one is trying to claim the title of having the most efficient quantum computer. However, I am briefly describing their success and competition among themselves —

IBM: It has launched a website named IBM Q Experience that made a 5 qubit quantum computer publicly available over the Internet. This time, this has been joined by a second 5 qubit machine and a 16 qubit machine. Later in 2017, they announced 20 qubit quantum computer and 50 qubit quantum computer one after another. However, in January 2019, IBM announced its IBM Q System One as the “world’s first integrated universal approximate quantum computing system designed for scientific and commercial use.

Google: In March 2018, Google announced a new 72 qubit quantum processor called ‘Bristlecone’. In June 2019, the director of Google’s Quantum Artificial Intelligence Lab, Hartmut Neven, revealed that its quantum processors’ power is now increasingly at a doubly exponential rate. This has been termed “Nevan’s Law” and suggests that we may reach the point of quantum supremacy — where a quantum computer can outperform any classical computer — by the end of 2019. In October 2019, an engineering team from Google published a paper in Nature in which they claimed to have achieved quantum supremacy using a quantum processor called Sycamore.

Alibaba: In July 2015, Alibaba teamed up with the Chinese Academy of Sciences to form the ‘CAS — Alibaba Quantum Computing Laboratory’. In March 2018, it launched its ‘superconducting quantum computing cloud’ to provide access to an 11 qubit quantum computer.

Microsoft: In November 2017, Intel announced the delivery of a 17 qubit test chip to QuTech. In January 2018, at CES, it further announced the delivery of a 49 qubit test quantum processor called ‘Tangle Lake’. In June 2018, Intel reported that it had begun testing a 26 spin qubit chip. According to Intel’s quantum computing web pages, the company targets production-level quantum computing within ten years. It anticipates that the technology will start to enter its “commercial phase” around 2025.

D-Wave Systems: In 2011, it sold a 10 million dollar, 128 qubit machine called the D-Wave One to Lockheed Martin. In 2013, D-Wave next sold a 512 Qubit D-Wave Two to NASA and Google. By 2015, D-Wave even broke the 1,000 qubit barrier with its D-Wave 2X, and in January 2017 sold its first 2,000 qubits D-Wave 2000Q to cybersecurity firm Temporal Defense Systems. However, notwithstanding all of the milestones mentioned above, D-Wave’s work remains controversial. This is because their hardware is based on an ‘adiabatic’ process called ‘quantum annealing’ that other pioneers have dismissed as ‘restrictive’ and ‘a dead-end’.

However, D-Wave 2000Q has a massive impact on the field of quantum computing, and you can get an idea of how it looks like and how it works by the following video —

D-Wave 2000Q

IonQ: IonQ is a pure-play pioneer in trapped-ion quantum computing. The company claims that its technology ‘combines unmatched physical performance, perfect qubit replication, optical networkability, and highly-optimized algorithms’ to ‘create a quantum computer that is as scalable as it is powerful and that will support a broad array of applications across a variety of industries’.

Honeywell: Honeywell is another pioneer of trapped-ion quantum computing. In June 2020, Honeywell announced that it had created the world’s highest performance quantum computer.

Top Two Rivalries in Quantum Field [Claimed]:

The trade war rivalry between the USA and China is well known. However, since the past few years, both nations are caught up in a heated tech race towards supremacy —

Google (2019) — USA:

On 23rd October 2019, Google said that they had achieved quantum supremacy, a long-awaited milestone in quantum computing. They reported using a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension ²⁵³ (about 1⁰¹⁶). They named the processor Sycamore. They claimed that the Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times. The equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years.

They designed the processor Sycamore which consists of a two-dimensional array of 54 transmon qubits, where each qubit is tunably coupled to four nearest neighbours in a rectangular lattice [Figure 1.4]. However, IBM published a blog where they stated that the computations in Google’s experiment could be undertaken on a classical computer in two-and-half days, rather than 10,000 years. And also, they added, “Because the original meaning of the term ‘quantum supremacy,’ as proposed by John Preskill in 2012, was to describe the point where quantum computers can do things that classical computers can’t, this threshold has not been met.”

The layout of Sycamore [Figure 1.4] and Original photograph of Sycamore [Figure 1.5]

The layout of Sycamore [Figure 1.4] and Original photograph of Sycamore [Figure 1.5]

USTC (2020) — China:

Researchers in China reported photonic quantum computer, which harnesses particles of light, or photons, performed a calculation that’s impossible for a conventional computer on 3rd December 2020. Boson sampling is considered a strong candidate to demonstrate the quantum computational advantage. They performed Gaussian boson sampling by sending 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer with full connectivity and random matrix — the whole optical setup is phase-locked — and sampling the output using 100 high-efficiency single-photon detectors. They named the photonic quantum computer Jiuzhang. It generates up to 76 output photon clicks, which yields an output state-space dimension of 1⁰³⁰ and a sampling rate that is faster than using the state-of-the-art simulation strategy and supercomputers by a factor of ~1⁰¹⁴. They claimed it is capable of performing at least one task 100 trillion times faster than the world’s fastest supercomputers.

Photons are first sent into a network of channels. There, each photon encounters a series of beam splitters, each of which sends the photon down two paths simultaneously, in what’s called a quantum superposition. According to quantum rules, paths also merge, and the repeated splitting and merging cause the photons to interfere with one another. Finally, the number of photons in each of the network’s output channels is measured at the end [Figure 1.7]. When repeated many times, this process produces a distribution of numbers based on how many photons were found in each output.

An illustration of the experimental setup for generating squeezed states in Jiuzhang [Figure 1.6] a Schematic diagram of the active phase-locking system in Jiuzhang [Figure 1.7] an Original photograph of Jiuzhang [Figure 1.8]

An illustration of the experimental setup for generating squeezed states in Jiuzhang [Figure 1.6], a Schematic diagram of the active phase-locking system in Jiuzhang [Figure 1.7] and an Original photograph of Jiuzhang [Figure 1.8]

The most important thing is that they claimed, Jiuzhang is 10 billion times faster than Google’s. However, one limitation of Jiuzhang is that it can perform only a single type of task, namely, boson sampling. In contrast, Google’s quantum computer could be programmed to execute a variety of algorithms.

⁕ ⁕ ⁕


It is pretty challenging to achieve quantum supremacy so fast. But many companies are trying hard to get an efficient quantum computer to achieve quantum supremacy. It will be beneficial then as it will have significantly lower time complexity for quantum algorithms. Till now, no proof of achieving supremacy is known. Like IBM, Google etc., provides you with free usage of quantum computing. You can try to make a better algorithm to take one step towards Quantum Computing.

Also, If you want to do a completely free course on quantum computing, you can check here —


What is quantum computing (
Quantum supremacy
Quantum computing models
what is quantum computing (IBM)
Quantum computing (
Supremacy claimed by Google
Jiuzhang supremacy
China’s claim (

D-Wave 2000Q

⁕ ⁕ ⁕

Thank you for reading.

I hope you found this “Quantum Computing: A Trade War” article helpful. Please share if you like and leave any comment to let me know your thoughts.

You can connect with me on LinkedIn, Instagram, Twitter or GitHub.