Introduction to Quantum Singular Value Transformation (QSVT)

Introduction to Quantum Singular Value Transformation (QSVT)

This PennyLane tutorial introduces the Quantum Singular Value Transformation (QSVT), a unifying framework that has been called a grand unification of quantum algorithms because so many, search, phase estimation, Hamiltonian simulation, linear-systems solving, can be derived from it. QSVT provides a systematic way to apply an almost-arbitrary polynomial transformation to the singular values (or eigenvalues) of a matrix that has been embedded into a larger unitary (a block encoding). The tutorial builds the idea up from its foundation, quantum signal processing on a single qubit, where interleaving fixed rotations with adjustable phase rotations realizes a polynomial in a parameter, and then lifts it to QSVT, where the same interleaving of the block-encoded operator with projector-controlled phase rotations applies that polynomial to the matrix's singular values. It shows how to construct QSVT circuits in PennyLane using the library's QSVT tooling, choose the phase angles that implement a desired polynomial, and verify the resulting transformation. By making this abstract but central technique concrete, the tutorial gives a foundational understanding of the framework underlying much of modern quantum algorithm design, in PennyLane.

Run it

pip install -r requirements.txt
python demo.py

Source and license

Imported from demonstrations_v2/tutorial_intro_qsvt/demo.py in PennyLaneAI/demos at c52c0abeb5122218aa96b38eea848864cce7323f, under the Apache License 2.0. Original authors: Xanadu and the PennyLane community. The upstream LICENSE is included alongside this example.