Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Computational speed-up with a single qudit

Full text
Author(s):
Gedik, Z. [1] ; Silva, I. A. [2] ; Cakmak, B. [1] ; Karpat, G. [3, 4] ; Vidoto, E. L. G. [2] ; Soares-Pinto, D. O. [2] ; deAzevedo, E. R. [2] ; Fanchini, F. F. [3]
Total Authors: 8
Affiliation:
[1] Sabanci Univ, Fac Engn & Nat Sci, TR-34956 Istanbul - Turkey
[2] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13560970 Sao Paulo - Brazil
[3] UNESP Univ Estadual Paulista, Fac Ciencias, BR-17033360 Sao Paulo - Brazil
[4] Univ Turku, Dept Phys & Astron, Turku Ctr Quantum Phys, FIN-20014 Turku - Finland
Total Affiliations: 4
Document type: Journal article
Source: SCIENTIFIC REPORTS; v. 5, OCT 8 2015.
Web of Science Citations: 28
Abstract

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. (AU)

FAPESP's process: 12/50464-0 - A study of quantum correlations in open quantum systems
Grantee:Felipe Fernandes Fanchini
Support type: Regular Research Grants
FAPESP's process: 14/20941-7 - Non-Markovianity in quantum networks
Grantee:Goktug Karpat
Support type: Scholarships abroad - Research Internship - Post-doctor
FAPESP's process: 14/21792-5 - Protection of quantum algorithms and logic gates in open quantum systems
Grantee:Baris Cakmak
Support type: Scholarships in Brazil - Post-Doctorate