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
SUMMARY

Google's $5M XPRIZE aims to incentivize the development of practical algorithms for quantum computers. Current quantum computers, with approximately 100 noisy qubits, are not yet capable of executing complex algorithms like Shor's algorithm for large numbers due to limitations in error correction. The focus of the prize is on creating useful algorithms that can operate on existing quantum hardware, despite the fact that many tasks can be performed more efficiently on classical systems. The discussion emphasizes the need for innovative approaches to leverage quantum computing's potential in solving hard problems.

PREREQUISITES
  • Understanding of quantum computing fundamentals
  • Familiarity with Shor's algorithm and its implications
  • Knowledge of error correction in quantum systems
  • Awareness of current quantum hardware limitations
NEXT STEPS
  • Research practical applications of boson sampling in quantum computing
  • Explore advancements in quantum error correction techniques
  • Investigate the development of algorithms for near-term quantum hardware
  • Learn about the comparison between quantum and classical computing performance
USEFUL FOR

Researchers, quantum computing enthusiasts, algorithm developers, and anyone interested in the practical applications of quantum technology.

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