The Case Against ‘The Case Against Quantum Computing’

By Ben Criger

January 9, 2019

Editor’s note: In this contributed piece, Ben Criger, a post-doctoral researcher at QuTech, part of the TU Delft in the Netherlands, responds to criticisms of quantum computing and offers an explanation for why such criticisms tend to garner a lot of attention.

It’s not easy to be a physicist. Richard Feynman (basically the Jimi Hendrix of physicists) once said: “The first principle is that you must not fool yourself – and you are the easiest person to fool.” This maxim motivates us to be critical of our research, even if we’re more critical when it comes to the research of others. From time to time, we even look through journals and technical magazines for arguments against the things we’re trying to do.

Last month, while I was looking for some nice criticism of quantum computing, I had the opportunity to read an article called “The Case Against Quantum Computing,” written by Mikhail Dyakonov, in IEEE Spectrum. While I was reading, I noticed two things that seemed out of the ordinary. First, all of the physics-based criticism of quantum computing was wrong, or had been addressed twenty years ago when the field was starting. The second, and perhaps more important thing, is that I could see the appeal of the article, despite its technical deficiencies.

I noticed that this article had been reviewed on the 27th of November by John Russell, here in HPCwire, so I thought that this would also be a good forum for a rebuttal (many thanks to Tiffany Trader for giving me the opportunity to write one). In the following sections, I’m going to go over two of the main technical points that Dyakonov makes, and try to give people a better idea about where we’re at in quantum computing. I’ll conclude with a comment on the article’s appeal.

Precision in Computing

Dyakonov: “A useful quantum computer needs to process a set of continuous parameters that is larger than the number of subatomic particles in the observable universe.”

No computer, classical or quantum, ever has to process even a single continuous parameter. In classical computers, we can use floating-point arithmetic to approximate continuous parameters using a finite number of bits. Most of the time, we can even manage to do it to within the desired relative precision, in order to avoid catastrophic error propagation. This is because the number of numbers which we can express using a floating-point type scales exponentially with the number of bits.

Normally, I wouldn’t belabour this point so heavily, but I’m going to do the “quantum” version of this in a minute, so let’s take a look at an animation of floating-point representations in action:

Here, I’m writing out all numbers of the form (−1)base sign×significand× 10((−1)exp sign∗exponent), when the variables significand and exponent are each n-bit integers. Now, I can’t plot the whole real line (my monitor isn’t wide enough), so I’ve used a Riemann projection, drawing a ray from the center of the semi-circle shown above to the point on the real line that I’d like to show, and instead showing where that ray intersects the semi-circle, like so:

 

If we begin with 0 bits in the significand and exponent, we can assign any value we like to the sign bits, and the only number we can represent is 0. There are four independent ways, therefore, to represent 0, so there’s a little inefficiency in the representation. However, by the time I get up to 9 bits each in the significand and exponent, all of the points plotted are overlapping, and it’s clear that I have enough precision for the task at hand, for any real number I care to approximate.

A similar result holds in quantum computing, though the ‘data type’ we’ll consider here is a single qubit’s state, rather than a real number. The continuous complex parameters α and β mentioned by Professor Dyakonov go in a length two vector:

These parameters can also be mapped to angles θ and φ on the Bloch sphere, like so:

α = cos(θ/2)        β = esin(θ/2)

(exercise for the reader: show that the state |0>, with α = 1 and β = 0, sits at the North Pole).

The operations we can apply in quantum computing are unitary matrices, equivalent to rotations of the Bloch sphere. For a single qubit, these matrices have two rows and two columns. Now, in fault-tolerant quantum computing, the operations which we can implement with arbitrarily low (but not exactly zero) error rates are limited to a discrete set. Let’s suppose for the sake of example, that there are two, and that they’re called H and T. Furthermore, let’s suppose that we only know how to initialise a single fixed state of our fault-tolerant qubit, the |0> state. How many qubit states can we reach with a string of Hs and Ts of fixed length n? Again, just as in floating-point arithmetic, the number of sequences I can generate scales exponentially with respect to the length of the sequence, despite a few collisions at low n (for example, HH |0> = |0>):

