Pith. sign in

REVIEW 2 cited by

Lecture Notes on Quantum Algorithms

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2212.14205 v1 pith:ZMICQ7UF submitted 2022-12-29 quant-ph cs.DS

Kamil Khadiev This is my paper · ORCID
classification quant-phcs.DS
keywords partquantumalgorithmapplicationslecturenotesalgorithmscontain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The lecture notes contain three parts. The first part is Grover's Search Algorithm with modifications, generalizations, and applications. The second part is a discussion on the quantum fingerprinting technique. The third part is Quantum Walks (discrete time) algorithm with applications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Algorithm for the Multiple String Matching Problem

    quant-ph 2024-11 conditional novelty 7.0 of 10

    A quantum algorithm using suffix arrays and quantum longest-common-prefix comparisons solves multiple string matching in O*(n + sqrt(mL)) queries, matching the lower bound up to logs.

  2. Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path

    quant-ph 2026-08 conditional novelty 5.0 of 10

    A 1-covering path method reduces the CNOT cost of quantum hashing circuits on arbitrary qubit connectivity graphs.

Pith tools