Quantum Verification of Matrix Products
Abstract
We present a quantum algorithm that verifies a product of two n*n matrices over any field with bounded error in worst-case time n5/3 and expected time n5/3 / min(w,sqrt(n))1/3, where w is the number of wrong entries. This improves the previous best algorithm that runs in time n7/4. We also present a quantum matrix multiplication algorithm that is efficient when the result has few nonzero entries.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.