This animation doesn’t look quite as nice as the last one. There’s a lot more space to cover on the sphere than there is on the semi-circle that we used for floating-point arithmetic. From this, we can conclude that quantum computing is harder than classical computing, though I suspect that this does not come as a surprise.

Now, this isn’t the only thing fundamentally wrong with quantum computing, according to Professor Dyakonov. According to him, the entire discussion above is irrelevant, since imprecision and error will inevitably ruin any large-scale quantum computation before we can even think about stringing our Hs and Ts together. This is probably also not a surprise, but this was one of the first big problems that was ever solved in quantum computing, and I’ll talk about it a bit in the following section.

The Threshold Theorem

Dyakonov: “Indeed, [scientists studying quantum computing] claim that something called the threshold theorem proves it can be done. They point out that once the error per qubit per quantum gate is below a certain value, indefinitely long quantum computation becomes possible, at a cost of substantially increasing the number of qubits needed. With those extra qubits, they argue, you can handle errors by forming logical qubits using multiple physical qubits.”

The threshold theorem, initally proven by Aharonov and Ben-Or, has been around for about twenty years. The proof itself is in a 63-page paper, but the basic qualitative argument is relatively easy to grasp in a few paragraphs. At the cost of oversimplifying things, I’ll try to summarise that argument here.

Let’s define a logical gate as a small quantum computation that uses a number of physical gates acting on encoded states to simulate the effect of a single physical quantum logic gate acting on an unencoded state. Some logical gates can be made fault-tolerant by adding quantum error correction subroutines. The function of these subroutines is to correct the failure of a small number (typically one) of the physical quantum logic gates included in either the logical gate, or the error correction subroutines themselves. Each of these gadgets (that’s the technical term) contains a certain number of physical gates, let’s call it G. Also, let’s assume that, if any pair of these gates does something unanticipated, that the whole thing fails. When, then, does such a circuit have a low error probability? Let’s suppose, for the sake of simplicity, that each physical gate fails with probability p. The probability of error for the fault-tolerant gadget is , and whenever that’s less than p, we’re in business.

Now,  may not be a low enough probability of error for a given computation. In that case, we take advantage of something called concatenation, which is where you replace every physical gate in a fault-tolerant logical gate with yet another fault-tolerant logical gate, as depicted below:

If we use l levels of this concatenation, the number of gates we need to execute scales exponentially in l, but (very importantly) the final probability of error is p2l [ed. note: p^2^l] so it’s doubly-exponentially suppressed.

If this sounds clunky and inefficient to you, you’d be more or less right. The important thing for this initial proof of concept was not that the scheme be particularly efficient, but that it use simple ideas which could be widely understood. Over the past twenty years, a small community of quantum computing researchers have been concerned with finding more efficient schemes, with fewer gates, and the ability to tolerate higher error rates, and the results have been fairly positive. They’ve also been hard at work proving that quantum computing can still be made fault-tolerant if the errors are correlated, rather than independent, as I’ve assumed above (though Aharonov and Ben-Or consider weak correlations in their original work).

During this time, people like Mikhail Dyakonov (and Gil Kalai, and other noted skeptics of quantum computing) have been career researchers. If the theorem were false, we’d expect one of these skeptics, or someone they’ve inspired, to have proven that it was false, or to show that physically-reasonable correlated noise precludes quantum computing. They have not done this. Instead, Dyakonov has loosely suggested that the theorem is false, without a direct statement, or evidence. I, for one, think that the theorem is more or less correct, and that quantum computing is possible.

These are the official fact-based rebuttals that we physicists rely on when confronted with critiques from Dyakonov and the other scientists and engineers who believe that quantum computing is doomed for some reason or another. They’ve been used before, and I suspect that they’ll be used again. In one sense, they’re perfectly sufficient, but I don’t think they’ve addressed the core problem. Dyakonov’s critiques are unfounded, and yet they endure. Why?

