The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime

Abstract

We investigate how hardware specifications can impact the final run time and the required number of physical qubits to achieve a quantum advantage in the fault tolerant regime. Within a particular time frame, both the code cycle time and the number of achievable physical qubits may vary by orders of magnitude between different quantum hardware designs. We start with logical resource requirements corresponding to a quantum advantage for a particular chemistry application, simulating the FeMoco molecule, and explore to what extent slower code cycle times can be mitigated by using additional qubits. We show that in certain situations architectures with considerably slower code cycle times will still be able to reach desirable run times, provided enough physical qubits are available. We utilize various space and time optimization strategies that have been previously considered within the field of error-correcting surface codes. In particular, we compare two distinct methods of parallelization, Game of Surface Code's Units, and AutoCCZ factories, both of which enable one to incrementally speed up the computation until the reaction limited rate is reached. Finally we calculate the number of physical qubits which would be required to break the 256 bit elliptic curve encryption of keys in the Bitcoin network, within the small available time frame in which it would actually pose a threat to do so. It would require approximately 317 million physical qubits to break the encryption within one hour using the surface code, a code cycle time of 1 $\mu s$, a reaction time of 10 $\mu s$, and physical gate error of $10^{-3}$. To break the encryption instead within one day it would require 13 million physical qubits.

arXiv comment22 pages, 4 figures

References in corpus (62)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• High-fidelity quantum logic gates using trapped-ion hyperfine qubits
• High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
• Elucidating Reaction Mechanisms on Quantum Computers
• Validating quantum computers using randomized model circuits
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Roads towards fault-tolerant universal quantum computation
• High-Fidelity Universal Gate Set for ${}^9$Be${}^{+}$ Ion Qubits
• A fault-tolerant one-way quantum computer
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Quantum codes on a lattice with boundary
• Magic state distillation with low overhead
• Resilient Quantum Computation: Error Models and Thresholds
• High-rate, high-fidelity entanglement of qubits across an elementary quantum network
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Blueprint for a microwave trapped-ion quantum computer
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Fast quantum logic gates with trapped-ion qubits
• Quantum computing enhanced computational catalysis
• Controlling fast transport of cold trapped ions
• Coherent Diabatic Ion Transport and Separation in a Multi-Zone Trap Array
• Fast atomic transport without vibrational heating
• Quantum attacks on Bitcoin, and how to protect against them
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Magic State Distillation: Not as Costly as You Think
• Novel constructions for the fault-tolerant Toffoli gate
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits
• Long-range quantum entanglement in noisy cluster states
• Estimating the Coherence of Noise
• High-fidelity laser-free universal control of two trapped ion qubits
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Comparing Experiments to the Fault-Tolerance Threshold
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Efficient estimation of Pauli channels
• Bounding quantum gate error rate based on reported average fidelity
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Surface code implementation of block code state distillation
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Resilient entanglement gates for trapped ions
• A silicon-based surface code quantum computer
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Minimally complex ion traps as modules for quantum communication and computing
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• High-Fidelity Preservation of Quantum Information During Trapped-Ion Transport
• Time-optimal quantum computation
• Hierarchical surface code for network quantum computing with modules of arbitrary size
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Decoherence and dephasing errors caused by D.C. Stark effect in rapid ion transport
• Bitcoin and quantum computing
• High-fidelity superconducting quantum processors via laser-annealing of transmon qubits
• Quantum linear network coding for entanglement distribution in restricted architectures
• Flexible layout of surface code computations using AutoCCZ states

Cited by in corpus (6)

• A high-fidelity quantum matter-link between ion-trap microchip modules
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Cryogenic microwave link for quantum local area networks
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Literature Review of the Effect of Quantum Computing on Cryptocurrencies using Blockchain Technology
• Deterministic Quantum Communication Between Fixed-Frequency Superconducting Qubits via Broadband Resonators