QBithm: towards the coherent control of robust spin qubits in quantum algorithms

13 March 2023, Version 1
This content is a preprint and has not undergone peer review at the time of posting.


Many efforts have succeeded over the last decade at lengthening the timescale in which spin qubits loss quantum information under free evolution. With these design principles, it is now timely to zoom out and take the whole picture: concerning applications that require user-driven evolutions, qubits should be assessed within the desired algorithm. This means to test qubits under external control while relaxation is active, and to maximize the algorithm fidelity as the actual figure of merit. Herein, we pose and analytically solve a master equation devised to run one-spin-qubit algorithms subject to relaxation. It is handled via a code, QBithm, which inputs gate sequences and relaxation rates thus connecting with the longstanding work devoted to their ab initio computation. We calculate fidelities against relaxation and imperfections, and implement well-known pulse sequences quantitatively agreeing with experimental data. Hopefully, this work will stimulate the study of many-qubit systems driven under relaxation and imperfections in quantum algorithms.


Spin Qubit
Quantum Algorithm
Quantum gate

Supplementary materials

Supplementary Information
Details on Theory Development, QBithm software package, and Case Studies.


Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.