Quantum algorithm
A quantum algorithm is a computational procedure designed to run on a quantum computer and exploit quantum-mechanical states or operations.
Quantum Programming in Depth
A quantum algorithm is a computational procedure designed to run on a quantum computer and exploit quantum-mechanical operations or information.
- How it is used
- Frames quantum algorithms as specialized procedures for solving structured, computationally demanding problems on quantum computers.
- How deep it goes
- Explains problem structure, asymptotic speedups, implementation costs, and software workflows, while deferring mature practical advantage.
- Examples
- Uses Shor’s factorization, Grover’s search, quantum-system simulation, and introductory programming projects implemented with Qiskit and Q#.
- What you can do after
- Evaluate candidate algorithms by comparing exploitable structure, complexity, implementation costs, and classical baselines.
Read how Quantum Programming in Depth explains quantum algorithm →
Real-World Cryptography
A quantum algorithm is a computational procedure designed to execute on a quantum computer and exploit quantum-mechanical effects.
- How it is used
- Frames quantum algorithms as specialized procedures and as a threat to deployed public-key cryptography.
- How deep it goes
- Explains qubits and quantum operations, then works through period finding without presenting implementation details or formal proofs.
- Examples
- Uses Shor’s algorithm, period finding, RSA, Diffie–Hellman, and a stored-ciphertext confidentiality scenario.
- What you can do after
- Evaluate how quantum algorithms affect RSA, Diffie–Hellman, elliptic-curve cryptography, and long-term confidentiality.
Read how Real-World Cryptography explains quantum algorithm →
Related concepts
- Grover's algorithmincludes · Grover's algorithm is a quantum search algorithm that finds a marked item in an unstructured search space with a quadratic speedup over classical exhaustive search.
- resource estimationmeasured by · Resource estimation is the analysis or prediction of the computational, storage, runtime, or infrastructure resources required by a workload, program, or algorithm.
- knapsack problemaddresses · The knapsack problem is an optimization problem that selects items subject to a capacity constraint to maximize their combined value.
- Shor's algorithmincludes · Shor's algorithm is a quantum algorithm that efficiently factors integers and solves discrete logarithms using quantum period finding.
- quantum computinghas part · Quantum computing is computation that represents and processes information using quantum-mechanical states and operations.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.