Share Your Experience: Take the 2024 Developer Survey

# Tag Info

Accepted

### (April Fools 2024) Where can we find out more details about the recent factoring of RSA-2048?

It is likely an April fools joke Factoring RSA-2048 will require billions of qubits, or thousands of very "clean" qubits in a quantum computer that operates so well that it doesn't need ...

### Can numbers be factored by using a reverse multiplication circuit on a quantum computer?

Remember that the unitary portion of any quantum algorithm is necessarily reversible. On the other hand, the map $f(x,y)\mapsto x\cdot y$ which sends two integers to their product is not. This is ...
• 22.9k
Accepted

### Speed versus number of qubits for RSA factorization

[Are] a minimum of 6152 (logical) qubits is required to achieve the capacity of factoring 2048 bit long integers[..]? No, we intentionally used more logical qubits than needed because that reduced ...
• 37.8k

### Is QFT qubit recycling compatible with Zeckendorf's Fibonacci representation of integers?

My spontaneous off-the-bat reply would be no — and even if control qubits can be recycled, then it would be towards the end of the quantum algorithm, and the advantage would then not be that great. ...
• 516

### Practical implementation of Shor and other factoring algorithms

I would say that it is not possible to give a proper answer to this question since the problem instances that may potentially be tractable by present-day quantum computers are too small: As ...
• 516
Accepted

### Bound on success Probability for Regev's factoring algorithm

This is just Markov's inequality that states that for a positive random variable $X$ and $a > 0$ then $$P( X \geq a ) \leq \frac{E(X)}{a}.$$ see the wikipedia: https://en.wikipedia.org/wiki/...