Quantum Bit-Parallel Swap Matching

A Bitwise Approach to SCER Matching in Indeterminate Strings

We study the problem of matching a determinate pattern against an indeterminate text of the same length n, where each text position is a set of possible characters drawn from an alphabet Σ of size σ. We study this matching problem under the order-preserving and parameterized matching setting. For that, we encode character sets by bit expressions using sum-free sequences. This encoding enables constant-time character comparisons and avoids explicit set operations. We present an optimal O(n) ti...

Attractor Matching: A New Paradigm for Structural String Comparison

We introduce Attractor Matching, a new framework for structural string comparison built upon the theory of string attractors. Given a pattern x of length m and one of its attractors Γx, the problem asks for all substrings y[i.. i+m-1] of a text y such that Γx is also an attractor of y[i.. i+m-1]. Unlike classical notions of string matching, which rely on character equality or distance measures, attractor matching focuses on the structural properties that govern repetitiveness and compressibil...

Spells for Quantum Programmers: Expressive High-Level Commands in Qutes

Classical computers are powerful but fundamentally mundane: they operate through explicit, step-by-step instructions that force programmers to think locally and procedurally. Quantum technologies, by contrast, resemble magical instruments, capable of acting on superpositions, correlations, and entire collections of states at once. Yet, despite their magical nature, quantum computers are still programmed as if they were ordinary machines, relying on long sequences of low-level operations that ...