Polynomial time quantum computation with advice

被引:23
|
作者
Nishimura, H [1 ]
Yamakami, T [1 ]
机构
[1] Univ Ottawa, Sch Informat Technol & Engn, Peterborough, ON K1N 6N5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
computational complexity; quantum circuit; advice function;
D O I
10.1016/j.ipl.2004.02.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-effor probability. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:195 / 204
页数:10
相关论文
共 50 条