A Practical Overview of Quantum Computing: Is Exascale Possible? (2306.12346v1)
Abstract: Despite numerous advances in the field and a seemingly ever-increasing amount of investment, we are still some years away from seeing a production quantum computer in action. However, it is possible to make some educated guesses about the operational difficulties and challenges that may be encountered in practice. We can be reasonably confident that the early machines will be hybrid, with the quantum devices used in an apparently similar way to current accelerators such as FPGAs or GPUs. Compilers, libraries and the other tools relied upon currently for development of software will have to evolve/be reinvented to support the new technology, and training courses will have to be rethought completely rather than just'' updated alongside them. The workloads we are likely to see making best use of these hybrid machines will initially be few, before rapidly increasing in diversity as we saw with the uptake of GPUs and other new technologies in the past. This will again be helped by the increase in the number of supporting libraries and development tools, and by the gradual re-development of existing software, to make use of the new quantum devices. Unfortunately, at present the problem of error correction is still largely unsolved, although there have been many advances. Quantum computation is very sensitive to noise, leading to frequent errors during execution. Quantum calculations, although asymptotically faster than their equivalents in
traditional'' HPC, still take time, and while the profiling tools and programming approaches will have to change drastically, many of the skills honed in the current HPC industry will not suddenly become obsolete, but continue to be useful in the quantum era.
- Bringing quantum acceleration to supercomputers. https://www.quantum.lrz.de/fileadmin/QIC/Downloads/IQM_HPC-QC-Integration-Whitepaper.pdf, 2022.
- Improvements to quantum search techniques for block-ciphers, with applications to AES. In Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers 27, pages 360–384. Springer, 2021.
- Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
- Austin G. Fowler. Time-optimal quantum computation. https://arxiv.org/abs/1210.4626, 2013.
- Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86:032324, Sep 2012.
- Flexible layout of surface code computations using AutoCCZ states, 2019.
- Experimental study of Shor’s factoring algorithm using the IBM Q Experience. Phys. Rev. A, 100:012305, Jul 2019.
- One electron-based smallest flexible logic cell. Applied Physics Letters, 101(18):183101, 2012.
- A variational eigenvalue solver on a photonic quantum processor. Nature communications, 5(1):4213, 2014.
- Digital zero noise extrapolation for quantum error mitigation. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 306–316. IEEE, 2020.
- Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors. Nature Physics, pages 1–6, 2023.
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor. Physical Review X, 11(4):041039, 2021.
- Quantum error correction for beginners. Reports on Progress in Physics, 76(7):076001, 2013.
- Applying quantum algorithms to constraint satisfaction problems. Quantum, 3:167, jul 2019.
- Stephen Jordan. Quantum algorithm zoo. https://quantumalgorithmzoo.org/, Apr 2011.
- An implementation of the general number field sieve. In Advances in Cryptology—CRYPTO’93: 13th Annual International Cryptology Conference Santa Barbara, California, USA August 22–26, 1993 Proceedings 13, pages 159–165. Springer, 1994.
- B.A. Murphy. Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm. PhD thesis, Australian National University, 1999.
- Resolving Large Prime(s) Variants for Discrete Logarithm Computation. In P.G. Farrell, editor, Proceedings 9th IMA Conf. Coding and Cryptography, pages 207–222, 2003.
- D. Coppersmith. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comp., 62:333–350, 1994.
- E. Thomé. Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. J. Symbolic Comp., 33:757–775, 2002.
- P.W. Shor. Polynomial time algorithms for discrete logarithms and factoring on a quantum computer. In Proceedings 1st Algorithmic Number Theory Symposium, pages 289–289, 1994.
- Experimental realization of Shor’s quantum factoring algorithm using qubit recycling. Nature Photonics, 6:773–776, 2012.
- Pretending to factor large numbers on a quantum computer. https://arxiv.org/pdf/1301.7007.pdf, 2012.
- C. Gidney and M. Ekerå. How to factor 2048-bit RSA integers in 8 hours using 20 million noisy qubits. https://quantum-journal.org/papers/q-2021-04-15-433/pdf/, 2021.
- É. Gouzien and N. Sangouard. Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory. https://arxiv.org/abs/2103.06159, 2021.
- Estimation of Shor’s Circuit for 2048-bit Integers based on Quantum Simulator. https://eprint.iacr.org/2023/092, 2023.
- A low-resource quantum factoring algorithm. In Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings, pages 330–346. Springer, 2017.
- Accelerating HPC with quantum computing: It is a software challenge too. Computing in Science & Engineering, 24(4):60–64, 2022.
- M. Thorne. Shor’s Algorithm in Superposition and the Comparison of Resources used by Two Different Quantum Algorithms for Factoring Large Numbers. Master’s thesis, University of Bath, 2020.
- S. Aaronson. Introduction to Quantum Information Science: Lecture Notes. https://www.scottaaronson.com/qclec.pdf, 2021.
- Tight bounds on quantum searching. Fortschritte der Physik: Progress of Physics, 46:493–505, 1998.
- Message Passing Interface Forum. MPI: A Message-Passing Interface Standard Version 4.0, Jun 2021.
- UPC Language and Library Specifications, Version 1.3, 11 2013.
- James Dargan. Top 5 quantum programming languages in 2022. https://thequantuminsider.com/2022/07/28/state-of-quantum-computing-programming-languages-in-2022/, 2022.
- Qiskit contributors. Qiskit: An open-source framework for quantum computing. https://qiskit.org/, 2023.
- qsim optimized quantum circuit simulator. https://quantumai.google/qsim.
- Software tools for quantum control: improving quantum computer performance through noise and error suppression. Quantum Science and Technology, 6(4):044011, sep 2021.
- Riverlane Ltd. Riverlane products: Deltaflow.OS, the operating system for quantum computers. https://www.riverlane.com/products/overview.
- Building logical qubits in a superconducting quantum computing system. npj quantum information, 3(1):2, 2017.
- The TOP500 list. https://top500.org/, 1993.
- Estimating energy-efficiency in quantum optimization algorithms. In Cray User Group Conference Proceedings, 2023.
- Improving energy efficiency on ARCHER2. https://cug.org/proceedings/protected/cug2023_proceedings/includes/files/pres112s2.pdf, 2023.