Requirements for fault-tolerant factoring on an atom-optics quantum computer

Abstract

Quantum information processing and its associated technologies has reached an interesting and timely stage in their development where many different experiments have been performed establishing the basic building blocks. The challenge moving forward is to scale up to larger sized quantum machines capable of performing tasks not possible today. This raises a number of interesting questions like: How big will these machines need to be? how many resources will they consume? This needs to be urgently addressed. Here we estimate the resources required to execute Shor's factoring algorithm on a distributed atom-optics quantum computer architecture. We determine the runtime and requisite size of the quantum computer as a function of the problem size and physical error rate. Our results suggest that once experimental accuracy reaches levels below the fault-tolerant threshold, further optimisation of computational performance and resources is largely an issue of how the algorithm and circuits are implemented, rather than the physical quantum hardware

18 Pages, 17 Figs. Comments Welcome

References in corpus (24)

• Quantum Computing
• Surface codes: Towards practical large-scale quantum computation
• A single-atom electron spin qubit in silicon
• Synthesis of Quantum Logic Circuits
• Topological fault-tolerance in cluster state quantum computation
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Shor's quantum factoring algorithm on a photonic chip
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• A new quantum ripple-carry addition circuit
• Fast Quantum Modular Exponentiation
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Multilevel distillation of magic states for quantum computing
• Quantum Circuit Placement
• An Introduction to Quantum Programming in Quipper
• The Photonic Module: an on-demand resource for photonic entanglement
• A scalable, high-speed measurement-based quantum computer using trapped ions
• A bridge to lower overhead quantum computation
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Shor's algorithm on a nearest-neighbor machine
• Long-range coupling and scalable architecture for superconducting flux qubits
• High speed quantum gates with cavity quantum electrodynamics
• Automated Generation of Layout and Control for Quantum Circuits

Cited by in corpus (37)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Error mitigation for short-depth quantum circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum optimization using variational algorithms on near-term quantum devices
• Photonic architecture for scalable quantum information processing in NV-diamond
• Local and Distributed Quantum Computation
• Performing Quantum Computing Experiments in the Cloud
• Fault-tolerant thresholds for quantum error correction with the surface code
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• Photonic Quantum Networks formed from NV- Centers
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Quantum multiplexing
• Overhead analysis of universal concatenated quantum codes
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction
• High-threshold topological quantum error correction against biased noise
• Resource reduction for distributed quantum information processing using quantum multiplexed photons
• Formal Constraint-based Compilation for Noisy Intermediate-Scale Quantum Systems
• Lattice Surgery Translation for Quantum Computation
• Pseudo-2D superconducting quantum computing circuit for the surface code: the proposal and preliminary tests
• Multi-mode architectures for noise-resilient superconducting qubits
• Wire Recycling for Quantum Circuit Optimization
• Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
• Optimization of Richardson extrapolation for quantum error mitigation
• A Regular Representation of Quantum Circuits
• Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
• Everything You Always Wanted to Know About Quantum Circuits
• Expressive Quantum Supervised Machine Learning using Kerr-nonlinear Parametric Oscillators
• Hardness of braided quantum circuit optimization in the surface code
• T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder
• Software Pauli Tracking for Quantum Computation
• An introduction to Fault-tolerant Quantum Computing
• Ghost factors in Gauss-sum factorization with transmon qubits
• Quantum Carry Lookahead Adders for NISQ and Quantum Image Processing
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• Mapping of Topological Quantum Circuits to Physical Hardware
• Classical Control of Large-Scale Quantum Computers