Practical Quantum Computing: The value of local computation
arXiv:2009.08513
Abstract
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qubit utilisation. In this paper we discuss three key bottlenecks in near-term quantum computers: bandwidth restrictions arising from data transfer between central processing units (CPUs) and quantum processing units (QPUs), latency delays in the hardware for round-trip communication, and timing restrictions driven by high error rates. In each case we consider a near-term quantum algorithm to highlight the bottleneck: randomised benchmarking to showcase bandwidth limitations, adaptive noisy, intermediate scale quantum (NISQ)-era algorithms for the latency bottleneck and quantum error correction techniques to highlight the restrictions imposed by qubit error rates. In all three cases we discuss how these bottlenecks arise in the current paradigm of executing all the classical computation on the CPU, and how these can be mitigated by providing access to local classical computational resources in the QPU.
References in corpus (27)
- A variational eigenvalue solver on a quantum processor
- Surface codes: Towards practical large-scale quantum computation
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- The Physical Implementation of Quantum Computation
- Simulated Quantum Computation of Molecular Energies
- Error mitigation for short-depth quantum circuits
- Randomized Benchmarking of Quantum Gates
- Extending the computational reach of a noisy superconducting quantum processor
- Robust randomized benchmarking of quantum processes
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Scalable Noise Estimation with Random Unitary Operators
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- Almost-linear time decoding algorithm for topological codes
- Efficient Bayesian Phase Estimation
- A Software Methodology for Compiling Quantum Programs
- What randomized benchmarking actually measures
- Surface code with decoherence: An analysis of three superconducting architectures
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications
- Neural network decoder for topological color codes with circuit level noise
- Efficient error characterization in Quantum Information Processing
- Statistical analysis of randomized benchmarking
- Accelerated Randomized Benchmarking
- Comparing the Overhead of Topological and Concatenated Quantum Error Correction
- From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
- Bayesian inference via rejection filtering