Factoring integers with sublinear resources on a superconducting quantum processor · HackerPapers discussions

Factoring integers with sublinear resources on a superconducting quantum processor — mentioned by vlovich123

Fri, 24 May 2024 17:19:35 GMT

The involvement of the quantum computer is only that it's an adversary that can break asymmetric encryption with different complexity constraints than a classical computer. For example, take two random prime numbers as a secret and publish the result of multiplying them. It turns out that if you want to find the two random prime numbers by knowing only the result of multiplication is a hard problem known as integer factorization. If you double the size of the prime numbers, discovering them takes exponentially longer. The theoretical quantum computer model though says that it can accomplish…

Paper and discussion history. A mention is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — mentioned by 0xpino

Sun, 27 Aug 2023 01:00:02 GMT

Secure private data from your deepest secrets. As a cybersecurity researcher, I have noticed a great lack of innovation in encryption algorithms in more than two decades. But in January 2023, an event changed everything, after Chinese researchers managed to crack the 2048-bit RSA algorithm with just 372 qubits. This fact highlights the urgent need to evolve our cryptography against the power of quantum computing. Source: https://arxiv.org/pdf/2212.12372.pdf After learning about the above, being inspired by Moore's Law and the concept of #bitcoin halving, I envisioned a future with crypto that…

Paper and discussion history. A mention is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — mentioned by c0r0n3r

Fri, 27 Jan 2023 13:50:20 GMT

We factorize a 48-bit integer using 10 trapped-ion qubits on a Quantinuum’s quantum computer. This result outperforms the recent achievement by B. Yan et al., arXiv:2212.12372 (2022), increasing the success probability by a factor of 6 with a non-hybrid digitized-counterdiabatic quantum factorization (DCQF) algorithm. We expect better results with hybrid DCQF methods on our path to factoring RSA-64, RSA-128, and RSA-2048 in this NISQ era, where the latter case may need digital-analog quantum computing (DAQC) encoding.

Paper and discussion history. A mention is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — HN submission

Thu, 12 Jan 2023 16:44:22 GMT

Factoring Integers with Sublinear Resources on Superconducting Quantum Processor

2 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — mentioned by cs702

Thu, 05 Jan 2023 15:32:20 GMT

He's referring to this: https://arxiv.org/abs/2212.12372 Scott's take: > NO. JUST NO.

Paper and discussion history. A mention is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — HN submission

Thu, 05 Jan 2023 11:58:53 GMT

Factoring integers with sublinear resources on a quantum processor

3 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — HN submission

Wed, 04 Jan 2023 14:14:30 GMT

Factoring integers with sublinear resources on superconducting quantum processor

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — mentioned by Strilanc

Tue, 03 Jan 2023 20:54:16 GMT

I want to contrast this paper with Shor's factoring paper [1]. One of the things that stands out to me about Shor's paper is how meticulous he is. He is considering the various ways the algorithm might fail, and proving it doesn't fail in that way. For example, the algorithm starts by picking a random seed and you can show that some choices of seed simply don't work. He proves a lower bound on how many have to work. Also, given a working seed, sometimes the quantum sampling process can correctly return a useless result. He bounds how often that can occur as well. He never says "I think this…

Paper and discussion history. A mention is not an endorsement.

Factoring integers with sublinear resources on a superconducting quantum processor — HN submission

Tue, 03 Jan 2023 18:47:21 GMT

Factoring integers with sublinear resources on a quantum processor

16 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.