Computational speed-up with a single qudit

Warning The system is temporarily closed to updates for reporting purpose.

Gedik, Zafer and Silva, I. A. and Çakmak, Barış and Karpat, G. and Vidoto, E. L. G. and Soares-Pinto, D. O. and DeAzevedo, E. R. and Fanchini, F. F. (2015) Computational speed-up with a single qudit. Scientific Reports, 5 . ISSN 2045-2322

[img]PDF (Listed in DOAJ as an open access journal) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1038/srep14671


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.

Item Type:Article
Additional Information:Article Number: 14671
Subjects:Q Science > QC Physics
ID Code:28202
Deposited By:Zafer Gedik
Deposited On:21 Dec 2015 20:59
Last Modified:23 Aug 2019 14:20

Repository Staff Only: item control page