Those machines cannot create entangled states, making a large number of quantum algorithms impossible. Other methods are being researched because the superconducting rings are seen a s a dead end. Consider going to the SQuInT conference in NM on Feb 21 to learn where the industry is at.
If your group did figure out how to create the computer, enjoy your nobel prizes.
Let's build a quantum dildo, mah nikka
>Consider going to the SQuInT conference in NM on Feb 21 to learn where the industry is at.
I am going to SQuInT next year. Are you going to be there?
>Those machines cannot create entangled states
Can you go into depth about what you mean by this? Superconducting quantum computers can perform Grover's algorithm; which needs two-qubit gates.
>If your group did figure out how to create the computer, enjoy your nobel prizes.
They don't give out Nobel prizes for things that have already been discovered. Universal superconducting quantum computers have existed for at least the past 10 years or so. In fact, Jerry Chow's PHD thesis from 2009 is about a 2 qubit universal quantum computer that can perform the Deutsch-Jozsa and Grover's search algorithm.
>Those machines cannot create entangled states, making a large number of quantum algorithms impossible.
Pretty much all quantum algorithms require entanglement, otherwise it would basically just be independently controlling a bunch of qubits.
What exactly do you mean?
sorry user, would love to help, but I gotta build a parallel computing light-wave processor to prove p=np. gotta flash