The Important Question

So, why was Dyakonov’s article written? Why was it published? I hope I’ve argued adequately that there’s not a lot of science behind it, so why is it so appealing?

I think this article was published because, in a sense we don’t often talk about, it’s correct. People who study quantum computing don’t view it as our responsibility to oppose the unjustified hype building up in the popular press. Times are tough for scientists in every field, as the budgets for those funding agencies Dyakonov mentions dwindle. There’s a temptation not to rock the boat, especially when the critics we do have don’t do a great job of challenging us on technical grounds.

We lament the lack of well-founded criticism, but how often, and how loudly, do we lament the abundance of unfounded optimism? Are these two things not equally dangerous to the progress of science? We’re the people best able to criticise quantum computing, is it then our responsibility to do so?

So far, we’ve left editors with little selection when they look for something to stem the tide of breathless proclamations about how quantum computing is going to solve everything. We often lament the lack of good critiques of quantum computing, but in the end, the only chance we have to elevate the level of criticism is to do it ourselves.

About the Author

Ben is a post-doctoral researcher at QuTech, part of the TU Delft in the Netherlands. His research is focused on near-term implementations of fault-tolerant quantum computing. He can be reached via Twitter (@BenCriger) and GitHub (github.com/bcriger). Scripts producing the animations in this article can be found at github.com/bcriger/examples/tree/master/articles/2019_01_HPCWire.

Subscribe to HPCwire's Weekly Update!

Be the most informed person in the room! Stay ahead of the tech trends with industy updates delivered to you every week!

Amid Upbeat Earnings, Intel to Cut 1% of Employees, Add as Many

January 24, 2020

For all the sniping two tech old timers take, both IBM and Intel announced surprisingly upbeat earnings this week. IBM CEO Ginny Rometty was all smiles at this week’s World Economic Forum in Davos, Switzerland, after  Read more…

By Doug Black

Indiana University Dedicates ‘Big Red 200’ Cray Shasta Supercomputer

January 24, 2020

After six months of celebrations, Indiana University (IU) officially marked its bicentennial on Monday – and it saved the best for last, inaugurating Big Red 200, a new AI-focused supercomputer that joins the ranks of Read more…

By Staff report

What’s New in HPC Research: Tsunamis, Wildfires, the Large Hadron Collider & More

January 24, 2020

In this bimonthly feature, HPCwire highlights newly published research in the high-performance computing community and related domains. From parallel programming to exascale to quantum computing, the details are here. Read more…

By Oliver Peckham

Toshiba Promises Quantum-Like Advantage on Standard Hardware

January 23, 2020

Toshiba has invented an algorithm that it says delivers a 10-fold improvement for a select class of computational problems, without the need for exotic hardware. In fact, the company's simulated bifurcation algorithm is Read more…

By Tiffany Trader

Energy Research Combines HPC, 3D Manufacturing

January 23, 2020

A federal energy research initiative is gaining momentum with the release of a contract award aimed at using supercomputing to harness 3D printing technology that would boost the performance of power generators. Partn Read more…

By George Leopold

AWS Solution Channel

Challenging the barriers to High Performance Computing in the Cloud

Cloud computing helps democratize High Performance Computing by placing powerful computational capabilities in the hands of more researchers, engineers, and organizations who may lack access to sufficient on-premises infrastructure. Read more…

IBM Accelerated Insights

Intelligent HPC – Keeping Hard Work at Bay(es)

Since the dawn of time, humans have looked for ways to make their lives easier. Over the centuries human ingenuity has given us inventions such as the wheel and simple machines – which help greatly with tasks that would otherwise be extremely laborious. Read more…

TACC Highlights Its Upcoming ‘IsoBank’ Isotope Database

January 22, 2020

Isotopes – elemental variations that contain different numbers of neutrons – can help researchers unearth the past of an object, especially the few hundred isotopes that are known to be stable over time. However, iso Read more…

