Skip to main content Accessibility help
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 5 - Quantum Computation: Algorithms

  • Yidun Wan, Fudan University, Shanghai
  • Book:
    Quantum Computing Unveiled
    Published online:
    27 February 2026
    Print publication:
    19 March 2026, pp 132-159

  • Summary

    This chapter introduces seminal quantum algorithms that illustrate quantum computation’s efficiency over classical methods. The Deutsch and Deutsch–Jozsa algorithms showcase quantum parallelism, offering solutions to specific problems with fewer computational steps. The quantum Fourier transform (QFT) is introduced, underpinning period-finding algorithms as well as Shor’s algorithm for integer factorization, which has major implications for cryptography. Grover’s algorithm demonstrates a quadratic speedup for unstructured search problems. By using superposition, entanglement, and phase manipulation, these algorithms highlight the computational power of quantum mechanics and its potential to outperform classical techniques, particularly for complex or classically intractable tasks.