{"technology":{"slug":"quantum-computing","name":"Quantum Computing","description":"Quantum computation, quantum algorithms, and quantum hardware. Includes quantum error correction, quantum supremacy experiments, and practical quantum applications.","discipline":"Physics / Computer Science","icon":"⚛️"},"lastUpdated":"2026-07-21T05:30:36.546Z","articleCount":15,"articles":[{"id":"oa-W2120145199","title":"QUANTUM ESPRESSO: a modular and open-source software project for quantum simulations of materials","authors":"Paolo Giannozzi, Stefano Baroni, Nicola Bonini, Matteo Calandra, Roberto Car, Carlo Cavazzoni, Davide Ceresoli, G. Chiarotti, Matteo Cococcioni, Ismaïla Dabo, Andrea Dal Corso, Stefano de Gironcoli, Stefano Fabris, Guido Fratesi, Ralph Gebauer, U. Gerstmann, Christos Gougoussis, Anton Kokalj, Michele Lazzeri, Layla Martin‐Samos, Nicola Marzari, Francesco Mauri, Riccardo Mazzarello, Stefano Paolini, Alfredo Pasquarello, Lorenzo Paulatto, Carlo Sbraccia, Sandro Scandolo, Gabriele Sclauzero, Ari P. Seitsonen, Alexander Smogunov, Paolo Umari, Renata M. Wentzcovitch","journal":"Journal of Physics Condensed Matter","pubDate":"2009-09-01","doi":"10.1088/0953-8984/21/39/395502","abstract":"QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, and projector-augmented wave). The acronym ESPRESSO stands for opEn Source Package for Research in Electronic Structure, Simulation, and Optimization. It is freely available to researchers around the world under the terms of the GNU General Public License. QUANTUM ESPRESSO builds upon newly-restructured electronic-structure codes that have been developed and tested by some of the original authors of novel electronic-structure algorithms and applied in the last twenty years by some of the leading materials modeling groups worldwide. Innovation and efficiency are still its main focus, with special attention paid to massively parallel architectures, and a great effort being devoted to user friendliness. QUANTUM ESPRESSO is evolving towards a distribution of independent and interoperable codes in the spirit of an open-source project, where researchers active in the field of electronic-structure calculations are encouraged to participate in the project by contributing their own codes or by implementing their own ideas into existing codes.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2120145199","citationCount":28958,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/0906.2569"},{"id":"oa-W2087064593","title":"Identification of common molecular subsequences","authors":"Temple F. Smith, Michael S. Waterman","journal":"Journal of Molecular Biology","pubDate":"1981-03-01","doi":"10.1016/0022-2836(81)90087-5","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2087064593","citationCount":10102,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W2084652510","title":"A fast quantum mechanical algorithm for database search","authors":"Lov K. Grover","journal":"","pubDate":"1996-01-01","doi":"10.1145/237814.237866","abstract":"An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) steps since on the average it will have to examine a large fraction of the N records. Quantum mechanical systems can do several operations simultaneously due to their wave like properties. This paper gives an O ( JN) step quantum mechanical algorithm for identifying that record. It is within a constant factor of the fastest possible quantum mechanical algorithm.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2084652510","citationCount":8675,"isOpenAccess":true,"pdfUrl":"https://dl.acm.org/doi/pdf/10.1145/237814.237866"},{"id":"oa-W3038067977","title":"Quantum cryptography","authors":"Nicolas Gisin, G. Ribordy, Wolfgang Tittel, Hugo Zbinden","journal":"Reviews of Modern Physics","pubDate":"2002-03-08","doi":"10.1103/revmodphys.74.145","abstract":"Quantum cryptography could well be the first application of quantum mechanics at the single-quantum level. The rapid progress in both theory and experiment in recent years is reviewed, with emphasis on open questions and technological issues.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3038067977","citationCount":8405,"isOpenAccess":true,"pdfUrl":"http://link.aps.org/pdf/10.1103/RevModPhys.74.145"},{"id":"oa-W2781738013","title":"Quantum Computing in the NISQ era and beyond","authors":"John Preskill","journal":"Quantum","pubDate":"2018-08-06","doi":"10.22331/q-2018-08-06-79","abstract":"Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2781738013","citationCount":8371,"isOpenAccess":true,"pdfUrl":"https://quantum-journal.org/papers/q-2018-08-06-79/pdf/"},{"id":"oa-W2982169647","title":"Quantum supremacy using a programmable superconducting processor","authors":"Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, Austin Fowler, Craig Gidney, Marissa Giustina, Rob Graff, Keith Guerin, Steve Habegger, Matthew P. Harrigan, Michael J. Hartmann, Alan Ho, Markus Hoffmann, Trent Huang, Travis S. Humble, Sergei V. Isakov, Evan Jeffrey, Zhang Jiang, Dvir Kafri, Kostyantyn Kechedzhi, Julian Kelly, Paul V. Klimov, Sergey Knysh, Alexander Korotkov, Fedor Kostritsa, David Landhuis, Mike Lindmark, Erik Lucero, Dmitry Lyakh, Salvatore Mandrà, Jarrod R. McClean, Matthew McEwen, Anthony Megrant, Xiao Mi, Kristel Michielsen, Masoud Mohseni, Josh Mutus, Ofer Naaman, Matthew Neeley, Charles Neill, Murphy Yuezhen Niu, Eric Ostby, Andre Petukhov, John C. Platt, Chris Quintana, Eleanor G. Rieffel, Pedram Roushan, Nicholas C. Rubin, Daniel Sank, Kevin J. Satzinger, Vadim Smelyanskiy, Kevin J. Sung, Matthew D. Trevithick, Amit Vainsencher, Benjamin Villalonga, Theodore White, Z. Jamie Yao, Ping Yeh, Adam Zalcman, Hartmut Neven, John M. Martinis","journal":"Nature","pubDate":"2019-10-23","doi":"10.1038/s41586-019-1666-5","abstract":"The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2982169647","citationCount":7056,"isOpenAccess":true,"pdfUrl":"https://www.nature.com/articles/s41586-019-1666-5.pdf"},{"id":"oa-W2103282498","title":"Quantum computation with quantum dots","authors":"Daniel Loss, David P. DiVincenzo","journal":"Physical Review A","pubDate":"1998-01-01","doi":"10.1103/physreva.57.120","abstract":"We propose an implementation of a universal set of one- and two-quantum-bit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier between neighboring dots. Several measures of the gate quality are computed within a recently derived spin master equation incorporating decoherence caused by a prototypical magnetic environment. Dot-array experiments that would provide an initial demonstration of the desired nonequilibrium spin dynamics are proposed.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2103282498","citationCount":6837,"isOpenAccess":true,"pdfUrl":"http://link.aps.org/pdf/10.1103/PhysRevA.57.120"},{"id":"oa-W3023478445","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","authors":"Peter W. Shor","journal":"SIAM Journal on Computing","pubDate":"1997-10-01","doi":"10.1137/s0097539795293172","abstract":"A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3023478445","citationCount":5909,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W2137147061","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","authors":"Peter W. Shor","journal":"SIAM Review","pubDate":"1999-01-01","doi":"10.1137/s0036144598347011","abstract":". A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored. Key words. algorithmic number theory, prime factorization, discrete logarithms, Church's thesis, quantum computers, foundations of quantum mechanics, spin systems, Fourier transforms AMS subject classifications. 81P10, 11Y05, 68Q10, 03D10 1. I...","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2137147061","citationCount":3871,"isOpenAccess":false,"pdfUrl":""},{"id":"oa-W3111162498","title":"Variational quantum algorithms","authors":"M. Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, Patrick J. Coles","journal":"Nature Reviews Physics","pubDate":"2021-08-12","doi":"10.1038/s42254-021-00348-9","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3111162498","citationCount":3051,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/2012.09265"},{"id":"oa-W1823409394","title":"Quantum computing in molecular magnets","authors":"Michael N. Leuenberger, Daniel Loss","journal":"Nature","pubDate":"2001-04-01","doi":"10.1038/35071024","abstract":"","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W1823409394","citationCount":2989,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/cond-mat/0011415"},{"id":"oa-W2906538035","title":"Quantum Chemistry in the Age of Quantum Computing","authors":"Yudong Cao, Jonathan Romero, Jonathan P. Olson, Matthias Degroote, Peter D. Johnson, Mária Kieferová, Ian D. Kivlichan, Tim Menke, Borja Peropadre, Nicolas P. D. Sawaya, Sukin Sim, Libor Veis, Alán Aspuru-Guzik","journal":"Chemical Reviews","pubDate":"2019-08-30","doi":"10.1021/acs.chemrev.8b00803","abstract":"Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced, the complexity of quantum mechanics remains hard to appease. The advent of quantum computation brings new pathways to navigate this challenging and complex landscape. By manipulating quantum states of matter and taking advantage of their unique features such as superposition and entanglement, quantum computers promise to efficiently deliver accurate results for many important problems in quantum chemistry, such as the electronic structure of molecules. In the past two decades, significant advances have been made in developing algorithms and physical hardware for quantum computing, heralding a revolution in simulation of quantum systems. This Review provides an overview of the algorithms and results that are relevant for quantum chemistry. The intended audience is both quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2906538035","citationCount":1443,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/1812.09976"},{"id":"oa-W3198799154","title":"Emerging quantum computing algorithms for quantum chemistry","authors":"Mário Motta, Julia E. Rice","journal":"Wiley Interdisciplinary Reviews Computational Molecular Science","pubDate":"2021-12-08","doi":"10.1002/wcms.1580","abstract":"Abstract Digital quantum computers provide a computational framework for solving the Schrödinger equation for a variety of many‐particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self‐contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molecular systems. Theoretical foundations and implementation details of the method are discussed, and their strengths, limitations, and recent advances are presented. This article is categorized under: Quantum Computing > Algorithms Electronic Structure Theory > Ab Initio Electronic Structure Methods Quantum Computing > Theory Development","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W3198799154","citationCount":172,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/2109.02873"},{"id":"oa-W2036245140","title":"Experimental Application of Decoherence-Free Subspaces in an Optical Quantum-Computing Algorithm","authors":"Masoud Mohseni, Jeff S. Lundeen, Katharina Resch, Aephraim M. Steinberg","journal":"Physical Review Letters","pubDate":"2003-10-31","doi":"10.1103/physrevlett.91.187903","abstract":"For a practical quantum computer to operate, it is essential to properly manage decoherence. One important technique for doing this is the use of \"decoherence-free subspaces\" (DFSs), which have recently been demonstrated. Here we present the first use of DFSs to improve the performance of a quantum algorithm. An optical implementation of the Deutsch-Jozsa algorithm can be made insensitive to a particular class of phase noise by encoding information in the appropriate subspaces; we observe a reduction of the error rate from 35% to 7%, essentially its value in the absence of noise.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W2036245140","citationCount":161,"isOpenAccess":true,"pdfUrl":"https://arxiv.org/pdf/quant-ph/0212134"},{"id":"oa-W1545025828","title":"An Introduction to Quantum Computing Algorithms","authors":"A. O. Pittenger","journal":"Birkhäuser Boston eBooks","pubDate":"2000-01-01","doi":"10.1007/978-1-4612-1390-1","abstract":"In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of \"quantum machines\" one could imitate any quantum system.","tldr":"","source":"OpenAlex","sourceUrl":"https://openalex.org/W1545025828","citationCount":154,"isOpenAccess":true,"pdfUrl":"https://link.springer.com/content/pdf/bfm:978-1-4612-1390-1/1?pdf=chapter%20toc"}],"links":{"web":"https://science-database.com/technology/quantum-computing","llms_txt":"https://science-database.com/technology/quantum-computing/llms.txt","api":"https://science-database.com/api/v1/technology/quantum-computing"}}