arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.22337math.COcs.DMcs.ITmath.ITquant-ph
收藏

四元数完美序列与哈达玛矩阵

Quaternionic Perfect Sequences and Hadamard Matrices

University of Windsor(温莎大学);University of Waterloo(滑铁卢大学);Université Grenoble Alpes(格勒诺布尔阿尔卑斯大学);CNRS(法国国家科学研究中心)

Aidan Bennett, Curtis Bright, Paul Colinot, Ashwin Nayak

AI总结:

本研究通过四元数完美序列与哈达玛矩阵的对应关系,设计了更高效的枚举算法,发现循环块的友好性质,并构造了新的量子通信用哈达玛矩阵。

摘要:

一个有限数列如果在非平凡循环移位后具有零周期自相关性,则称为完美序列。在本工作中,我们研究了与威廉森构造四元型哈达玛矩阵所出现的二进制序列存在一一对应关系的四元数完美序列。利用这种对应关系,我们设计了一种枚举算法,其速度显著快于以前使用的算法,且不需要序列对称。我们实现了该算法,并用它枚举了所有循环和可能非对称的威廉森型矩阵,最大阶数达到21;此前,最大枚举阶数为13。我们证明当四元型哈达玛矩阵的块是循环时,这些块必然成对友好。这大大提高了我们算法的过滤能力:在阶数20时,需要考虑的块对数量减少了超过25000倍。我们利用这些结果构造了在量子通信中感兴趣的四元数哈达玛矩阵,并证明它们不等同于通过其他方法构造的矩阵。我们还分析了四元数哈达玛矩阵的性质,并展示了用固定模式的条目来表征四元数哈达玛矩阵的可行性。这些结果表明了一组更丰富的性质,并暗示了足够大的阶数下存在大量的四元数哈达玛矩阵。

英文摘要:

A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in Williamson's construction of quaternion-type Hadamard matrices. Using this correspondence, we devise an enumeration algorithm that is significantly faster than previously used algorithms and does not require the sequences to be symmetric. We implement our algorithm and use it to enumerate all circulant and possibly non-symmetric Williamson-type matrices of orders up to 21; previously, the largest order exhaustively enumerated was 13. We prove that when the blocks of a quaternion-type Hadamard matrix are circulant, the blocks are necessarily pairwise amicable. This dramatically improves the filtering power of our algorithm: in order 20, the number of block pairs needing consideration is reduced by a factor of over 25,000. We use our results to construct quaternionic Hadamard matrices of interest in quantum communication and prove they are not equivalent to those constructed by other means. We also study the properties of quaternionic Hadamard matrices analytically, and demonstrate the feasibility of characterizing quaternionic Hadamard matrices with a fixed pattern of entries. These results indicate a richer set of properties and suggest an abundance of quaternionic Hadamard matrices for sufficiently large orders.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