Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Fast and virtually exact quantum gate generation in U(n) via iterative Lyapunov methods

Full text
Author(s):
Pereira da Silva, Paulo Sergio [1] ; Silveira, Hector Bessa [2] ; Rouchon, Pierre [3]
Total Authors: 3
Affiliation:
[1] Univ Sao Paulo, Escola Politecn PTC, Sao Paulo - Brazil
[2] Fed Univ Santa Catarina UFSC, Dept Automat & Syst, Florianopolis, SC - Brazil
[3] Mines ParisTech, Ctr Automat & Syst, Paris - France
Total Affiliations: 3
Document type: Journal article
Source: International Journal of Control; v. 94, n. 4, p. 984-998, APR 3 2021.
Web of Science Citations: 1
Abstract

A new approach called Reference Input Generation Algorithm (RIGA) is introduced for quantum gate generation. Let be the trajectory that is obtained in step , with . In step , is right-translated in order to displace to . The translated trajectory is used as a reference for a Lyapunov-based tracking control law, generating , and so on. A proof of the exponential convergence of to zero is provided for large enough. Two examples present numerical experiments regarding N coupled qubits. The first example considers N = 3 with a known minimum time . It presents excellent results for . The second example is a benchmark for the comparison between RIGA and GRAPE, considering a Hadamard gate for the systems with N = 2, 3, horizontal ellipsis , 10 qubits. The runtime of RIGA could be improved, and GRAPE was implemented in a faster CPU. However, RIGA presents results that are similar to GRAPE, with faster runtime in some cases, showing that the RIGA is indeed a promising algorithm. (AU)

FAPESP's process: 18/17463-7 - Control of Quantum Gates and of Ensembles of Bloch Equations
Grantee:Paulo Sergio Pereira da Silva
Support Opportunities: Regular Research Grants