Advance Results on the 1152 Qubit DWave Quantum Systems up to 933 Qubits and application to cryptology

Colin Williams recently presented some new results in the UK of next generation of DWave chips. The next generation of chips are the 1152 qubit versions and are called the Washington generation. Here you can see some advance looks at the first results on up to 933 qubits. These are very early days for the Washington generation. Things will get a lot better on this one before it’s released (Rainier and Vesuvius both took 7 generations of iteration before they stabilized). But some good results on the first few prototypes.

State-of-the-Art Quantum Annealing and its Application to Cryptology

Approximating goodness of the Quantum answers

Imagine instead of measuring the time to find the ground state of a problem with some probability, instead measure the difference between the ground state energy and the median energy of samples returned, as a function of time and problem size. If we do this what we find is that the median distance from the ground state scales like sqrt{|E|+N} where N is the number of qubits, and |E| is the number of couplers in the instance (proportional to N for the current generation). More important, the scaling with time flattens out and becomes nearly constant. This is consistent with the main error mechanism being mis-specification of problem parameters in the Hamiltonian (what we call ICE or Intrinsic Control Errors).

In other words, the first sample from the processor (ie constant time), with high probability, will return a sample no further than O(sqrt{N}) from the ground state.

Other Presentations – Capabilities and Limitations of Quantum Computers

Capabilities and Limitations of Quantum Computers

Quantum computers if advantageous over classical computers then can (probably) solve efficiently problems of intermediate complexity

The Power of Early Quantum Computers: Annealers versus Circuit Based Machines

If you liked this article, please give it a quick review on ycombinator or StumbleUpon. Thanks