Computational speed-up in a single qudit NMR quantum information processor

Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in non-classical correlations such as entanglement or quantum discord....

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2014-07
Main Authors: Silva, I A, Çakmak, B, Karpat, G, Vidoto, E L G, Soares-Pinto, D O, deAzevedo, E R, Fanchini, F F, Gedik, Z
Format: Article
Language:English
Subjects:
Algorithms
Microprocessors
NMR
Nuclear magnetic resonance
Permutations
Quantum computing
Quantum entanglement
Quantum mechanics
Quantum phenomena
Quantum theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in non-classical correlations such as entanglement or quantum discord. However, it has been recently shown that even a single pure qudit is sufficient to design an oracle-based algorithm which solves a black-box problem faster than any classical approach to the same problem. In particular, the algorithm that we consider determines whether eight permutation functions defined on a set of four elements is positive or negative cyclic. While any classical solution to this problem requires two evaluations of the function, quantum mechanics allows us to perform the same task with only a single evaluation. Here, we present the first experimental demonstration of the considered quantum algorithm with a quadrupolar nuclear magnetic resonance setup using a single four-level quantum system, i.e., a ququart.
ISSN:2331-8422
DOI:10.48550/arxiv.1406.3579