Library

Topics

A topic page is an orientation. The first three are stubs: they name the problem area, point at the algorithms this library actually covers, and stop before pretending to be a survey.

Quantum algorithms is the guide. The complexity table is the row-by-row comparison.

• StubChemistryElectronic ground-state energies as a quantum-computing problem: phase estimation in theory, VQE in short-depth experiments, and the costs the papers analyze.
• StubCryptographyWhich cryptosystems Shor's algorithm and Grover's algorithm actually speak to, and which conclusions a complexity bound does not license.
• StubLinear systemsSparse linear systems as they appear in this library: a quantum state from HHL, a later logarithmic dependence on precision, and a classical algorithm for a different low-rank access model.
• StubOptimizationCombinatorial optimization as it appears in this library: an approximation ratio for QAOA, a quadratic black-box search, and the classical algorithms beside them.