Kardashev scale Quantum Computing for Bitcoin Mining

• URL: http://arxiv.org/abs/2603.25519v2
• Date: Fri, 27 Mar 2026 14:39:32 GMT
• Title: Kardashev scale Quantum Computing for Bitcoin Mining
• Abstract summary: Bitcoin already faces a quantum threat through Shor attacks on elliptic-curve signatures.<n>This paper isolates the other component that public discussion often conflates with it: mining.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bitcoin already faces a quantum threat through Shor attacks on elliptic-curve signatures. This paper isolates the other component that public discussion often conflates with it: mining. Grover's algorithm halves the exponent of brute-force search, promising a quadratic edge to any quantum miner of Bitcoin. Exactly how large that edge grows depends on fault-tolerant hardware. No prior study has costed that hardware end to end. We build an open-source estimator that sweeps the full attack surface: reversible oracles for double-SHA-256 mining and RIPEMD-based address preimages, surface-code factory sizing, fleet logistics under Nakamoto-consensus timing, and Kardashev-scale energy accounting. A parametric sweep over difficulty bits b, runtime caps, and target success probabilities reveals a sharp transition. At the most favourable partial-preimage setting (b = 32, 2^224 marked states), a superconducting surface-code fleet still requires about 10^8 physical qubits and about 10^4 MW. That load is comparable to a large national grid. Tightening to Bitcoin's January 2025 mainnet difficulty (b about 79) explodes the bill to about 10^23 qubits and about 10^25 W, approaching the Kardashev Type II threshold. These numbers settle a narrower question than "Is Bitcoin quantum-secure?" Once Grover mining is lifted from asymptotic query counts to fault-tolerant physical cost, practical quantum mining collapses under oracle, distillation, and fleet overhead. To push mining into non-trivial consensus effects, one must invoke astronomical quantum fleets operating at energy scales that lie far above present-day civilization.

Related papers

• Strategies for quantum-enabled Bitcoin miners [0.0]
  Two miners equipped with quantum computers will have on the 51% attack threshold of the Bitcoin network.<n>We extend an existing game-theoretic framework for Bitcoin mining and compute the resultant payoff matrices.<n>We show that these optimal quantum mining strategies have a negligible effect on the 51% attack threshold.
  arXiv  Detail & Related papers  (2026-07-27T02:56:49Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Quantum Horizon: An evaluation of quantum computing as a threat to Bitcoin and Ethereum [0.0]
  Quantum computing poses a real, broad-based, but bounded and substantially mitigable threat to Bitcoin and quadratic.<n>We separate the two quantum algorithms that public discussion routinely conflates.<n>A timely migration beats even an optimistic 2035 machine, so the binding constraint is governance, not technology.
  arXiv  Detail & Related papers  (2026-06-12T14:21:58Z)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography.<n> cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP)<n>Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• 51% Attack via Difficulty Increase with a Small Quantum Miner [0.9208007322096532]
  We present a strategy for a single quantum miner with relatively low hashing power. Most proof-of-work cryptocurrencies, including Bitcoin, are vulnerable to our attack.
  arXiv  Detail & Related papers  (2024-03-12T18:45:29Z)
• The lower energy consumption in cryptocurrency mining processes by SHA-256 Quantum circuit design used in hybrid computing domains [1.000779758350696]
  It would be possible to reduce the mining energy consumption with a quantum hardware's low-energy-operation characteristics. Within this work we demonstrated the use of optimized quantum mining facilities which would replace the classical SHA-256 and high energy consuming classical hardware in near future.
  arXiv  Detail & Related papers  (2023-12-30T23:37:34Z)
• Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
  Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners.<n>Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues.<n>We show that these security issues are inherent in any PoS chain without an external trusted source.<n>We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
  arXiv  Detail & Related papers  (2022-07-18T06:01:25Z)
• Conditions for Advantageous Quantum Bitcoin Mining [0.0]
  We determine the speed and energy efficiency a quantum computer needs to offer an advantage over classical mining. We develop a closed-form approximation for the probability that the quantum miner successfully mines a block. We show that, for a quantum miner that is "peaceful", this success probability is maximized if the quantum miner applies Grover iterations for 16 minutes before measuring.
  arXiv  Detail & Related papers  (2021-10-02T21:08:07Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Advantage on Proof of Work [0.0]
  We make the case that quantum devices provide a computational advantage in performing Proof-of-Work (PoW) in the context of Bitcoin. This has strong consequences regarding both quantum-based attacks on the integrity of the entirety of the blockchain, as well as more legitimate uses of quantum computation for the purpose of mining Bitcoin and other cryptocurrencies.
  arXiv  Detail & Related papers  (2021-05-05T01:27:31Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.