What is quantum computing? Regular computers operate according to strict rules of logic. But tiny quantum objects – such as electrons, or photons of light – can break those rules.
Quantum computing is the idea that we can use this quantum rule-breaking to process information in a new way—one that’s totally different from how regular computers work. This makes them, in some cases, exponentially faster than any regular computer.
For example, one quantum computer could easily crack the codes that keep internet banking secure.
So, like a supercomputer?
Not exactly. A quantum computer is not just a “faster” computer. There are a few specific tasks – such as factoring very large numbers – which a quantum computer would be amazing at. (This is where the codebreaking comes in – see below.) But for most jobs, a quantum computer would be little better than a regular computer.
So what could a quantum computer be used for?
They will probably be most useful for government agencies, research and development companies and universities in solving problems that current computers struggle with.
The first practical idea, proposed by the physicist Richard Feynman in 1981, was to use a quantum computer to simulate quantum mechanics. This would impact chemistry and biology. Chemists, for example, could accurately model drug interactions and biologists could study all the possible ways proteins can fold and interact with one another.
While quantum computers were once an academic curiosity, interest exploded in 1994 when the American mathematician Peter Shor found a way to use quantum computers to break codes.
Currently, many online security systems run on the principle that it’s next to impossible to take a very large number and figure out what its prime factors are. All a regular computer can do is try every possibility one after another – a task that could take billions of years. Using Shor’s algorithm, a quantum computer could perform the task in a few hours.
Quantum computers could also be fantastic at recognising patterns in data – useful for machine learning problems, such as being able to identify different objects in an image. They could be great at building models to predict the future, such as in long-term weather forecasting.
But ultimately, the uses of quantum computing are unpredictable. Consider that in 1943, Thomas Watson, the president of IBM said, “I think there is a world market for maybe five computers.” Now there are five in every household.
If precedent is any guide, we’ve yet to imagine what the uses of quantum computers will be.
How does quantum computing work?
Regular computers are based on “bits” – imagine them as little switches pointing to either a 1 or a 0.
Quantum computing relies on quantum bits, or “qubits”, which can also represent a 0 or a 1. The crazy thing is, qubits can also achieve a mixed state, called a “superposition” where they are both 1 and 0 at the same time. This ambiguity – the ability to both “be” and “not be” – is key to the power of quantum computing.
How does superposition help?
The difference between regular computers and quantum computers boils down to how they approach a problem.
A regular computer tries to solve a problem the same way you might try to escape a maze – by trying every possible corridor, turning back at dead ends, until you eventually find the way out. But superposition allows the quantum computer to try all the paths at once – in essence, finding the shortcut.
Two bits in your computer can be in four possible states (00, 01, 10, or 11), but only one of them at any time. This limits the computer to processing one input at a time (like trying one corridor in the maze).
In a quantum computer, two qubits can also represent the exact same four states (00, 01, 10, or 11). The difference is, because of superposition, the qubits can represent all four at the same time. That’s a bit like having four regular computers running side-by-side.
If you add more bits to a regular computer, it can still only deal with one state at a time. But as you add qubits, the power of your quantum computer grows exponentially. For the mathematically inclined, we can say that if you have “n” qubits, you can simultaneously represent 2n states.)
It’s like that old fable about an ancient Indian, called Sessa, who invented the game of chess. The king was delighted with the game and asked Sessa to name his reward. Sessa humbly requested a single chessboard with one grain of wheat on the first square, two on the second, four on the third and so on. The king agreed at once, not realising he’d promised away more wheat than existed on Earth. That’s the power of exponential growth.
Just like each square doubled Sessa’s wheat, each additional qubit doubles the processing power. Three qubits gives you 23, which is eight states at the same time; four qubits give you 24, which is 16. And 64 qubits? They give you 264, which is 18,446,744,073,709,600,000 possibilities! That’s about one million terabytes worth.
While 64 regular bits can also represent this huge number (264) of states, it can only represent one one at a time. To cycle through all these combinations, at two billion per second (which is a typical speed for a modern PC), would take about 400 years.
All this means quantum computers could tackle problems which are “practically impossible” for classical computers.
But to get that exponential speed-up, the fate of all the qubits has to be linked together in a process called quantum entanglement. This weird phenomenon, which Einstein called “spooky action at a distance”, can connect quantum particles even if they are at opposite ends of the universe.
What makes a qubit?
To make a qubit, you need an object that can attain a state of quantum superposition between two states.
An atomic nucleus is one kind of qubit. The direction of its magnetic moment (it’s “spin”) can point in different directions, say up or down with respect to a magnetic field.
The challenge is in placing and then addressing that single atom.
An Australian team led by Michelle Simmons at the University of New South Wales, has made atomic qubits by placing a single phosphorus atom at a known position inside a silicon crystal.
Another idea is to strip an electron off the atom and turn it into an ion. Then you can use electromagnetic fields to suspend the ion in free space, firing lasers at it to change its state. This makes for a “trapped ion” quantum computer.
A current in a loop of superconducting metal can also be in a superposition (between clockwise and anticlockwise), a bit like a little treadmill running forwards and backwards at the same time.
A photon of light can be in superposition in the direction it’s waving. Some groups have been assembling quantum circuits by sending photons around a maze of optical fibres and mirrors.
How do you create the superposition?
Have you ever tried to balance a coin exactly on its edge? That’s what programming a qubit is like. It involves doing something to a qubit so that, in a sense, it ends up “balanced” between states.
In the case of the atomic nucleus, this might be through zapping it with an electric or magnetic field, leaving is with an equal probability of spinning one way or the other.
So how do you read information from the qubits?
There’s an aura of the mystical about what goes on during a quantum computation. The more way-out physicists describe the qubits as engaging in a sort-of quantum séance with parallel worlds to divine the answer.
But it’s not magic, it’s just quantum mechanics.
Say you’ve got your new 64-qubit quantum computer up and running for its first computation. You place all 64 qubits in superposition, just like 64 coins all balanced on edge. Together, they hold 264 possible states in limbo. You know one of these states represents the right answer. But which one?
The problem is, reading the qubits causes the superposition to collapse – like banging your fist on the table with all those balanced coins.
Here’s where a quantum algorithm like Shor’s comes in handy. It loads the qubits to make them more likely to fall on the correct side, and give us the right answer.
Have any quantum computers been built yet?
Apparently yes, although none of them can do anything surpassing conventional computers just yet.
The last three years has seen dramatic progress in quantum computing. While in 2016 Nature magazine was celebrating a nine qubit computer developed by Google researchers. Eighteen months later, in December 2017, IBM reported their 50 qubit quantum computer. Within four months, Google had streaked ahead again, with their 72-qubit ‘Bristlecone‘ quantum computer. Meanwhile IBM have produced the first commercially available quantum computer–providing cloud access to their 20 qubit Q System One machine, for a price.
D-Wave is still way ahead with its of creating using 2000 superconducting loops as qubits, although some physicists are sceptical that D-Wave has built a true quantum computer.
All of the big players have the next major milestone in their sights: ‘quantum supremacy’. This means when a quantum computer solves a problem beyond the capabilities of classical machines. Theoretically this should be possible with a 50-qubit machine, but only if the error rates are low enough.
Why is it so difficult to build a quantum computer?
There are challenges at every level, from assembling qubits, to reading and writing information on them, to shuttling information back and forth without it disappearing in a puff of uncertainty.
A qubit is the ultimate diva. While a Hollywood starlet might demand a gigantic dressing room and a bath full of rose petals, a qubit demands perfect isolation and a thermostat set at one hundredth of a degree above absolute zero. The slightest vibration from a nearby atom can cause a qubit to throw a quantum tantrum, and lose its superposition.
The overriding difficulty is how to maintain the delicate states of superposition and entanglement long enough to run a calculation – the so-called coherence time.
Despite this daunting challenge, the race to build the first practical quantum computer has become one of the grand scientific challenges of our time – involving thousands of physicists and engineers at dozens of research institutes scattered around the globe.
Related reading: How quantum mechanics can change computing
Originally published by Cosmos as Quantum computing for the qubit curious
Cathal O'Connell is a science writer based in Melbourne.
Read science facts, not fiction...
There’s never been a more important time to explain the facts, cherish evidence-based knowledge and to showcase the latest scientific, technological and engineering breakthroughs. Cosmos is published by The Royal Institution of Australia, a charity dedicated to connecting people with the world of science. Financial contributions, however big or small, help us provide access to trusted science information at a time when the world needs it most. Please support us by making a donation or purchasing a subscription today.