基于Cirq的Deutsch-Jozsa电路综合算法  

Synthesis of Deutsch-Jozsa circuits based on Cirq

作　　者：戴娟 李志强[1] 杨冬晗 DAI Juan;LI Zhiqiang;YANG Donghan(College of Information Engineering,Yangzhou University,Yangzhou 225100,China)

机构地区：[1]扬州大学信息工程学院,江苏扬州225100

出　　处：《量子电子学报》2022年第3期439-445,共7页Chinese Journal of Quantum Electronics

基　　金：国家自然科学基金,61070240,62071240;江苏省高校基金,10KJB520021。

摘　　要：研究Deutsch问题的关键在于构建Oracle电路和综合Deutsch电路。利用Google推出的Cirq框架,首次提出了一个针对n比特Deutsch-Jozsa算法的电路综合算法。该算法根据输入的量子线数n,随机生成f(x)集合,从而构建Deutsch电路并对其进行模拟。其中,生成的f(x)集合是常数函数或者平衡函数的概率是相等的。在此基础上对综合算法进行了优化,优化后的算法既减少了门的总数量和层数,也简化了电路的结构,电路模拟的速度较优化前成倍数地加快,当n=15时,优化后的模拟所需时间仅是优化前的1/6。The key to the study of Deutsch problem lies in constructing Oracle circuit and synthesizing Deutsch circuit. A circuit synthesis algorithm for n-bit Deutsch-Jozsa algorithm is proposed for the first time by using the Cirq framework introduced by Google. The algorithm generates f(x) set randomly according to the number of input quantum wires n, so as to construct Deutsch circuit and simulate it.According to the algorithm, the probability that the set of f(x) generated is a constant function or an equilibrium function is equal. On this basis, the synthesis algorithm is further optimized. The optimized algorithm not only reduces the total number of gates and layers, but also simplifies the structure of the circuit. The simulation speed of the circuit is faster than that before optimization by several times. For example, when n=15, the simulation time after optimization is only 1/6 of that before optimization.

关 键 词：量子信息 量子电路综合 DEUTSCH-JOZSA算法 Oracle电路 Cirq 电路优化 

分 类 号：O431.2[机械工程—光学工程]