---
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-04-11T06:13:53.492Z"
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-04-11

## Top Publications

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

### 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,039
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2087064593/llms.txt)

### Simulating physics with computers

- **Authors:** Richard P. Feynman
- **Journal:** International Journal of Theoretical Physics
- **Published:** 1982-06-01
- **DOI:** [10.1007/bf02650179](https://doi.org/10.1007/bf02650179)
- **Citations:** 7,427
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2179731956/llms.txt)

### Quantum Computing by an Optimal Control Algorithm for Unitary Transformations

- **Authors:** José P. Palao, Ronnie Kosloff
- **Journal:** Physical Review Letters
- **Published:** 2002-10-14
- **DOI:** [10.1103/physrevlett.89.188301](https://doi.org/10.1103/physrevlett.89.188301)
- **Citations:** 341
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/quant-ph/0204101)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2036795049/llms.txt)

> Quantum computation is based on implementing selected unitary transformations representing algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is independent of the physical implementation of the quantum computer and it is illustrated for one and two qubit gates in model molecular systems, where only ...

### Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing

- **Authors:** Yiğit Subaşı, Rolando D. Somma, Davide Orsucci
- **Journal:** Physical Review Letters
- **Published:** 2019-02-14
- **DOI:** [10.1103/physrevlett.122.060504](https://doi.org/10.1103/physrevlett.122.060504)
- **Citations:** 182
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/1805.10549)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2902420940/llms.txt)

> We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations Ax[over →]=b[over →]. The time complexities of our algorithms are O(κ^{2}log(κ)/ε) and O(κlog(κ)/ε), where κ is the condition number of A and ε is the precision. Both algorithms are...

### 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:** 165
- **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:** 161
- **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:** 153
- **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)

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

### Rodeo Algorithm for Quantum Computing

- **Authors:** Kenneth Choi, Dean Lee, Joey Bonitati, Zhengrong Qian, J. Watkins
- **Journal:** Physical Review Letters
- **Published:** 2021-07-23
- **DOI:** [10.1103/physrevlett.127.040505](https://doi.org/10.1103/physrevlett.127.040505)
- **Citations:** 93
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/2009.04092)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3083864651/llms.txt)

> We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval [E-ε,E+ε]. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as O[|logδ|/(pε)], where p is the squared overlap of the initial state with the target eigenvector. The method, ...

### Quantum computing algorithms: getting closer to critical problems in computational biology

- **Authors:** Laura Marchetti, Riccardo Nifosı̀, Pier Luigi Martelli, Eleonora Da Pozzo, Valentina Cappello, Francesco Banterle, Maria Letizia Trincavelli, Claudia Martini, Massimo D’Elia
- **Journal:** Briefings in Bioinformatics
- **Published:** 2022-10-11
- **DOI:** [10.1093/bib/bbac437](https://doi.org/10.1093/bib/bbac437)
- **Citations:** 45
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://academic.oup.com/bib/article-pdf/23/6/bbac437/49567401/bbac437.pdf)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W4304587339/llms.txt)

> The recent biotechnological progress has allowed life scientists and physicians to access an unprecedented, massive amount of data at all levels (molecular, supramolecular, cellular and so on) of biological complexity. So far, mostly classical computational efforts have been dedicated to the simulation, prediction or de novo design of biomolecules, in order to improve the understanding of their fu...

### Efficiency of open quantum walk implementation of dissipative quantum computing algorithms

- **Authors:** Ilya Sinayskiy, Francesco Petruccione
- **Journal:** Quantum Information Processing
- **Published:** 2012-05-31
- **DOI:** [10.1007/s11128-012-0426-3](https://doi.org/10.1007/s11128-012-0426-3)
- **Citations:** 44
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://arxiv.org/pdf/1401.6658)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2045586686/llms.txt)

### Towards a quantum computing algorithm for helicity amplitudes and parton showers

- **Authors:** Khadeejah Bepari, Sarah Malik, Michael Spannowsky, Simon Williams
- **Journal:** Physical review. D/Physical review. D.
- **Published:** 2021-04-26
- **DOI:** [10.1103/physrevd.103.076020](https://doi.org/10.1103/physrevd.103.076020)
- **Citations:** 40
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](http://link.aps.org/pdf/10.1103/PhysRevD.103.076020)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3089712125/llms.txt)

> The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators, which include the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum that computers can provide. We propose general and extendable al...

### Real-Time Krylov Theory for Quantum Computing Algorithms

- **Authors:** Yizhi Shen, Katherine Klymko, James Sud, David B. Williams‐Young, Wibe A. de Jong, Norm M. Tubman
- **Journal:** Quantum
- **Published:** 2023-07-25
- **DOI:** [10.22331/q-2023-07-25-1066](https://doi.org/10.22331/q-2023-07-25-1066)
- **Citations:** 29
- **Source:** OpenAlex
- **Access:** Open Access
- **PDF:** [Download](https://quantum-journal.org/papers/q-2023-07-25-1066/pdf/)
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W4385255027/llms.txt)

> Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum ph...

### Quantum computing algorithm for electromagnetic field simulation

- **Authors:** Siddhartha Sinha, P. Russer
- **Journal:** Quantum Information Processing
- **Published:** 2009-10-01
- **DOI:** [10.1007/s11128-009-0133-x](https://doi.org/10.1007/s11128-009-0133-x)
- **Citations:** 25
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2018051891/llms.txt)

### Towards Security of Cyber-Physical Systems using Quantum Computing Algorithms

- **Authors:** Deepak K. Tosh, Oscar Galindo, Владик Крейнович, Olga Kosheleva
- **Published:** 2020-06-01
- **DOI:** [10.1109/sose50414.2020.9130525](https://doi.org/10.1109/sose50414.2020.9130525)
- **Citations:** 24
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W3039932055/llms.txt)

> For cyber-physical systems (CPS), ensuring process and data security is critically important since the corresponding infrastructure needs to have high operational efficiency with no downtime. There are many techniques available that make communications in CPS environments secure – such as enabling traffic encryption between sensors and the computers processing the sensor’s data, incorporating mess...

### Using quantum computing algorithms in future satellite communication

- **Authors:** László Bacsárdi
- **Journal:** Acta Astronautica
- **Published:** 2005-06-02
- **DOI:** [10.1016/j.actaastro.2005.03.023](https://doi.org/10.1016/j.actaastro.2005.03.023)
- **Citations:** 20
- **Source:** OpenAlex
- **llms.txt:** [View](https://science-database.com/technology/quantum-computing/paper/oa-W2000293899/llms.txt)

---

*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)*