Preface to the Special Issue on "Quantum Computing Algorithms and Computational Complexity".

The time and spatial complexities are HT <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo>(</mo><msup><mi>n</mi><mn>2</mn></msup><mo>)</mo></mrow></semantics></math> ht and HT <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></semantics></math> ht , respectively. Published Papers This is a Special Issue of I Mathematics i belonging to the section "Mathematics and Computer Science", which was closed on 30 June 2022. This Special Issue was mainly concerned with quantum algorithms, the mathematics underlying them, and those complexity issues arising from them. [Extracted from the article]