Artigo
Computational speed-up with a single qudit
Registro en:
Scientific Reports, v. 5, p. 1-7, 2015.
2045-2322
10.1038/srep14671
PMC4597186.pdf
8884890472193474
26446614
PMC4597186
0000-0003-3297-905X
Autor
Gedik, Zafer
Silva, Isabela Almeida
Çakmak, Baris
Karpat, Göktug [UNESP]
Vidoto, Edson Luiz Géa
Soares-Pinto, Diogo de Oliveira
Azevedo, Eduardo Ribeiro de
Fanchini, Felipe Fernandes [UNESP]
Resumen
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. Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (TUBITAK) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Sabanci University, Faculty of Engineering and Natural Sciences Universidade de São Paulo, Instituto de Física de São Carlos University of Turku, Turku Center for Quantum Physics, Department of Physics and Astronomy Universidade Estadual Paulista, Departamento de Física, Faculdade de Ciências de Bauru TUBITAK: 111T232 FAPESP: 2014/21792-5 FAPESP: 2014/20941-7 CNPq: 304955/2013-2 CNPq: 443828/2014-8 CAPES: 108/2012 CNPq: 312852/2014-2 FAPESP: 2012/50464-0 CNPq: 474592/2013-8