An accessible approach to quantum algorithms with QFrame and Qrisp
summary
Eclipse Qrisp is an open‑source Python client that expresses quantum algorithms as usual logic and arithmetic; the layer QFrame builds high‑level quantum search routines. The demo encodes XY=91 with two 4‑qubit registers (256 candidates), runs Grover's algorithm* (≈12 iterations predicted) on a local simulator via multi‑measurement, and prints probabilities. QFrame instead runs a partial‑oracle search that needs one iteration (≈6× speedup here) but currently lacks out‑of‑place multiplication, so full factoring is not yet implemented.
AI-written summary · about
chapters (9)
- 0:00Quantum computing foundations
- 3:33Quantum circuits and gates
- 7:29Superposition and Hadamard gate
- 11:20Search algorithms and advantage
- 12:25Chris library introduction
- 16:40Grover's algorithm for factorization
- 21:54QFrame partial articles
- 27:11QFrame key features
- 32:18Q&A
related talks
26mQrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantu...
21mQuantum Backtracking in Qrisp Applied to Sudoku Problems
55mScalable Quantum Compilation With Jasp
42mQuantum computing without leaving Python behind
01h 10mThe Rise & Collapse of a Quantum State
17mQuantum Applications with Classiq
50mGod really plays dice - Introduction to Quantum Computing with Q#
56mAn Overview of Quantum Algorithms