National Quantum Fault Lines
DOI:
https://doi.org/10.5281/zenodo.20570507Keywords:
Quantum Supremacy Strategies, National Quantum Architectures, Capability Benchmarking, Implementation Timelines, Investment Priorities, Evidence-Based Assessment, Quantum Funding Landscapes, Talent Pipelines, Research Infrastructure, Architectural Gaps, Strategic Leverage Points, Development Policy Implications, Governance Frameworks, Global Quantum Competition, National Competitiveness, Stakeholder Ecosystems, Long-Term Quantum Initiatives, Comparative Policy Analysis, Technology Sovereignty, Strategic Feasibility.Abstract
The national strategic architectures for quantum-supremacy attainment are mapped and compared in terms of capabilities, implementation timelines, and investment priorities. Supporting-evidence assessment spans funding, talent, infrastructure, and other inputs, yielding architectural gaps and leverage points of national and international significance. Analysis highlights implications for development policy and governance.
The United States, European Union, China, and several others have articulated major, long-term quantum-supremacy initiatives. The commitment scale, expected utility, key stakeholders, and supporting trajectory differ significantly among actors. Quantifying funding, talent, and supporting frameworks clarifies the feasibility and fit of quantum architectures in a broader national-competitiveness context.
References
[1] Arute, F., Arya, K., Babbush, R., et al. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574(7779), 505–510.
[2] Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79.
[3] Harrow, A. W., & Montanaro, A. (2017). Quantum computational supremacy. Nature, 549(7671), 203–209.
[4] Boixo, S., Isakov, S. V., Smelyanskiy, V. N., et al. (2018). Characterizing quantum supremacy in near-term devices. Nature Physics, 14(6), 595–600.
[5] Aaronson, S., & Chen, L. (2017). Complexity-theoretic foundations of quantum supremacy experiments. Proceedings of the 32nd Computational Complexity Conference, 22:1–22:67.
[6] IBM Quantum Team. (2020). Quantum volume as a holistic benchmark for quantum computers. IBM Journal of Research and Development, 64(4/5), 1–11.
[7] Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019). Validating quantum computers using randomized model circuits. Physical Review A, 100(3), 032328.
[8] Monroe, C., Campbell, W. C., Duan, L. M., et al. (2021). Programmable quantum simulations of spin systems with trapped ions. Reviews of Modern Physics, 93(2), 025001.
[9] Devoret, M. H., & Schoelkopf, R. J. (2013). Superconducting circuits for quantum information. Science, 339(6124), 1169–1174.
[10] Kjaergaard, M., Schwartz, M. E., Braumüller, J., et al. (2020). Superconducting qubits: Current state of play. Annual Review of Condensed Matter Physics, 11, 369–395.
[11] Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019). Trapped-ion quantum computing: Progress and challenges. Applied Physics Reviews, 6(2), 021314.
[12] Awschalom, D. D., Hanson, R., Wrachtrup, J., & Zhou, B. B. (2018). Quantum technologies with optically interfaced solid-state spins. Nature Photonics, 12(9), 516–527.
[13] Wang, J., Sciarrino, F., Laing, A., & Thompson, M. G. (2020). Integrated photonic quantum technologies. Nature Photonics, 14(5), 273–284.
[14] Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3), 032324.
[15] Terhal, B. M. (2015). Quantum error correction for quantum memories. Reviews of Modern Physics, 87(2), 307–346.
[16] Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017). Roads towards fault-tolerant universal quantum computation. Nature, 549(7671), 172–179.
[17] Bharti, K., Cervera-Lierta, A., Kyaw, T. H., et al. (2022). Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics, 94(1), 015004.
[18] Dalzell, A. M., Harrow, A. W., Koh, D. E., & Laumann, C. R. (2020). How many qubits are needed for quantum computational supremacy? Physical Review Letters, 124(22), 220501.
[19] Neill, C., Roushan, P., Kechedzhi, K., et al. (2018). A blueprint for demonstrating quantum supremacy with superconducting qubits. Science, 360(6385), 195–199.
[20] Biamonte, J., Wittek, P., Pancotti, N., et al. (2017). Quantum machine learning. Nature, 549(7671), 195–202.
[21] National Academies of Sciences, Engineering, and Medicine. (2019). Quantum computing: Progress and prospects. National Academies Press.
[22] Acín, A., Bloch, I., Buhrman, H., et al. (2018). The quantum technologies roadmap. New Journal of Physics, 20(8), 080201.
[23] European Commission. (2021). Strategic research agenda for quantum technologies. Publications Office of the European Union.
[24] Preskill, J. (2022). Quantum advantage and the NISQ frontier. arXiv Quantum Physics Review Series, 1, 1–15.
[25] Linke, N. M., Maslov, D., Roetteler, M., et al. (2017). Experimental comparison of two quantum computing architectures. Proceedings of the National Academy of Sciences, 114(13), 3305–3310.
[26] Foxen, B., Mutus, J. Y., Yao, N. Y., et al. (2020). Demonstrating a continuous error correction scheme. Nature, 586(7829), 40–44.
[27] Gambetta, J. M., Chow, J. M., & Steffen, M. (2017). Building logical qubits in a superconducting quantum computing system. npj Quantum Information, 3, 2.
[28] Egan, L., Debroy, D. M., Noel, T., et al. (2021). Fault-tolerant control of an error-corrected qubit. Nature, 598(7880), 281–286.
[29] Córcoles, A. D., Kandala, A., Javadi-Abhari, A., et al. (2019). Challenges and opportunities of near-term quantum computing systems. Proceedings of the IEEE, 108(8), 1338–1352.
[30] Gottesman, D. (2009). An introduction to quantum error correction and fault-tolerant quantum computation. Proceedings of Symposia in Applied Mathematics, 68, 13–58.
[31] Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509.
[32] Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 212–219.
[33] Huang, H. Y., Kueng, R., & Preskill, J. (2020). Predicting many properties of a quantum system from very few measurements. Nature Physics, 16(10), 1050–1057.
[34] Martinis, J. M. (2015). Qubit metrology for building a fault-tolerant quantum computer. npj Quantum Information, 1, 15005.
[35] Deutsch, D. (1985). Quantum theory, the Church–Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400(1818), 97–117.
Additional Files
Published
Data Availability Statement
None
Issue
Section
License
This work is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0). Authors retain full copyright of their published work. Under this license, others are free to share, copy, distribute, transmit, remix, transform, and build upon the published work for any purpose, including commercial use, provided that appropriate credit is given to the original authors, a link to the license is provided, and any changes made are clearly indicated. No additional restrictions may be applied that limit others from doing anything the license permits. All published articles are freely and permanently accessible online to readers worldwide without any subscription or access fees.
License URL: https://creativecommons.org/licenses/by/4.0/
