Answers are grounded in this paper and cite their sources.
In their recent paper [], Wan proposed a quantum algorithm to solve systems of linear equations <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mrow><a:mi>A</a:mi><a:mi>x</a:mi><a:mo>=</a:mo><a:mi>b</a:mi></a:mrow></a:math>, where <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"><b:mi>A</b:mi></b:math> is an <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mrow><c:mi>n</c:mi><c:mo>×</c:mo><c:mi>n</c:mi></c:mrow></c:math> Toeplitz matrix generated by the Fourier coefficients of a continuous, <d:math xmlns:d="http://www.w3.org/1998/Math/MathML"><d:mrow><d:mn>2</d:mn><d:mi>π</d:mi></d:mrow></d:math>-periodic, and positive function <e:math xmlns:e="http://www.w3.org/1998/Math/MathML"><e:mi>f</e:mi></e:math>. For large enough <f:math xmlns:f="http://www.w3.org/1998/Math/MathML"><f:mi>n</f:mi></f:math>, they claimed that the algorithm is valid for all <g:math xmlns:g="http://www.w3.org/1998/Math/MathML"><g:mi>b</g:mi></g:math>. In this Comment we prove that, in general, this is not true.
No takes yet. Share an insight, caveat, or question.
Gutiérrez-Gutiérrez et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: