A Software Package to Construct Polynomial Sets over Z_2 for Determining the Output of Quan.pdf
- 1、本文档共5页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A Software Package to Construct Polynomial Sets over Z_2 for Determining the Output of Quan
a
r
X
i
v
:
q
u
a
n
t
-
p
h
/
0
5
0
9
0
6
4
v
2
8
D
e
c
2
0
0
5 A Software Package to Construct Polynomial Sets over Z2 for
Determining the Output of Quantum Computations
Vladimir P. Gerdta?, Vasily M. Severyanova?
aLaboratory of Information Technologies, Joint Institute for Nuclear Research,
141980 Dubna, Russia
A C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate
polynomials over the finite field Z2 whose total number of solutions in Z2 determines the output of the quantum
computation defined by the circuit. The generated polynomial system can further be converted to the canonical
Gro?bner basis form which provides a universal algorithmic tool for counting the number of common roots of the
polynomials.
1. INTRODUCTION
One important aspect of quantum computation
is estimation of computational power of quantum
logical circuits. As it was recently shown in [1],
determining the output of a quantum computa-
tion is equivalent to counting the number of solu-
tions of a certain set of polynomials defined over
the finite field Z2.
Using ideas published in [1], we have written
a C# program enabling one to assemble an ar-
bitrary quantum circuit in a particular universal
gate basis and to construct the corresponding set
of polynomial equations over Z2. The number of
solutions of the set defines the matrix elements of
the circuit and therefore its output value for any
input value.
The generated polynomial system can further
be converted into the canonical Gro?bner basis
form by applying efficient involutive algorithms
described in [2]. A triangular Gro?bner basis for
the pure lexicographical order on the polynomial
variables is generally most appropriate for count-
ing the number of common roots of the polyno-
mials.
Our program has a user-friendly graphical in-
terface and a built-in base of the elementary gates
representing certain quantum gates and wires. A
user can easily assemble an input circuit from
?gerdt@ji
您可能关注的文档
- 2014届北京朝阳高三上期末英语(word解析).doc
- 2014年6月15日托福口语真题及答案解析.doc
- 2014年12月13日雅思写作考题预测.pdf
- 2014年5月雅思口语预测.pdf
- 2014年6月大学英语四级(CET4)新题型预测选词填空题型-17526.pdf
- 2013新版八年级上同步知识讲解 unit-1Where did you go on vacation 学生版.doc
- 2014年6月大学英语四级考试真题试题二 - 备考族.pdf
- 2014年7月-9月雅思G类写作预测及解题思路.pdf
- 2014年8年级上期末英语试题.pdf
- 2014-2015学年第一学期月度质量检测九年级英语.doc
文档评论(0)