| Full text | |
| Author(s): |
Rivera-Ruiz, C. M.
;
de Lima, E. F.
;
Fanchini, F. F.
;
Lopez-Richard, V.
;
Castelano, L. K.
Total Authors: 5
|
| Document type: | Journal article |
| Source: | PHYSICAL REVIEW A; v. 97, n. 3, p. 6-pg., 2018-03-21. |
| Abstract | |
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gateswith 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 mu 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. (AU) | |
| FAPESP's process: | 15/05581-7 - Quantum control in dissipative systems |
| Grantee: | Felipe Fernandes Fanchini |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 17/07787-7 - Use of quantum optimal control and dynamic decoupling to enable quantum simulation in semiconductor devices |
| Grantee: | Felipe Fernandes Fanchini |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 12/13052-6 - Transport properties and quantum computation in nanostructures |
| Grantee: | Leonardo Kleber Castelano |
| Support Opportunities: | Regular Research Grants |