← Back to papers
An Implementation of the Quantum Verification of Matrix Products Algorithm
Elton Pinto·August 21, 2022·DOI: 10.48550/arXiv.2208.09914
Computer SciencePhysics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Quantum computing has experienced a recent surge in popularity given the advancements in NISQ machines. Quantum algorithms are known to solve problems like factoring numbers and simulating natural systems more efficiently than a classical computer. Companies such as IBM, Google, and Rigetti have recently built quantum computers that allow researchers to run quantum algorithms on physical hardware. Given these developments, it has become important to survey the feasibility of using quantum computing to solve large-scale problems.