论文标题

Grover的算法和许多值量子逻辑

Grover's Algorithm and Many-Valued Quantum Logic

论文作者

Hunt, Samuel, Gadouleau, Maximilien

论文摘要

随着工程努力实现量子计算机的进展,我们认为这些机器不必依靠二进制作为其事实上的信息单位。我们在广义量子电路模型下研究了Grover的算法,其中信息和转换可以在任何ARITH中表达,并在保留语义的同时分析结构和行为特性。也就是说,搜索输出a函数的唯一预映射。我们通过证明广义过程保留$ o(\ sqrt {n})$时间复杂性来得出结论。

As the engineering endeavour to realise quantum computers progresses, we consider that such machines need not rely on binary as their de facto unit of information. We investigate Grover's algorithm under a generalised quantum circuit model, in which the information and transformations can be expressed in any arity, and analyse the structural and behavioural properties while preserving the semantics; namely, searching for the unique preimage to an output a function. We conclude by demonstrating that the generalised procedure retains $O(\sqrt{N})$ time complexity.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源