<s>
A	O
quantum	B-Algorithm
sort	I-Algorithm
is	O
any	O
sorting	B-Algorithm
algorithm	I-Algorithm
that	O
runs	O
on	O
a	O
quantum	B-Architecture
computer	I-Architecture
.	O
</s>
<s>
Any	O
comparison-based	O
quantum	O
sorting	B-Algorithm
algorithm	I-Algorithm
would	O
take	O
at	O
least	O
steps	O
,	O
which	O
is	O
already	O
achievable	O
by	O
classical	O
algorithms	O
.	O
</s>
<s>
Thus	O
,	O
for	O
this	O
task	O
,	O
quantum	B-Architecture
computers	I-Architecture
are	O
no	O
better	O
than	O
classical	O
ones	O
,	O
and	O
should	O
be	O
disregarded	O
when	O
it	O
comes	O
to	O
time	O
complexity	O
.	O
</s>