By Oliver Peckham

Toshiba Promises Quantum-Like Advantage on Standard Hardware

January 23, 2020

Toshiba has invented an algorithm that it says delivers a 10-fold improvement for a select class of computational problems, without the need for exotic hardware Read more…

By Tiffany Trader

In Advanced Computing and HPC, Dell EMC Sets Sights on the Broader Market Middle 

January 22, 2020

If the leading advanced computing/HPC server vendors were in the batting lineup of a baseball team, Dell EMC would be going for lots of singles and doubles – Read more…

By Doug Black

DNA-Based Storage Nears Scalable Reality with New $25 Million Project

January 21, 2020

DNA-based storage, which involves storing binary code in the four nucleotides that constitute DNA, has been a moonshot for high-density data storage since the 1960s. Since the first successful experiments in the 1980s, researchers have made a series of major strides toward implementing DNA-based storage at scale, such as improving write times and storage density and enabling easier file identification and extraction. Now, a new $25 million... Read more…

By Oliver Peckham

AMD Recruits Intel, IBM Execs; Pending Layoffs Reported at Intel Data Platform Group

January 17, 2020

AMD has raided Intel and IBM for new senior managers, one of whom will replace an AMD executive who has played a prominent role during the company’s recharged Read more…

By Doug Black

Atos-AMD System to Quintuple Supercomputing Power at European Centre for Medium-Range Weather Forecasts

January 15, 2020

The United Kingdom-based European Centre for Medium-Range Weather Forecasts (ECMWF), a supercomputer-powered weather forecasting organization backed by most of Read more…

By Oliver Peckham

Julia Programming’s Dramatic Rise in HPC and Elsewhere

January 14, 2020

Back in 2012 a paper by four computer scientists including Alan Edelman of MIT introduced Julia, A Fast Dynamic Language for Technical Computing. At the time, t Read more…

By John Russell

White House AI Regulatory Guidelines: ‘Remove Impediments to Private-sector AI Innovation’

January 9, 2020

When it comes to new technology, it’s been said government initially stays uninvolved – then gets too involved. The White House’s guidelines for federal a Read more…

By Doug Black

IBM Touts Quantum Network Growth, Improving QC Quality, and Battery Research

January 8, 2020

IBM today announced its Q (quantum) Network community had grown to 100-plus – Delta Airlines and Los Alamos National Laboratory are among most recent addition Read more…

By John Russell

Using AI to Solve One of the Most Prevailing Problems in CFD

October 17, 2019

How can artificial intelligence (AI) and high-performance computing (HPC) solve mesh generation, one of the most commonly referenced problems in computational engineering? A new study has set out to answer this question and create an industry-first AI-mesh application... Read more…

By James Sharpe

Julia Programming’s Dramatic Rise in HPC and Elsewhere

January 14, 2020

Back in 2012 a paper by four computer scientists including Alan Edelman of MIT introduced Julia, A Fast Dynamic Language for Technical Computing. At the time, t Read more…

By John Russell

SC19: IBM Changes Its HPC-AI Game Plan

November 25, 2019

It’s probably fair to say IBM is known for big bets. Summit supercomputer – a big win. Red Hat acquisition – looking like a big win. OpenPOWER and Power processors – jury’s out? At SC19, long-time IBMer Dave Turek sketched out a different kind of bet for Big Blue – a small ball strategy, if you’ll forgive the baseball analogy... Read more…

By John Russell

Cray, Fujitsu Both Bringing Fujitsu A64FX-based Supercomputers to Market in 2020

November 12, 2019

The number of top-tier HPC systems makers has shrunk due to a steady march of M&A activity, but there is increased diversity and choice of processing compon Read more…

By Tiffany Trader

Crystal Ball Gazing: IBM’s Vision for the Future of Computing

October 14, 2019

Dario Gil, IBM’s relatively new director of research, painted a intriguing portrait of the future of computing along with a rough idea of how IBM thinks we’ Read more…

