The Road to Quantum Computational Supremacy

Abstract

We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms. Quantum supremacy, if achieved, won't make classical computing obsolete.A hyper-fast quantum computer is the digital equivalent of a nuclear bomb; whoever possesses one will be able to shred any encryption and break any code in existence. 3 [44] 1 Fairy tales or more cautionary tales?Following the development of Shor's quantum algorithm [64] in 1994 and Grover's quantum algorithm [40] two years later, quantum computing was seen as a bright beacon in computer science, which led to a surge of theoretical and experimental results. The field captured the interest and imagination of the large public and media, and not surprisingly, unfounded claims about the power of quantum computing and its applications proliferated.A certain degree of pessimism began to infiltrate when experimental groups floundered while attempting to control more than a handful of qubits. Recently, a broad wave of ambitious industry-led research programmes in quantum computing-driven by D-Wave Systems, 4 the tech giants Google, IBM, Microsoft, Intel and startups like Rigetti Computing and Quantum Circuits Incorporated-has emerged 5 and bold claims about a future revolutionised by quantum computing are resurfacing.

Emulation of physical processes with Emukit

“…Quantum computers promise to revolutionize computer science [25]. The largest quantum computers built to date make use of superconducting qubit architectures.…”

Quantum Randomness is Chimeric

“…Almost 40 years since the glamorous inception [ 1 , 2 , 3 , 4 , 5 ] of quantum computing, and despite numerous grandiose claims and prospects of quantum computational advantages [ 6 , 7 , 8 ], only the random generation of bit sequences by beam splitters [ 9 , 10 , 11 , 12 , 13 , 14 , 15 , 16 , 17 ] has reached a certain commercial [ 18 ] maturity. Yet, these quantum random number generators present oracles [ 9 , 19 ] for “randomness”, which (i) inductively are imagined and extrapolated to be a finitistic version of an essentially transfinite concept [ 20 ].…”

Theories and applications of quantum annealing: A literature survey

“…(如谷歌、Rigetti或英特尔的设备)相近(45与2000的平 方根相近) [34] . 也就是说, D-Wave的Pegasus拓扑结构新 系统的性能将与拥有70-80个量子比特的超导系统 相当.…”