Conditions for Advantageous Quantum Bitcoin Mining

• URL: http://arxiv.org/abs/2110.00878v1
• Date: Sat, 2 Oct 2021 21:08:07 GMT
• Title: Conditions for Advantageous Quantum Bitcoin Mining
• Authors: Robert R. Nerem and Daya R. Gaur
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Our aim is to determine conditions for quantum computing technology to give rise to security risks associated with quantum Bitcoin mining. Specifically, we determine the speed and energy efficiency a quantum computer needs to offer an advantage over classical mining. We analyze the setting in which the Bitcoin network is entirely classical except for a single quantum miner who has small hash rate compared to that of the network. We develop a closed-form approximation for the probability that the quantum miner successfully mines a block, with this probability dependent on the number of Grover iterations the quantum miner applies before making a measurement. Next, 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, which is surprising as the network mines blocks every 10 minutes on average. Using this optimal mining procedure, we show that the quantum miner outperforms a classical computer in efficiency (cost per block) if the condition $Q < Crb$ is satisfied, where $Q$ is the cost of a Grover iteration, $C$ is the cost of a classical hash, $r$ is the quantum miner's speed in Grover iterations per second, and $b$ is a factor that attains its maximum if the quantum miner uses our optimal mining procedure. This condition lays the foundation for determining when quantum mining, and the known security risks associated with it, will arise.

Related papers

• 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)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage [0.0]
  We show that the green quantum advantage threshold depends on (i) the quality of the experimental quantum gates and (ii) the entanglement generated in the QPU. We compute the green quantum advantage threshold for a few paradigmatic examples in terms of algorithms and hardware platforms.
  arXiv  Detail & Related papers  (2022-05-24T14:14:00Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.