Linear Order Matrix Inversion Method with Help from Quantum Searching Algorithm

Simple item page
dc.creatorMiyauchi, Atsushi
dc.date2001-09-26
dc.date.accessioned2026-07-07T06:02:44Z
dc.date.available2026-07-07T06:02:44Z
dc.descriptionPresented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension one by one. Total iteration steps required for search are proportional to the number of unknown variables. Our method could solve very large linear equations with sufficiently high probability faster than any existing classical algorithms, which roughly depends on the cube of unknown variables.
dc.description5 pages, ERATO workshop on Quantum Information Science, University of Tokyo, 6-8 Sep, 2001
dc.identifierhttps://arxiv.org/abs/quant-ph/0109131
dc.identifierhttp://arxiv.org/abs/quant-ph/0109131
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89721
dc.subjectQuantum Physics
dc.titleLinear Order Matrix Inversion Method with Help from Quantum Searching Algorithm
dc.typetext

Files

Collections

arXiv