REVIEW 3 cited by
A typology of quantum algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A typology of quantum algorithms
read the original abstract
We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world applications, the main subroutines they employ, and several other relevant criteria. The primary objectives include revealing trends of algorithms, identifying promising fields for implementations in the NISQ era, and identifying the key algorithmic primitives that power quantum advantage.
Forward citations
Cited by 3 Pith papers
-
Phase Estimation with Compressed Controlled Time Evolution
A compression protocol for controlled time evolution of local translationally invariant Hamiltonians achieves O(t polylog(t N/ε)) circuit depth with additive control overhead, demonstrated via 414 CNOT gates for itera...
-
Robust Mutation Analysis of Quantum Programs Under Noise
Noise from quantum hardware simulators significantly alters mutant detection distances, making equivalent mutants harder to separate from faults, with output-distribution metrics reaching 73.03% accuracy and 74.89% F1...
-
Quantum Software Architecture Framework (QSAF): A Component-Based Framework for Designing Hybrid Quantum-Classical Systems
QSAF is a new component-based framework that organizes quantum circuit primitives into seven categories and links them through a multi-level abstraction hierarchy to support design of hybrid quantum-classical systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.