---
title: "Quantum Computing"
slug: "quantum-computing"
discipline: "Physics / Computer Science"
description: "Quantum computation, quantum algorithms, and quantum hardware. Includes quantum error correction, quantum supremacy experiments, and practical quantum applications."
icon: "⚛️"
url: "https://science-database.com/technology/quantum-computing"
api: "https://science-database.com/api/v1/technology/quantum-computing"
llms_txt: "https://science-database.com/technology/quantum-computing/llms.txt"
articles_indexed: 15
last_updated: "2026-09-08T05:19:30.050Z"
search_terms:
  - "quantum computing algorithm"
  - "quantum error correction"
  - "quantum supremacy advantage"
source: "science-database.com"
license: "metadata CC0, abstracts belong to respective publishers"
---

# Quantum Computing

Quantum computation, quantum algorithms, and quantum hardware. Includes quantum error correction, quantum supremacy experiments, and practical quantum applications.

**Discipline:** Physics / Computer Science  
**Indexed Papers:** 15  
**Last Updated:** 2026-09-08

## Top Publications

Ranked by citation impact across Semantic Scholar, OpenAlex & arXiv.

### 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
- **Published:** 2009-09-01
- **DOI:** [10.1088/0953-8984/21/39/395502](https://doi.org/10.1088/0953-8984/21/39/395502)
- **Citations:** 29,303
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://iopscience.iop.org/article/10.1088/0953-8984/21/39/395502/pdf)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2120145199/llms.txt)

> 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 rese...

### Identification of common molecular subsequences

- **Authors:** Temple F. Smith, Michael S. Waterman
- **Journal:** Journal of Molecular Biology
- **Published:** 1981-03-01
- **DOI:** [10.1016/0022-2836(81)90087-5](https://doi.org/10.1016/0022-2836(81)90087-5)
- **Citations:** 10,145
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2087064593/llms.txt)

### A fast quantum mechanical algorithm for database search

- **Authors:** Lov K. Grover
- **Published:** 1996-01-01
- **DOI:** [10.1145/237814.237866](https://doi.org/10.1145/237814.237866)
- **Citations:** 8,809
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://dl.acm.org/doi/pdf/10.1145/237814.237866)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2084652510/llms.txt)

> 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 propertie...

### Quantum Computing in the NISQ era and beyond

- **Authors:** John Preskill
- **Journal:** Quantum
- **Published:** 2018-08-06
- **DOI:** [10.22331/q-2018-08-06-79](https://doi.org/10.22331/q-2018-08-06-79)
- **Citations:** 8,683
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://quantum-journal.org/papers/q-2018-08-06-79/pdf/)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2781738013/llms.txt)

> 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, a...

### Quantum cryptography

- **Authors:** Nicolas Gisin, G. Ribordy, Wolfgang Tittel, Hugo Zbinden
- **Journal:** Reviews of Modern Physics
- **Published:** 2002-03-08
- **DOI:** [10.1103/revmodphys.74.145](https://doi.org/10.1103/revmodphys.74.145)
- **Citations:** 8,482
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](http://link.aps.org/pdf/10.1103/RevModPhys.74.145)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3038067977/llms.txt)

> 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.

### 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
- **Published:** 2019-10-23
- **DOI:** [10.1038/s41586-019-1666-5](https://doi.org/10.1038/s41586-019-1666-5)
- **Citations:** 7,185
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://www.nature.com/articles/s41586-019-1666-5.pdf)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2982169647/llms.txt)

> 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 creat...

### Quantum computation with quantum dots

- **Authors:** Daniel Loss, David P. DiVincenzo
- **Journal:** Physical Review A
- **Published:** 1998-01-01
- **DOI:** [10.1103/physreva.57.120](https://doi.org/10.1103/physreva.57.120)
- **Citations:** 6,882
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](http://link.aps.org/pdf/10.1103/PhysRevA.57.120)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2103282498/llms.txt)

> 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...

### Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

- **Authors:** Peter W. Shor
- **Journal:** SIAM Journal on Computing
- **Published:** 1997-10-01
- **DOI:** [10.1137/s0097539795293172](https://doi.org/10.1137/s0097539795293172)
- **Citations:** 6,017
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3023478445/llms.txt)

> 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 gen...

### Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

- **Authors:** Peter W. Shor
- **Journal:** SIAM Review
- **Published:** 1999-01-01
- **DOI:** [10.1137/s0036144598347011](https://doi.org/10.1137/s0036144598347011)
- **Citations:** 3,927
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2137147061/llms.txt)

> A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be 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 that ar...

### 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
- **Published:** 2021-08-12
- **DOI:** [10.1038/s42254-021-00348-9](https://doi.org/10.1038/s42254-021-00348-9)
- **Citations:** 3,233
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/2012.09265)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3111162498/llms.txt)

### Quantum computing in molecular magnets

- **Authors:** Michael N. Leuenberger, Daniel Loss
- **Journal:** Nature
- **Published:** 2001-04-01
- **DOI:** [10.1038/35071024](https://doi.org/10.1038/35071024)
- **Citations:** 3,002
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/cond-mat/0011415)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W1823409394/llms.txt)

### 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
- **Published:** 2019-08-30
- **DOI:** [10.1021/acs.chemrev.8b00803](https://doi.org/10.1021/acs.chemrev.8b00803)
- **Citations:** 1,487
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/1812.09976)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2906538035/llms.txt)

> 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 land...

### Emerging quantum computing algorithms for quantum chemistry

- **Authors:** Mário Motta, Julia E. Rice
- **Journal:** Wiley Interdisciplinary Reviews Computational Molecular Science
- **Published:** 2021-12-08
- **DOI:** [10.1002/wcms.1580](https://doi.org/10.1002/wcms.1580)
- **Citations:** 180
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/2109.02873)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3198799154/llms.txt)

> 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 ...

### 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
- **Published:** 2003-10-31
- **DOI:** [10.1103/physrevlett.91.187903](https://doi.org/10.1103/physrevlett.91.187903)
- **Citations:** 162
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/quant-ph/0212134)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2036245140/llms.txt)

> 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 par...

### An Introduction to Quantum Computing Algorithms

- **Authors:** A. O. Pittenger
- **Journal:** Birkhäuser Boston eBooks
- **Published:** 2000-01-01
- **DOI:** [10.1007/978-1-4612-1390-1](https://doi.org/10.1007/978-1-4612-1390-1)
- **Citations:** 154
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://link.springer.com/content/pdf/bfm:978-1-4612-1390-1/1?pdf=chapter%20toc)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W1545025828/llms.txt)

> An introduction to quantum computing algorithms / Arthur O

---

*Generated by [science-database.com](https://science-database.com) — The Knowledge Interface*  
*Full data available via [JSON API](https://science-database.com/api/v1/technology/quantum-computing)*