发表机构
University of Tennessee; Argonne National Laboratory; Cairo University（田纳西大学; 阿贡国家实验室; 开罗大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文为动态图上的连续时间量子行走提出简化规则，实现标准单量子比特门并演示电路化简，作为电路模型与动态图框架间的转译原语。
AI 中文摘要
动态图上的连续时间量子行走（CTQWs）将量子门实现为随时间演化的图哈密顿量序列，但朴素构造会产生带有冗余的长序列。简化规则是一种图重写规则，在保持其实现的酉算子的同时缩短动态图序列，是门模型中电路恒等式的CTQW类比。在这项工作中，我们给出了标准单量子比特门的CTQW实现，并引入了新的图重写规则。我们通过具体的电路化简示例演示了这些简化规则，并概述了它们作为转译原语在电路模型与动态图框架之间进行转换的用途。
英文摘要
Continuous-time quantum walks (CTQWs) on dynamic graphs realize quantum gates as sequences of time-evolving graph Hamiltonians, but naive constructions produce long sequences with redundancy. Simplification rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements, are the CTQW analogue of circuit identities in the gate model. In this work, we give CTQW realizations of the standard single-qubit gates and introduce new graph rewrite rules. We demonstrate the simplification rules through worked circuit reductions and outline their use as transpilation primitives for converting between the circuit model and the dynamic graph framework.
