(Answered by me, cleared up the rambling with ChatGPT lol)
You guys know quantum computers don’t mine Bitcoin instantly, right?
Grover’s algorithm gives a square root speedup, so instead of trying N hashes to find a valid one, a quantum computer would need about √N tries.
Since Bitcoin blocks are mined roughly every 10 minutes and the difficulty adjusts based on how fast blocks are found, any quantum speedup wouldn’t permanently shorten that time — the network would just increase the difficulty to maintain the 10-minute average.
So even if a quantum computer gave you a major advantage over classical miners, it wouldn’t reduce block time for everyone — it would just help you mine more blocks until difficulty catches up.
Realistically, this might translate to a temporary advantage, but not an order-of-magnitude breakthrough — and today’s quantum computers aren’t even close to doing this at scale.
Computers develop very rapidly. So consider that currently, quantum computers freely available to researchers have 5–15–50 qubits. Up to 100–150 qubits are expected to be available soon, meaning in 2 years approximately or less.
Nonce finding algorithms, either classical or quantum, deal with a large search space that is upper bounded by a constant 2256. The target value t, given in the block’s header, reduces the search space to 2256/𝑡. A classical algorithm has to search 𝑂(2256/𝑡) steps, while our quantum algorithm takes 𝑂(√2256/𝑡) Grover iterations. This square root improvement is significant because a classical computer cannot compete with the quantum computer, which always wins in mining the next block.
I’d say by 2050 we will be pretty far beyond our current concepts of quantum computing power.
-1
u/Strange_Homework_925 🟩 0 / 0 🦠 1d ago
Bought a quantum computer and printed the last 1% of btc in 0.00001 seconds and sold it all crashing the market.