It looks like you're using an Ad Blocker.
Please white-list or disable AboveTopSecret.com in your ad-blocking tool.
Some features of ATS will be disabled while you continue to use an ad-blocker.
Google and NASA have been working on a lightning-fast quantum computer that is 3,600 times faster than a supercomputer at solving complex problems.
Has Google won the race to build the world’s first commercial quantum computer?
The technology company’s artificial intelligence lab believe they may finally have proof that their opinion-dividing quantum computer actually works.
Google and Nasa announced they were collaborating on the D-Wave X2 quantum computer, which they say is 100 million times faster than a conventional computer chip, in 2013. It can answer certain algorithms in seconds rather than years.
Google director of engineering, Hartmut Neven, said: “For a specific, carefully crafted proof-of-concept problem we achieve a 100-million-fold speed-up.”
originally posted by: darkbake
Oh God... the question is, who is going to have access to these guys? Probably the government and corporations at first. They would be great at sifting through mass surveillance data. Maybe they will trickle down to the common man if the technology moves fast enough to give us the older stuff. Imagine one of these babies being used to simulate a neural network for AI...
“The analogy I like is if you have three ways of driving home through rush hour traffic. On any given day, you take only one. You don’t know if the other routes would be quicker or slower. But in quantum mechanics, you can take all three of these routes simultaneously. You don’t specify where you are until you arrive, so you always choose the quickest route,” said Greg Scholes, a University of Toronto biophysicist."
originally posted by: TrueBrit
a reply to: darkbake
One of the first commercial uses for these, will be speeding up the already impossibly fast High Volume Trading market by a factor of "Holy CRAP!".
originally posted by: charlyv
in a very basic nutshell: Quantum computers are targeted at iterative and recursive problems. In conventional computing we converge on iterative solutions by winding intermediate results on a stack inside a function, and when the function completes, we repetitively continue that process by walking that stack, until it is empty.
In a quantum computer, with a sufficient number of Qubits, this entire recursive process can occur almost simultaneously. Speed with no equal in conventional computing, even when using massively parallel CPU networks.
a quantum-mechanical superposition of all possible states (candidate states) with equal weights. Then the system evolves following the time-dependent Schrödinger equation, a natural quantum-mechanical evolution of physical systems. The amplitudes of all candidate states keep changing, realizing a quantum parallelism, according to the time-dependent strength of the transverse field, which causes quantum tunneling between states. If the rate of change of the transverse-field is slow enough, the system stays close to the ground state of the instantaneous Hamiltonian, i.e., adiabatic quantum computation. The transverse field is finally switched off, and the system is expected to have reached the ground state of the classical Ising model that corresponds to the solution to the original optimization problem.