Google’s quantum computing plans threatened, IBM

Click For Summary

Discussion Overview

The discussion revolves around IBM's recent advancements in simulating quantum computers and its implications for the competition between classical and quantum computing. Participants explore the technical aspects of simulation versus emulation, the performance of IBM's simulation, and its potential applications in verifying quantum computations.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • Some participants note that IBM's simulation of a 56-qubit quantum computer on a classical supercomputer is a significant achievement, previously considered impossible.
  • Others highlight that the simulation operates a billion times slower than an actual quantum computer, raising questions about its practical utility.
  • There is a suggestion that IBM's approach may focus on using classical computing to verify results from quantum computations rather than competing directly with them.
  • One participant mentions the potential for memory reduction and parallelization in simulations, which could benefit software developers if made accessible online.
  • A participant raises a question about the distinction between emulation and simulation, indicating a need for clarification on these concepts.
  • Another participant provides an example of how classical computers can efficiently check the correctness of computations, such as prime factorization, while struggling with the initial computation itself.

Areas of Agreement / Disagreement

Participants express differing views on the implications of IBM's advancements, with some seeing it as a threat to quantum supremacy while others argue it may serve more as a tool for verification rather than direct competition. The discussion remains unresolved regarding the overall impact of these developments on the future of quantum computing.

Contextual Notes

Participants acknowledge the limitations of the simulation's speed compared to actual quantum computing, and there are unresolved questions about the definitions and distinctions between emulation and simulation.

Who May Find This Useful

Readers interested in quantum computing, classical computing, and the technical nuances of simulation and emulation may find this discussion relevant.

Spinnor
Gold Member
Messages
2,231
Reaction score
419
"Just when it was looking like the underdog, classical computing is striking back. IBM has come up with a way to simulate quantum computers that have 56 quantum bits, or qubits, on a non-quantum supercomputer – a task previously thought to be impossible. The feat moves the goalposts in the fight for quantum supremacy, the effort to outstrip classical computers using quantum ones. ..."

From, https://www.newscientist.com/articl...-computing-plans-threatened-by-ibm-curveball/
 
  • Like
Likes   Reactions: StoneTemplePython, FactChecker, Drakkith and 1 other person
Computer science news on Phys.org
They did mention in the article that the simulation is a billion times slower than what a true 56qubit quantum computer would be.

The interesting thing is that IBM found a way to reduce the memory and to parallelize the simulation making it useful to check complex quantum calculations in the future. The memory reduction means that they can probably continue to expand the simulation useful for software developers if they make it available online like they do now with their 5 qubit machine.

A few years back UT had developed a classical system to emulate a quantum computer.

https://phys.org/news/2015-05-quantum-emulated-classical.html
 
  • Like
Likes   Reactions: Spinnor
Free 16 bit quantum computer emulator,

http://algassert.com/quirk

The tutorial,



I guess I need to lear the difference between emulation and simulation.
 
Last edited:
  • Like
Likes   Reactions: jedishrfu
After I read the article, I get a different picture of what's going on than what the headline suggest.The article does tell us that it runs a billion times slower than what a theoretical 56 qubit would do. It sounds (to me) like they want to use the classical computer to check answers from quantum computer rather than "smash the competition"
 
  • Like
Likes   Reactions: jedishrfu
Checking answers is often easier than doing the initial computation. Prime factorization is the typical example here. A classical computer can easily check if a number with 2 million digits has been factorized correctly (your home computer can do that in seconds), but it has no way of doing that factorization in general.
 
  • Like
Likes   Reactions: scottdave

Similar threads

  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 19 ·
Replies
19
Views
5K
  • · Replies 42 ·
2
Replies
42
Views
5K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K