The Future of Quantum Computing with Superconducting Qubits

Abstract

For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomial speedup will most likely require major advances in quantum error correction technology. Meanwhile, achieving a computational advantage in the near term may be possible by combining multiple QPUs through circuit knitting techniques, improving the quality of solutions through error suppression and mitigation, and focusing on heuristic versions of quantum algorithms with asymptotic speedups. For this to happen, the performance of quantum computing hardware needs to improve and software needs to seamlessly integrate quantum and classical processors together to form a new architecture that we are calling quantum-centric supercomputing. Long term, we see hardware that exploits qubit connectivity in higher than 2D topologies to realize more efficient quantum error correcting codes, modular architectures for scaling QPUs and parallelizing workloads, and software that evolves to make the intricacies of the technology invisible to the users and realize the goal of ubiquitous, frictionless quantum computing.

This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. This article appeared in Journal of Applied Physics 132, 160902 (2022) and may be found at https://doi.org/10.1063/5.0082975

References in corpus (24)

• The density-matrix renormalization group in the age of matrix product states
• Quantum algorithm for solving linear systems of equations
• Quantum random access memory
• Fault-tolerant quantum computation with high threshold in two dimensions
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Hybrid quantum-classical algorithms and quantum error mitigation
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Deterministic multi-qubit entanglement in a quantum network
• The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
• Dynamically Generated Logical Qubits
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• A magic state's fidelity can be superior to the operations that created it
• Quantum simulators, continuous-time automata, and translationally invariant systems
• Hamiltonian Quantum Cellular Automata in 1D
• A bridge to lower overhead quantum computation
• Observations Outside the Light-Cone: Algorithms for Non-Equilibrium and Thermal States
• The Computational Power of Symmetric Hamiltonians
• Quantum circuit optimization by topological compaction in the surface code
• Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
• Quantum Topological Data Analysis with Linear Depth and Exponential Speedup
• Perspective: Reproducible Coherence Characterization of Superconducting Quantum Devices
• Entanglement Forging with generative neural network models