vix.ing · top · new · best · stats · spec

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

2017/10/11 by C. M. Rivera-Ruiz, Emanuel F. de Lima, E. F. de Lima +4
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum and electron transport phenomena #Quantum computer #Quantum error correction #Quantum gate #Quantum mechanics #Qubit #cond-mat.other #quant-ph

paper · pdf · doi:10.1103/physreva.97.032332

published as Phys. Rev. A 97, 032332 (2018) · 5 pages, 5 figures, comments welcome

arxiv created 2017/10/11 · openalex publication_date 2018/03/21 · arxiv updated 2018/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with a fidelity higher than 0.9997, when noise is not taken into account. Particularly, these quantum gates were chosen to perform the permutation algorithm in hybrid qubits in double quantum dots (DQDs). The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup is the use of a one-particle quantum system with at least three levels. The high fidelity found in our results is closely related to the quantum speed limit, which is a measure of how fast a quantum state can be manipulated. Furthermore, we model charge noise by considering an average over the optimal field centered at different values of the reference detuning, which follows a Gaussian distribution. When the Gaussian spread is of the order of 5 \ensuremathμeV (10% of the correct value), the fidelity is still higher than 0.95. Our scheme also can be used for the practical realization of different quantum algorithms in DQDs.

Citations