Google $5M XPRIZE for best uses for Quantum Computers

  • Context: News 
  • Thread starter Thread starter jedishrfu
  • Start date Start date
  • Tags Tags
    Google Quantum
Click For Summary

Discussion Overview

The discussion revolves around the Google $5M XPRIZE aimed at identifying practical problems and algorithms that can be effectively solved using quantum computers. Participants explore the current capabilities of quantum computing technology, its limitations, and the implications of the prize for the future of quantum applications.

Discussion Character

  • Debate/contested
  • Technical explanation
  • Exploratory

Main Points Raised

  • Some participants express skepticism about the necessity of the XPRIZE, suggesting it indicates quantum computing may be perceived as a "useless toy" unless practical applications are demonstrated.
  • Others argue that while current quantum computers are limited in capability due to noise and the number of qubits, there is confidence that future advancements will enable them to solve significant real-world problems.
  • One participant highlights that existing algorithms, such as Shor's algorithm, are not yet feasible for practical use due to the current hardware limitations, which require a substantial increase in qubit count and error correction.
  • There is a discussion about the potential for certain "hard" problems to be solved on current quantum computers, although no algorithms have been identified as having real practical use yet.
  • Some participants note that any useful algorithm that can run on current quantum hardware would likely perform faster on classical computers, such as PCs or GPUs.
  • Another viewpoint suggests that the nature of algorithms and circuits for current quantum hardware differs significantly from those for fully error-corrected machines, indicating that current capabilities may not predict future potential.
  • The mention of algorithms like boson sampling raises the possibility that useful quantum algorithms could be developed, despite current limitations.

Areas of Agreement / Disagreement

Participants express a mix of skepticism and optimism regarding the current state and future potential of quantum computing. There is no consensus on whether the XPRIZE is a necessary step or an indication of the technology's limitations.

Contextual Notes

Limitations include the current generation of quantum computers being noisy and having a limited number of qubits, which restricts the practical application of existing algorithms. The discussion also reflects uncertainty about the scalability of quantum computing and the development of useful algorithms.

Computer science news on Phys.org
jedishrfu said:
Google is looking for practical problems/algorithms that can be solved on quantum computers:
Does this mean QC now appears to be a useless toy, and that they need to find a real application that justifies the expenditure, so they can keep their jobs ?
 
Pretty much.

We have the technology now give us your problems.
 
Baluncore said:
Does this mean QC now appears to be a useless toy, and that they need to find a real application that justifies the expenditure, so they can keep their jobs ?
No, not at all.
We are very confident that large-scale, fully error corrected quantum computers will be able to solve a lot of real world problems; and we already have good algorithms that can be used for this (Shor's algorithm being the most famous, but probably not the most useful)

However, we are not there yet. The current generation of quantum computers have relatively few (~!00) qubits and these are still very noisy (no proper error correction) and that severely limits what can be done.; you can't e.g. run Shor's algorithm for anything but very small numbers. If you want to e.g., break RSA you might need a computer with lots fully error corrected logical qubits; and that might (if we are unlucky) require ~millions of physical qubits. That is we need to scale another factor of x1000 or so (plus solve a bunch of other problems).

There are a few "hard" problems (problems that are not practically solvable on a classical computer) that can be solved on current quantum computers, but none of these algorithms have any real practical use.

Hence, the prize is mainly about developing useful algorithms that can run on current or near-term hardware.
 
Last edited by a moderator:
f95toli said:
Hence, the prize is mainly about developing useful algorithms that can run on current or near-term hardware.
But anything useful, that will run on current QC hardware, will run faster on a PC or GPU.
Baluncore said:
... they need to find a real application that justifies the expenditure, so they can keep their jobs ?
 
Baluncore said:
But anything useful, that will run on current QC hardware, will run faster on a PC or GPU.
Right now, that is probably true; but I guess that is the point of the prize(!)

Note that the algorithms/circuits that are used for the current generation of QC is quite different from what would be used on a fully error-corrected machine. Right now, all circuits have to finish running in a relatively short amount of time which severely limits the number of operations that can be run in each shot. In a fully error-corrected machine you should -in principle- be able to run arbitrary long circuits. Hence, you can't really "extrapolate" from what can be done today to what might be possible in the future.

The fact that there are some algorithms (say boson sampling) which DO run very quickly (much faster than what can be done using a supercomputer) even on current generation HW presumably means that there is no fundamental reason for why someone couldn't develop a fast algorithm that was actually useful.
 
Last edited by a moderator:
  • Like
Likes   Reactions: DrClaude

Similar threads

  • · Replies 16 ·
Replies
16
Views
3K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
43
Views
6K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
11
Views
3K