Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.17936714 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p>The data used in this paper is available without restriction. The data provided are solutions to an optimal control problem outlined in the paper, and typically given as two arrays: h_opt, c_opt. It also includes the duration of the evolution, T, and the number of time-slices. </p> <p>Target points are specified by 6 digits codes: XXXYYY, where d1 = X.XX and d2 = Y.YY. The coefficients of the target Hamiltonian are then given by \lambda_1 = 1-d1-d2, \lambda_2 = d1, and \lambda_3 = d2.</p> <p><br>Within h_opt, there are n+2 sub-arrays, where n is the system size. Each sub-array represents the control sequence for each of the tunable controls in the system Hamiltonian. The specific basis ordering for the system Hamiltonian is:</p> <p>H(t)=\sum_{j=1}^nh_j(t)Z_j + h_{n+1}(t)X_1+h_{n+2}X_n + (time-independent part),</p> <p>i.e., with zero-counting, h_opt[0] displays the control sequence for Z_1 and h_opt[n-1] displays the control sequence for X_n. Within each sub-array, each element represents the constant amplitude h_{j,m} at the time-slice m.</p> <p><br>The solution c_opt is an array of elements c_1,c_2,\dots,c_{n+1}, in order to construct the initial condition,</p> <p>K_0=\sum_{j=1}^nc_j Z_j+c_{n+1}\prod_{j=1}^nZ_j.</p> <p><br>For other data enquiries, email the contact author.</p>