multiline style

Author: marekyggdrasil

manuscript.tex

@@ -439,7 +439,8 @@ \subsection{Optimized quantum scheme for Hamming distance calculation}
 Currently available quantum platforms are still subject to substantial level of noise and extracting the exact distance from amplitude is still a difficult task.
 Fortunately, for most of algorithms, SOFM included, the information of nearest vectors is sufficient. 
 
-Because of that property, those algorithms fall into a special case category for which, as there is only one input vector considered, the ``Decoding'' stage (Fig.\ref{fig:qcircuit}) can be removed as measurement no longer needs to indicate for which input vector the distance has been measured. In this special case scenario the circuit depth complexity is matching with \cite{shuld2014}.
+Because of that property, those algorithms fall into a special case category for which, as there is only one input vector considered, the ``Decoding'' stage (Fig.\ref{fig:qcircuit}) can be removed as measurement no longer needs to indicate for which input vector the distance has been measured.
+In this special case scenario the circuit depth complexity is matching with \cite{shuld2014}.
 
 In the general case when multiple input vectors are present in the register, the ``Decoding'' stage still needs to be included leading to larger circuit depth and less attractive complexity in terms of number of controlled gate operations.
 The number of controlled gate operations in this general case of multiple input vectors is matching the number of controlled gate operations in \cite{trugenberger2001}.