Demonstration of quantum advantage in machine learning
Large advantage in small quantum computers Quantum computing promises to revolutionize all fields of science by solving problems that are too complex for conventional computers. However, the realization of a full-fledged, universal quantum computer is still far ahead, requiring millions of quantum b...
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2017
|
| Subjects: | |
| Online Access: | https://doaj.org/article/b5566ab8f0a84a03ad96e12cf550175d |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Large advantage in small quantum computers Quantum computing promises to revolutionize all fields of science by solving problems that are too complex for conventional computers. However, the realization of a full-fledged, universal quantum computer is still far ahead, requiring millions of quantum bits and very low error rates. Despite this, D. Ristè and colleagues at Raytheon BBN Technologies, with collaborators at IBM, have demonstrated that a quantum advantage already appears with only a few quantum bits and a highly noisy system. The team solved a particular problem, known as learning parity with noise, using a five-qubit superconducting quantum processor. Counting the number of times that the processor runs, they demonstrate that the implemented quantum algorithm finds the solution much faster than by classical methods |
|---|