3 ms·

Complexity in what terms? For a classical computer? Besides, the empirical data shows otherwise. It takes 12 qubits to factor 15. We're up to 53 now. With qua

Complexity in what terms? For a classical computer? Besides, the empirical data shows otherwise. It takes 12 qubits to factor 15. We're up to 53 now. With quantum annealing, a 20 bit number has been factored with 97 qubits. Not on a real quantum computer yet, of course. So I have no idea what you are talking about.

scottlocklin 7y ago
> Not on a real quantum computer yet, of course... Erm, OK. I guess we agree that nobody has factored the number 15 on a quantum computer yet. Maybe you should read the paper I helpfully linked you above.
- codesushi42 7y ago
  Yes they have. You are spreading lies and FUD: https://www.google.com/amp/s/phys.org/news/2016-03-quantum-factors-scaled.amp https://www.google.com/amp/s/phys.org/news/2016-03-quantum-f... I was referring to the quantum annealing example, because no 97 qubit quantum computer exists yet.
  - scottlocklin 7y ago
    I'm not spreading FUD; I am correcting misinformation from muppets whose understanding doesn't go beyond press releases. Nobody has yet done a Shor factorization of the number 15; the end, and even if someone's press release says so there is no scalable way of factoring large integers.
    - codesushi42 7y ago
      There is. Quantum annealing. I think you're just trolling at this point. Or do you not care for much reading?
      - scottlocklin 7y ago
        Quantum annealing will never be used for factoring prime numbers from large integers, and hasn't even managed to factor 3 and 5 from 15. Even if you click your heels together three times and wish for it really hard, it's not going to happen. Did you read the nature article, or just the press releases?
        deleted 7y ago
        [deleted]
        codesushi42 7y ago
        Uh huh. Did you? Both methods requires 𝒪(log2(𝑁)) qubits in total, where N is the number to be factored. The novelty of our demonstration of quantum annealing for prime factorization is based on the reduction in quantum resources required to execute factoring and the experimental verification of the algorithmic accuracy using currently available hardware. As a proof-of-concept, we have demonstrated these methods by factoring integers using the D-Wave 2000Q quantum annealing hardware, but these methods may be used on any other quantum annealing system with a similar number of qubits, qubit degree of connectivity, and hardware parameter precision. Assuming that quantum annealing hardware systems will continue to grow both in the number of qubits and bits of precision capabilities, our methods offer a promising path toward factor much larger numbers in the future. And there is this too: https://link.springer.com/article/10.1007%2Fs11433-018-9307-1 https://link.springer.com/article/10.1007%2Fs11433-018-9307-... Are you just going to sit there and lob lame insults or do you have anything meaningful to contribute?
        scottlocklin 7y ago
        Even the first line of that paper is false. "RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard (and hence intractable) problem for a classical computer." That is incorrect: there is no proof that factoring is NP-hard. Anyway, you can hardly expect me to take anything they say after this seriously.
        7y ago

scottlocklin 7y ago

> Not on a real quantum computer yet, of course... Erm, OK. I guess we agree that nobody has factored the number 15 on a quantum computer yet. Maybe you should read the paper I helpfully linked you above.

codesushi42 7y ago
Yes they have. You are spreading lies and FUD: https://www.google.com/amp/s/phys.org/news/2016-03-quantum-factors-scaled.amp https://www.google.com/amp/s/phys.org/news/2016-03-quantum-f... I was referring to the quantum annealing example, because no 97 qubit quantum computer exists yet.
- scottlocklin 7y ago
  I'm not spreading FUD; I am correcting misinformation from muppets whose understanding doesn't go beyond press releases. Nobody has yet done a Shor factorization of the number 15; the end, and even if someone's press release says so there is no scalable way of factoring large integers.
  - codesushi42 7y ago
    There is. Quantum annealing. I think you're just trolling at this point. Or do you not care for much reading?
    - scottlocklin 7y ago
      Quantum annealing will never be used for factoring prime numbers from large integers, and hasn't even managed to factor 3 and 5 from 15. Even if you click your heels together three times and wish for it really hard, it's not going to happen. Did you read the nature article, or just the press releases?
      - deleted 7y ago
        [deleted]
      - codesushi42 7y ago
        Uh huh. Did you? Both methods requires 𝒪(log2(𝑁)) qubits in total, where N is the number to be factored. The novelty of our demonstration of quantum annealing for prime factorization is based on the reduction in quantum resources required to execute factoring and the experimental verification of the algorithmic accuracy using currently available hardware. As a proof-of-concept, we have demonstrated these methods by factoring integers using the D-Wave 2000Q quantum annealing hardware, but these methods may be used on any other quantum annealing system with a similar number of qubits, qubit degree of connectivity, and hardware parameter precision. Assuming that quantum annealing hardware systems will continue to grow both in the number of qubits and bits of precision capabilities, our methods offer a promising path toward factor much larger numbers in the future. And there is this too: https://link.springer.com/article/10.1007%2Fs11433-018-9307-1 https://link.springer.com/article/10.1007%2Fs11433-018-9307-... Are you just going to sit there and lob lame insults or do you have anything meaningful to contribute?
        scottlocklin 7y ago
        Even the first line of that paper is false. "RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard (and hence intractable) problem for a classical computer." That is incorrect: there is no proof that factoring is NP-hard. Anyway, you can hardly expect me to take anything they say after this seriously.
        7y ago