Quantum singular value transformation: Difference between revisions

Revision as of 23:20, 8 February 2024

Revision as of 04:39, 25 February 2024

Line 5:

}}

{{notability|date=February 2024}}

'''Quantum singular value transformation''' is a [[quantum algorithm]] primitive that unifies all existing quantum algorithms into a single framework thus simplifying quantum algorithm design and implementation.<ref name=grand_unification2021>{{Cite journal |arxiv = 2105.02859 |last1 = Martyn|first1 = John M. |last2= Rossi |first2 = Zane M |last3=Tan |first3=Andrew K. |last4=Chuang |first4=Isaac L. |title = Grand Unification of Quantum Algorithms|journal = PRX Quantum|volume = 2|pages = 040203|year = 2021| issue=4 |publisher=American Physical Society|doi =10.1103/PRXQuantum.2.040203|url=https://link.aps.org/doi/10.1103/PRXQuantum.2.040203}}</ref> It applies [[Polynomial|polynomial functions]] to the [[singular values]] of matrices.<ref name=qsvt2019>{{Cite journal |arxiv = 1806.01838 |last1 = Gilyén|first1 = András |last2= Su |first2 = Yuan |last3 = Low |first3= Guang Hao |last4=Wiebe |first4=Nathan |title = Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics| journal=Association for Computing Machinery|pages = 193–204|year = 2019 |doi = 10.1145/3313276.3316366 | isbn=978-1-4503-6705-9 |url=https://doi.org/10.1145/3313276.3316366}}</ref>

==Algorithm==