2017/10/31 by Clément Godfrin, Abdelkarim Ferhat, R. Ballou +5 · 3 citations
Computer Science · Physics and Astronomy · #Algorithm #Computer science #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum computer #Quantum mechanics #cond-mat.mes-hall #quant-ph
paper · pdf · doi:10.1103/physrevlett.119.187702
published as Phys. Rev. Lett. 119, 187702 (2017) · 5 pages, 4 figures
openalex publication_date 2017/11/02 · arxiv created 2017/11/28 · arxiv updated 2017/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Quantum algorithms use the principles of quantum mechanics, such as, for example, quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimization, simulation, and solving large systems of linear equations. Here, we implement Grover's quantum algorithm, proposed to find an element in an unsorted list, using a single nuclear 3/2 spin carried by a Tb ion sitting in a single molecular magnet transistor. The coherent manipulation of this multilevel quantum system (qudit) is achieved by means of electric fields only. Grover's search algorithm is implemented by constructing a quantum database via a multilevel Hadamard gate. The Grover sequence then allows us to select each state. The presented method is of universal character and can be implemented in any multilevel quantum system with nonequal spaced energy levels, opening the way to novel quantum search algorithms.