期刊
SCIENTIFIC REPORTS
卷 5, 期 -, 页码 -出版社
NATURE PUBLISHING GROUP
DOI: 10.1038/srep14671
关键词
-
资金
- Turkish agency TUBITAK [111T232]
- Sao Paulo Research Foundation (FAPESP) [2014/21792-5, 2012/50464-0]
- Sao Paulo Research Foundation (FAPESP), BEPE fellowship [2014/20941-7]
- National Counsel of Technological and Scientific Development (CNPq) [304955/2013-2, 443828/2014-8, 312852/2014-2, 474592/2013-8]
- Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES) [108/2012]
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据