Quantum computation is years, maybe decades, away from practical application (i.e.: generating profit for a business). It has been estimated that as many as a million qubits may be necessary for a quantum computer to solve a real problem that people care about. Unless something appears out of nowhere - new physics, novel qubit design, etc. - scalability particularly around error correction remains a major dilemma. Current approaches to Q.E.C. simply don't scale to several orders of magnitude needed to make this tech. useful. Just a friendly warning: This is one of THE most hyped technologies on the scene today and a lot of dead ends, failed startups, and bullshit marketing await us.

Agreed. Perhaps we are the few who have the true interest?

Due to modern tech and our own personal interest this information is very easy to access. However the average person has no idea how hard it is for asml to fit more transistors on a chip. Since we are interested in this field of research we are early to the party so to speak. In other words no one cares about a problem they don't know exists

They’ll watch it when someone breaks PKI!

@@nelange maybe but these guys seem to be doubling the qubits every year. So less perhaps only a decade? All very interesting nonetheless.

it cant do anything

youtube interview/group therapy

Yes

You left one out! WARFARE

Preskill quantum computing lecture notes

Richard Feynman

Was just about to ask that and maybe a T-shirt or singlet!

4

The recent Chinese paper suggests 372 qubits is already sufficient to break 2,048-bit RSA. If they proves true, then I’m guessing Condor will own 3,072-bit RSA.

Millions of physical qubits

​@@pianowhizzdid they break RSA?

@FreeMathSolutions You apply a function you don't know what it does to get an answer you are searching for? Is that right in simple terms? But if you don't know the answer, how do you know you've got it... assuming you are searching for the biggest value in a list of trillions of items? Thanks in advance!

@FreeMathSolutions How does balanced/constant f(x) help me with finding the biggest value in a list?. I was interested in specifically this scenario! (Grover's algorithm) The application of Oracle just seems too arbitrary in the case I am describing. It's the average reduction of amplitude and increasing the amplitude(amplitudes amplification) of the marked item but how does the oracle knows the marked item considering the Oracle makes the initial rotation of the item we seek, then as a result the average amplitude is decreased and then we do another rotation which increases the amplitude of the marked item so that increases the probability of finding it.(of course a couple more rotations might be needed). We start out in the state of superposition... before the rotations begin! My question is how is the oracle meaningfully introduced in the whole algorithm.? It seems arbitrary to me! How do we know what exactly are we introducing?

@FreeMathSolutions Just don't respond if you don't want to!

@@youtubehatesfreespeech2555 ...

@@somebodyelse2192 .........

Magic portals time travel all of it china in this shit

"transmon qubits" not trans-bond :)

Which one is? Who's doing best? In your opinion. Are these commerical yet?

Quantinuum's H2 system! It is commercial

not really good for that

It is just a phrase. World best, world largest. Doesn't really follow the usual rule, but set in the language enough to be correct.

Their qubits are noisy. You don't get full use of all the qubits due to interference and they know it.