- Start Date:
May 29, 2026
- Event Start Time:
10:45 AM
- Event End Time:
11:45 AM
- Organizers:
Lazaros Gallos
- Seminar Series:
REU Seminar
- Presenter(s):
Liron Mor Yosef - Tel Aviv University
- Event Location:
DIMACS Seminar room
- Abstract:
Quantum circuits inherently perform linear algebra operations on quantum states, suggesting the potential for executing numerical linear algebra computations on quantum computers. However, existing quantum algorithms often rely on specific quantum access, limiting practicality. Common assumptions involve QRAM or quantum matrix oracles, yet QRAM's feasibility is uncertain. Another approach assumes a sparse Pauli decomposition, but it's not universally applicable. In this talk, we show an approach that assumes quantum access through state preparation circuits. We introduce State Preparation Circuits and present qMSLA, a framework operating on classical descriptions of these circuits. This framework facilitates the manipulation of quantum states represented as matrices. Each operation within qMSLA takes classical descriptions of matrix state preparation circuits as input and generates classical descriptions of new state preparation circuits, implementing matrix algebra between input matrices. Although the algorithms are classical to classical, they produce circuits intended for execution on a quantum computer. The framework streamlines quantum algorithm construction. Instead of intricate, problem-specific designs, mathematical solutions can be translated into qMSLA operations, yielding runnable quantum circuits. This simplifies implementation, enabling straightforward quantum algorithm development. qMSLA is demonstrated in implementing classic quantum algorithms (Hadamard Test, QFT, Phase Estimation, Qubitization, Block Encoding, etc.) and innovative algorithms like trace of matrices product. This approach paves the way for developing quantum algorithms more intuitively and accessibly
