Berlin 2024 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
QI: Fachverband Quanteninformation
QI 28: Surface Atom and Color Center Spin Qubits
QI 28.5: Talk
Thursday, March 21, 2024, 16:15–16:30, HFT-FT 131
Quantum Optimal Circuit Compilation Algorithm for NV Centers — •Yaqing Xy Wang1, Mees Hendriks3, Felix Motzoi1, Tommaso Calarco1,2, and Matthias M. Müller1 — 1Peter Grünberg Institute,Quantum Control (PGI-8), Forschungszentrum Jülich GmbH, D-52425 Germany — 2Dipartimento di Fisica e Astronomia "Augusto Righi" Viale Berti Pichat 6/2, Bologna, Italy — 3CHARM Therapeutics Ltd., The Stanley Building, 7 St. Pancras Square, London, N1C 4AG, UK
This talk illustrates an approach to circuit compilation that is applicable to centrally coupled qubit network. The method serves as an end-to-end mapping between a desired unitary to control pulse on the physical platform. The decomposition of circuit unitary to sequence of gates originating in native terms of the platform Hamiltonian is achieved by a modified recursive Cartan Decomposition of the unitary. Moreover, A quasi-analytic pulse generation method is proposed for achieving native basis gates that bypasses the costly matrix exponentiation involved in numerical pulse optimization algorithms. The method is expected to demonstrate its time optimality on larger Hilbert spaces with a high level of qubit connectivity as well as for more arbitrary unitary objectives that arise in quantum simulation tasks, nonetheless on smaller systems it provides mathematically elegant solutions. In both scenarios, the proposed method is robust against the short dephasing time of the central ancilla qubit(NV center).
Keywords: Quantum Circuit Compilation Algorithm; Unitary Decomposition; Quantum Control; NV centers