By John Russell

Intel Debuts New GPU – Ponte Vecchio – and Outlines Aspirations for oneAPI

November 17, 2019

Intel today revealed a few more details about its forthcoming Xe line of GPUs – the top SKU is named Ponte Vecchio and will be used in Aurora, the first plann Read more…

By John Russell

Dell Ramps Up HPC Testing of AMD Rome Processors

October 21, 2019

Dell Technologies is wading deeper into the AMD-based systems market with a growing evaluation program for the latest Epyc (Rome) microprocessors from AMD. In a Read more…

By John Russell

D-Wave’s Path to 5000 Qubits; Google’s Quantum Supremacy Claim

September 24, 2019

On the heels of IBM’s quantum news last week come two more quantum items. D-Wave Systems today announced the name of its forthcoming 5000-qubit system, Advantage (yes the name choice isn’t serendipity), at its user conference being held this week in Newport, RI. Read more…

By John Russell

Leading Solution Providers

SC 2019 Virtual Booth Video Tour

AMD
AMD
ASROCK RACK
ASROCK RACK
AWS
AWS
CEJN
CJEN
CRAY
CRAY
DDN
DDN
DELL EMC
DELL EMC
IBM
IBM
MELLANOX
MELLANOX
ONE STOP SYSTEMS
ONE STOP SYSTEMS
PANASAS
PANASAS
SIX NINES IT
SIX NINES IT
VERNE GLOBAL
VERNE GLOBAL
WEKAIO
WEKAIO

IBM Unveils Latest Achievements in AI Hardware

December 13, 2019

“The increased capabilities of contemporary AI models provide unprecedented recognition accuracy, but often at the expense of larger computational and energet Read more…

By Oliver Peckham

SC19: Welcome to Denver

November 17, 2019

A significant swath of the HPC community has come to Denver for SC19, which began today (Sunday) with a rich technical program. As is customary, the ribbon cutt Read more…

By Tiffany Trader

Jensen Huang’s SC19 – Fast Cars, a Strong Arm, and Aiming for the Cloud(s)

November 20, 2019

We’ve come to expect Nvidia CEO Jensen Huang’s annual SC keynote to contain stunning graphics and lively bravado (with plenty of examples) in support of GPU Read more…

By John Russell

Top500: US Maintains Performance Lead; Arm Tops Green500

November 18, 2019

The 54th Top500, revealed today at SC19, is a familiar list: the U.S. Summit (ORNL) and Sierra (LLNL) machines, offering 148.6 and 94.6 petaflops respectively, Read more…

By Tiffany Trader

51,000 Cloud GPUs Converge to Power Neutrino Discovery at the South Pole

November 22, 2019

At the dead center of the South Pole, thousands of sensors spanning a cubic kilometer are buried thousands of meters beneath the ice. The sensors are part of Ic Read more…

By Oliver Peckham

Azure Cloud First with AMD Epyc Rome Processors

November 6, 2019

At Ignite 2019 this week, Microsoft's Azure cloud team and AMD announced an expansion of their partnership that began in 2017 when Azure debuted Epyc-backed instances for storage workloads. The fourth-generation Azure D-series and E-series virtual machines previewed at the Rome launch in August are now generally available. Read more…

By Tiffany Trader

Intel’s New Hyderabad Design Center Targets Exascale Era Technologies

December 3, 2019

Intel's Raja Koduri was in India this week to help launch a new 300,000 square foot design and engineering center in Hyderabad, which will focus on advanced com Read more…

By Tiffany Trader

Summit Has Real-Time Analytics: Here’s How It Happened and What’s Next

October 3, 2019

Summit – the world’s fastest publicly-ranked supercomputer – now has real-time streaming analytics. At the 2019 HPC User Forum at Argonne National Laborat Read more…

By Oliver Peckham

  • arrow
  • Click Here for More Headlines
  • arrow
Do NOT follow this link or you will be banned from the site!
Share This