|
|
|
|
|
|
by bill_mcgonigle
2462 days ago
|
|
|
A little more for you: "Document ID: 20190030475 Quantum Supremacy Using a Programmable Superconducting Processor The tantalizing promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here, we report using a processor with programmable superconducting qubits to create quantum states on 53 qubits, occupying a state space 2(exp53) ~ 10(exp16). Measurements from repeated experiments sample the corresponding probability distribution, which we verify using classical simulations. While our processor takes about 200 seconds to sample one instance of the quantum circuit 1 million times, a state-of-the-art supercomputer would require approximately 10,000 years to perform the equivalent task. This dramatic speedup relative to all known classical algorithms provides an experimental realization of quantum supremacy on a computational task and heralds the advent of a much-anticipated computing paradigm. 20190801 August 2019 Copyright, Public use permitted Unclassified, Unlimited, Publicly available http://hdl.handle.net/2060/20190030475 CASI application/pdf Mandra, Salvatore Rieffel, Eleanor G. Biswas, Rupak ARC-E-DAA-TN71198 NASA/TP-2019-220319 Computer Systems" Happily provided by Google. ;) https://webcache.googleusercontent.com/search?q=cache:Ig1-Fl... |
|
|
Bing cached the pdf! :) http://cc.bingj.com/cache.aspx?q=%2220190030475%22&d=5027660...
Mirror https://filebin.net/k5rr4l0p6ldde7hr/Quantum_Supremacy_Using...