{"atlas":{"title":"Quantum Computing Atlas","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing","version":"0.1.0","claimsEndpoint":"https://research.mahastrategies.com/atlas/quantum-computing/claims.json"},"provenance":"Each listed record was resolved to a primary paper or authoritative public source during the review; source records explain role rather than endorse conclusions.","count":10,"sources":[{"id":"nasa-qis","title":"Quantum Information Science","authors":"NASA","year":2025,"identifier":"NASA QIS overview","url":"https://www.nasa.gov/quantum-information-science/","sourceType":"authoritative-report","verifiedOn":"2026-07-28","whyHere":"Authoritative public orientation on quantum information science and its research context.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/nasa-qis","citedByClaims":["qc-001"],"citedByConcepts":["qubit","quantum-circuit"]},{"id":"shor-1995","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","authors":"Peter W. Shor","year":1995,"identifier":"arXiv:quant-ph/9508027","url":"https://arxiv.org/abs/quant-ph/9508027","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Primary source for the factoring and discrete-logarithm algorithm.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/shor-1995","citedByClaims":["qc-006"],"citedByConcepts":["quantum-circuit","algorithm"]},{"id":"grover-1996","title":"A Fast Quantum Mechanical Algorithm for Database Search","authors":"Lov K. Grover","year":1996,"identifier":"arXiv:quant-ph/9605043","url":"https://arxiv.org/abs/quant-ph/9605043","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Primary source for amplitude-amplification search.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/grover-1996","citedByClaims":["qc-007"],"citedByConcepts":["algorithm"]},{"id":"feynman-1982","title":"Simulating physics with computers","authors":"Richard P. Feynman","year":1982,"identifier":"DOI:10.1007/BF02650179","url":"https://doi.org/10.1007/BF02650179","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Foundational source for quantum simulation as a motivation for quantum computation.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/feynman-1982","citedByClaims":["qc-008"],"citedByConcepts":["quantum-simulation"]},{"id":"preskill-2018","title":"Quantum Computing in the NISQ era and beyond","authors":"John Preskill","year":2018,"identifier":"arXiv:1801.00862","url":"https://arxiv.org/abs/1801.00862","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Defines the NISQ framing and its limitations.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/preskill-2018","citedByClaims":["qc-003","qc-010","qc-012"],"citedByConcepts":["noise","nisq","near-term-applications"]},{"id":"fowler-2012","title":"Surface codes: Towards practical large-scale quantum computation","authors":"Austin G. Fowler et al.","year":2012,"identifier":"arXiv:1208.0928","url":"https://arxiv.org/abs/1208.0928","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Primary technical overview of surface-code fault tolerance.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/fowler-2012","citedByClaims":["qc-004","qc-011"],"citedByConcepts":["noise","error-correction","surface-code","fault-tolerance","resource-estimation"]},{"id":"google-qec-2025","title":"Quantum error correction below the surface code threshold","authors":"Google Quantum AI and collaborators","year":2025,"identifier":"DOI:10.1038/s41586-024-08449-y","url":"https://doi.org/10.1038/s41586-024-08449-y","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Experimental report of below-threshold surface-code memories; it does not demonstrate a general-purpose fault-tolerant computer.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/google-qec-2025","citedByClaims":["qc-004","qc-005"],"citedByConcepts":["error-correction","surface-code"]},{"id":"arute-2019","title":"Quantum supremacy using a programmable superconducting processor","authors":"Frank Arute et al.","year":2019,"identifier":"DOI:10.1038/s41586-019-1666-5","url":"https://doi.org/10.1038/s41586-019-1666-5","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Experimental demonstration of random-circuit sampling on a superconducting processor.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/arute-2019","citedByClaims":["qc-009"],"citedByConcepts":[]},{"id":"bruzewicz-2019","title":"Trapped-ion quantum computing: Progress and challenges","authors":"Colin D. Bruzewicz et al.","year":2019,"identifier":"DOI:10.1063/1.5088164","url":"https://doi.org/10.1063/1.5088164","sourceType":"primary-paper","verifiedOn":"2026-07-28","whyHere":"Peer-reviewed review of trapped-ion hardware and its challenges.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/bruzewicz-2019","citedByClaims":["qc-002"],"citedByConcepts":["hardware-modality"]},{"id":"doe-roadmap-2024","title":"Quantum Information Science and Technology Roadmap","authors":"U.S. Department of Energy","year":2024,"identifier":"DOE QIS roadmap","url":"https://www.quantum.gov/wp-content/uploads/2024/12/DOE_QIS_Roadmap_Final.pdf","sourceType":"authoritative-report","verifiedOn":"2026-07-28","whyHere":"Authoritative systems-level account of hardware, algorithms, error correction, and applications.","canonicalUrl":"https://research.mahastrategies.com/atlas/quantum-computing/sources/doe-roadmap-2024","citedByClaims":["qc-002","qc-008","qc-010","qc-011","qc-012"],"citedByConcepts":["qubit","hardware-modality","fault-tolerance","quantum-simulation","resource-estimation","near-term-applications"]}]}