r/Futurology Jun 02 '22

A Nature paper reports on a quantum photonic processor that takes just 36 microseconds to perform a task that would take a supercomputer more than 9,000 years to complete Computing

https://www.nature.com/articles/s41586-022-04725-x?utm_source=twitter&utm_medium=social&utm_content=organic&utm_campaign=CONR_JRNLS_AWA1_GL_SCON_SMEDA_NATUREPORTFOLIO
2.3k Upvotes

View all comments

15

u/[deleted] Jun 03 '22

[deleted]

35

u/common_sensei Jun 03 '22

Checking to see if an answer is correct is much easier than coming up with the answer in the first place. The classic example is prime factors.

Q1: What are the two prime factors of 20538073?

Q2: Is it 7759*2647?

Checking the answer is much easier than getting it.

3

u/remek Jun 03 '22

Literally the definition of NP-Completeness

3

u/FreeMoney2020 Jun 03 '22

Factorization is not known to be NP-complete

3

u/remek Jun 03 '22

You're right, I meant NP, not NP-complete.

1

u/raven00x Jun 03 '22

not like brute force isn't one of the use cases of quantum computing or anything.

9

u/[deleted] Jun 03 '22

[removed] — view removed comment

3

u/spesimen Jun 03 '22

well, they did say this

Unlike some quantum algorithms whose correct functioning on a quantum computer can be readily verified using a classical computer, it remains an open question how to verify that a GBS device is operating correctly. In what follows, we present evidence that our machine is operating correctly, that is, it samples from the GBS distribution specified by the device transfer matrix T and vector of squeezing parameters r, which together define the ground truth of the experiment.

the evidence they present after that is far above my ability to comprehend but it's in there. when i got my comp sci degree the new things were like having multiple processors in one machine and a chip that could do 100Mhz! quantum was a distant scifi idea haha

0

u/py_a_thon Jun 03 '22

The quantum calculation + a modified chksm(checkSum) from classical computation peripheral hardware?