Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives by Yevhen Kotukh, Hennadii Khalimov

“…The presence of regularity in the computational data of the algorithm, for example, periodicity (frequency resonances) in algebraic structures (rings, groups, lattices, etc.) can potentially be filtered by some algorithm with a complexity less than Grover's algorithm. …”
Get full text

Trellis Decoding for Qudit Stabilizer Codes and Its Application to Qubit Topological Codes by Eric Sabo, Arun B. Aloshious, Kenneth R. Brown

“…We identify trellis edge number as a key metric of difficulty of decoding, allowing us to quantify the advantage of single-axis (<inline-formula><tex-math notation="LaTeX">$X$</tex-math></inline-formula> or <inline-formula><tex-math notation="LaTeX">$Z$</tex-math></inline-formula>) decoding for Calderbank&#x2013;Steane&#x2013;Shor codes and block decoding for concatenated codes.…”
Get full text