Revision as of 07:16, 10 January 2022 edit 589q (talk \| contribs) Extended confirmed users 6,471 edits No edit summary ← Previous edit		Revision as of 23:49, 28 January 2022 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits Krysta Svore Next edit →
Line 59: The algorithm inputs are <math> A_1 ... A_m, C , b_1 ... b_m</math> and parameters regarding the solution's [[Trace class\|trace]], precision and optimal value (the objective function's value at the optimal point). The quantum algorithm<ref>{{cite arxiv\|last1=Brandao\|first1=Fernando G. S. L.\|last2=Svore\|first2=Krysta\|author2-link= Krysta Svore \|title=Quantum Speed-ups for Semidefinite Programming\|eprint=1609.05537\|class=quant-ph\|year=2016}}</ref> consists of several iterations. In each iteration, it solves a [[Mathematical optimization#Feasibility problem\|feasibility problem]], namely, finds any solution satisfying the following conditions (giving a threshold <math>t</math>): :<math>

Quantum optimization algorithms: Difference between revisions