期刊文献+

广义量子Loop程序的若干性质 被引量:5

Some Properties of Generalized Quantum Loop Program
在线阅读 下载PDF
导出
摘要 本文首先就广义量子loop程序(简记为GQLoop)的主体由比特翻转、去极化、幅值阻尼、相位阻尼等信道描述时,对它的终止(几乎终止)问题进行了研究.其次,讨论了两类GQLoop程序相互嵌套时loop程序的终止(几乎终止)的问题.研究表明:以量子运算的嵌套为主体的GQLoop程序终止(几乎终止)的条件依赖于刻画量子信道的参数.最后,当开放量子系统与其环境在酉运算下做为loop程序的主体时,讨论了在酉运算后去掉环境时的主系统上量子程序的执行过程. In this paper, the termination(almost termination)of generalized quantum loop program(for short GQLoop )is first- ly investigated, where the loop bodies of GQLoop are described by bit flip channel,depolarizing channel,amplitude damping channel and phase damping channel, respectively. Secondly, when the loop bodies are the embedding of two kinds of GQLoop, the conditions of the termination( almost termination)of GQLoop are addressed. It shows that the conditions of the termination(almost termination) of GQLoop depend on the parameters occuring in the quantum channels. Finally, when the loop bodies are an unitary operation on the principle system and the environment under the open quantum system, after implementing unitary operation, the computed pro- cessing of the quantum program is discussed by performing a partial trace over the environment.
出处 《电子学报》 EI CAS CSCD 北大核心 2013年第4期727-732,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.11271237 No.61228305)
关键词 广义量子loop程序 量子运算 终止 几乎终止 复合量子系统 generalized quantum loop program quantum operation termination almost termination composite quantum sys-tem
  • 相关文献

参考文献21

  • 1P W Shor. Algorithrns for quantum computation:Discrete loga- rithms and factoring[ A]. Proceedings of 35th Annual Sympo- sium on Foundations of Computer Science[ C ]. Los Alamitos, CA: IF.EE Press, 1994. 124- 134.
  • 2L Grover. A fast quantum mechanical algorithm for database search[A]. Proceedings of 28th Annual ACM Symposium on the Theory of Computing [ C ]. New York: ACM Press, 1996. 212 - 219.
  • 3M A Nielsen, Chuang I L. Quantum Computation and Quantum Information [ M ]. Cambridge: Cambridge University Press, 21300.
  • 4E H KniU. Conventions for quantum pseudocode[ R ]. LAUR- 96-2724, LANL Report, 1996.
  • 5E D' Hondt, P Panangaden. Quantum weakest preconditions [ J ]. Mathematical Structures in Computer Science, 2006, 16: 429 - 451.
  • 6B Omer.A procedmal formalism for quantum computing[ D]. Vienna: Technical University of Vienna, 1998.
  • 7B Omer. Structured quantum programming[ D ]. Vienna: Tech- nical University of Vienna,2003.
  • 8J W Sanders, P Zuliani. Quantum programming[ A ]. Proceed- ings of Mathematics of Program Construction 2000 [ C ]. Ger- man: Springer, 2000.80 - 99.
  • 9P Zuliani. Quantum programming[ D]. UK: Oxford University,2001.
  • 10P Zuliani. Compiling quantum program[ J ]. Acta Informatica, 2005,41:435 -474.

二级参考文献30

  • 1D Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer [J] .Proc Royal Soc London, 1985,400(1818) :97 - 117.
  • 2E Fredkin, T Toffoli. Conservative logic [ J]. International Journal of Theoretical Physics, 1982,21:219 - 253.
  • 3X Y Song,G W Yang,M Perkowski, et al.Algebraic characteristics of reversible gates [ J ]. Theory of Computing Systems,2005,39(2):311- 319.
  • 4D Maslov, G W Dueck, D M Miller. Toffoli network synthesis with templates [ J ]. IEEE Trans on Circuits and Systems-I, 2005,24(6) : 807 - 817.
  • 5W Q Li,H W Chen, Z Q Li. Application of semi-template in reversible logic circuit [A]. Proceedings of the 11 th International Conference on CSCWD [ C]. Melbourne, Australia, 2007. 155 - 161.
  • 6P Gupta, A Agrawal, N K Jha. An algorithm for synthesis of reversible logic circuits [ J].IEEE Trans on Circuits and Systems-I,2006,25(11) :807 - 817.
  • 7V V Shende, A K Prasad, I L Markov, et al. Synthesis of reversible logic circuits [J]. IEEE Trans on Circuits and Systems-I, 2003,22 (6) : 723 - 729.
  • 8G W Yang,X Y Song,M Perkowski, et al. Fast synthesis of exact minimal reversible circuits using group theory [ A ]. Proceedings of IEEE ASP-DAC 2005 [ C ]. Shanghai, China, 2005. V2,18 - 21.
  • 9G W Yang,X Y Song, W N N Hung, M Perkowski. Bi-directional synthesis of 4-bit reversible circuits [J ]. The Computer Journal, 2008,51 (2) : 207 - 215.
  • 10G L Long, Y Sun. Efficient scheme for initializing a quantum register with an arbitrary superposed state [J]. Phys Rev A, 2001,64(1) :014303:1 - 8.

共引文献16

同被引文献61

  • 1李永明.基于量子逻辑的有穷自动机与单体二阶量子逻辑[J].中国科学(F辑:信息科学),2009,39(11):1135-1145. 被引量:11
  • 2C Baler, J P Katoen. Principles of Model Checking[M]. Cam- bridge, Massachusetts: MIT Press, 2008.
  • 3Papanikolaou, Nikolaos K. Model checking quantum protocols [D] .Coventry,England:the War wick University,2009.
  • 4E Ardeshir Larijani,S J Gay,R Nagarajan. Equivalence checking of quantum protocols[ A]. Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems[ C]. Heidelberg: Springer, 2013,7795: 466 - 480.
  • 5T Davidson,S J Gay,H Mlnarik,R Nagarajan,N.Papanikolaou. Model checking forcommunicafing quantum processes[ J]. Inter- national Journal of Unconventional Computing, 2012,8( 1 ) : 73 - 98.
  • 6P Baltazar,R Chadba,P Mateus. Quantum computation tree logicmodel checking andcomplete calculusE J]. lritemational Journal of Quantum Information,2006(2) :281 - 302.
  • 7M S Ying,Y J Li,N K Yu,Y Feng.Model checking linear time properties of quan turn systems[ DB/O L]. http://arXiv, org/ al:Qtmnt-ph/arXiv: 1101.0303,2010.
  • 8Jaroslav Novotny, Gernot Alber, Igor Jex. Asymptotic properties of quantum mark ovchains [ DB/OL ]. http://arXiv, org/math- ph/arXiv: 12138.0764,2012.
  • 9Stan Gudder. Qua/llalm markov chains. Journal of Mathematical Physics[J] .2008,49(7):072105.
  • 10Andris Ambainis. Quantum walks and their algorithmic applica- tions [ DB/OL ]. http://arXiv, org/quant-ph/arXiv: 0403120v3,2006.

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部