A lower bound method for quantum circuits

被引:2
|
作者
Bera, Debajyoti [1 ]
机构
[1] Boston Univ, Boston, MA 02215 USA
关键词
Computational complexity; Quantum circuit; Circuit complexity theory; Lower bound; Parity function;
D O I
10.1016/j.ipl.2011.05.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Quantum circuits, which are shallow, limited in the number of gates and additional workspace qubits, are popular for quantum computation because they form the simplest possible model similar to the classical model of a network of Boolean gates and capable of performing non-trivial computation. We give a new lower bound technique for such circuits and use it to give another proof that deterministic computation of the parity function cannot be performed by such circuits. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:723 / 726
页数:4
相关论文
共 50 条