Pith. sign in

REVIEW 2 cited by

Lecture notes on quantum computing

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

arxiv 2311.08445 v3 pith:BFSEY7XW submitted 2023-11-14 quant-ph

classification quant-ph
keywords quantumcomputingcoursealgorithmnotesalgorithmschalmerscomputation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

These are the lecture notes of the master's course "Quantum Computing", taught at Chalmers University of Technology every fall since 2020, with participation of students from RWTH Aachen and Delft University of Technology. The aim of this course is to provide a theoretical overview of quantum computing, excluding specific hardware implementations. Topics covered in these notes include quantum algorithms (such as Grover's algorithm, the quantum Fourier transform, phase estimation, and Shor's algorithm), variational quantum algorithms that utilise an interplay between classical and quantum computers [such as the variational quantum eigensolver (VQE) and the quantum approximate optimisation algorithm (QAOA), among others], quantum error correction, various versions of quantum computing (such as measurement-based quantum computation, adiabatic quantum computation, and the continuous-variable approach to quantum information), the intersection of quantum computing and machine learning, and quantum complexity theory. Lectures on these topics are compiled into 12 chapters, most of which contain a few suggested exercises at the end, and interspersed with four tutorials, which provide practical exercises as well as further details. At Chalmers, the course is taught in seven weeks, with three two-hour lectures or tutorials per week. It is recommended that the students taking the course have some previous experience with quantum physics, but not strictly necessary.

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. Efficient hybrid variational quantum algorithm for solving graph coloring problem

    quant-ph 2025-04 reject novelty 4.0 of 10

    A hierarchical hybrid QAOA algorithm for graph k-coloring partitions the graph, colors subgraphs quantumly and the interaction graph classically, and merges via feedback, but its iterative version succeeds in only 43....

  2. Quantum Algorithms for Matrix Operations Based on Unitary Transformations and Ancillary State Measurements

    quant-ph 2025-01 conditional novelty 4.0 of 10

    Presents quantum circuits for row addition, row swapping, trace, and transpose of amplitude-encoded matrices, with O(log N) or O(m) gate complexity after state preparation.

Pith tools