Convergence of Iterative Quadratic Programming for Robust Fixed-Endpoint Transfer of Bilinear Systems Article Swipe
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2403.18131
We present a computational method for open-loop minimum-norm control synthesis for fixed-endpoint transfer of bilinear ensemble systems that are indexed by two continuously varying parameters. We suppose that one ensemble parameter scales the homogeneous, linear part of the dynamics, and the second parameter scales the effect of the applied control inputs on the inhomogeneous, bilinear dynamics. This class of dynamical systems is motivated by robust quantum control pulse synthesis, where the ensemble parameters correspond to uncertainty in the free Hamiltonian and inhomogeneity in the control Hamiltonian, respectively. Our computational method is based on polynomial approximation of the ensemble state in parameter space and discretization of the evolution equations in the time domain using a product of matrix exponentials corresponding to zero-order hold controls over the time intervals. The dynamics are successively linearized about control and trajectory iterates to formulate a sequence of quadratic programs for computing perturbations to the control that successively improve the objective until the iteration converges. We use a two-stage computation to first ensure transfer to the desired terminal state, and then minimize the norm of the control function. The method is demonstrated for the canonical uniform transfer problem for the Bloch system that appears in nuclear magnetic resonance, as well as the matter-wave splitting problem for the Raman-Nath system that appears in ultra-cold atom interferometry.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2403.18131
- https://arxiv.org/pdf/2403.18131
- OA Status
- green
- Cited By
- 1
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4393299969
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4393299969Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2403.18131Digital Object Identifier
- Title
-
Convergence of Iterative Quadratic Programming for Robust Fixed-Endpoint Transfer of Bilinear SystemsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-03-26Full publication date if available
- Authors
-
Luke S. Baker, André Luiz P. de Lima, Anatoly Zlotnik, Jr-Shin LiList of authors in order
- Landing page
-
https://arxiv.org/abs/2403.18131Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2403.18131Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2403.18131Direct OA link when available
- Concepts
-
Convergence (economics), Bilinear interpolation, Quadratic equation, Fixed point, Mathematics, Mathematical optimization, Quadratic programming, Sequential quadratic programming, Applied mathematics, Computer science, Mathematical analysis, Economics, Statistics, Economic growth, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1Per-year citation counts (last 5 years)
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4393299969 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2403.18131 |
| ids.doi | https://doi.org/10.48550/arxiv.2403.18131 |
| ids.openalex | https://openalex.org/W4393299969 |
| fwci | |
| type | preprint |
| title | Convergence of Iterative Quadratic Programming for Robust Fixed-Endpoint Transfer of Bilinear Systems |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10791 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9901999831199646 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2207 |
| topics[0].subfield.display_name | Control and Systems Engineering |
| topics[0].display_name | Advanced Control Systems Optimization |
| topics[1].id | https://openalex.org/T10963 |
| topics[1].field.id | https://openalex.org/fields/26 |
| topics[1].field.display_name | Mathematics |
| topics[1].score | 0.982200026512146 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2612 |
| topics[1].subfield.display_name | Numerical Analysis |
| topics[1].display_name | Advanced Optimization Algorithms Research |
| topics[2].id | https://openalex.org/T11416 |
| topics[2].field.id | https://openalex.org/fields/26 |
| topics[2].field.display_name | Mathematics |
| topics[2].score | 0.9617999792098999 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2612 |
| topics[2].subfield.display_name | Numerical Analysis |
| topics[2].display_name | Numerical methods for differential equations |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C2777303404 |
| concepts[0].level | 2 |
| concepts[0].score | 0.739883542060852 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[0].display_name | Convergence (economics) |
| concepts[1].id | https://openalex.org/C205203396 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6016150116920471 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q612143 |
| concepts[1].display_name | Bilinear interpolation |
| concepts[2].id | https://openalex.org/C129844170 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5992682576179504 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q41299 |
| concepts[2].display_name | Quadratic equation |
| concepts[3].id | https://openalex.org/C61445026 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5717577338218689 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q217608 |
| concepts[3].display_name | Fixed point |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.5435500144958496 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C126255220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.5132877230644226 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[5].display_name | Mathematical optimization |
| concepts[6].id | https://openalex.org/C81845259 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4851432740688324 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q290117 |
| concepts[6].display_name | Quadratic programming |
| concepts[7].id | https://openalex.org/C198927703 |
| concepts[7].level | 3 |
| concepts[7].score | 0.4385181963443756 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q4373881 |
| concepts[7].display_name | Sequential quadratic programming |
| concepts[8].id | https://openalex.org/C28826006 |
| concepts[8].level | 1 |
| concepts[8].score | 0.4291331171989441 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q33521 |
| concepts[8].display_name | Applied mathematics |
| concepts[9].id | https://openalex.org/C41008148 |
| concepts[9].level | 0 |
| concepts[9].score | 0.3477540612220764 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[9].display_name | Computer science |
| concepts[10].id | https://openalex.org/C134306372 |
| concepts[10].level | 1 |
| concepts[10].score | 0.11039245128631592 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[10].display_name | Mathematical analysis |
| concepts[11].id | https://openalex.org/C162324750 |
| concepts[11].level | 0 |
| concepts[11].score | 0.07077884674072266 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[11].display_name | Economics |
| concepts[12].id | https://openalex.org/C105795698 |
| concepts[12].level | 1 |
| concepts[12].score | 0.06969216465950012 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[12].display_name | Statistics |
| concepts[13].id | https://openalex.org/C50522688 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q189833 |
| concepts[13].display_name | Economic growth |
| concepts[14].id | https://openalex.org/C2524010 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[14].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/convergence |
| keywords[0].score | 0.739883542060852 |
| keywords[0].display_name | Convergence (economics) |
| keywords[1].id | https://openalex.org/keywords/bilinear-interpolation |
| keywords[1].score | 0.6016150116920471 |
| keywords[1].display_name | Bilinear interpolation |
| keywords[2].id | https://openalex.org/keywords/quadratic-equation |
| keywords[2].score | 0.5992682576179504 |
| keywords[2].display_name | Quadratic equation |
| keywords[3].id | https://openalex.org/keywords/fixed-point |
| keywords[3].score | 0.5717577338218689 |
| keywords[3].display_name | Fixed point |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.5435500144958496 |
| keywords[4].display_name | Mathematics |
| keywords[5].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[5].score | 0.5132877230644226 |
| keywords[5].display_name | Mathematical optimization |
| keywords[6].id | https://openalex.org/keywords/quadratic-programming |
| keywords[6].score | 0.4851432740688324 |
| keywords[6].display_name | Quadratic programming |
| keywords[7].id | https://openalex.org/keywords/sequential-quadratic-programming |
| keywords[7].score | 0.4385181963443756 |
| keywords[7].display_name | Sequential quadratic programming |
| keywords[8].id | https://openalex.org/keywords/applied-mathematics |
| keywords[8].score | 0.4291331171989441 |
| keywords[8].display_name | Applied mathematics |
| keywords[9].id | https://openalex.org/keywords/computer-science |
| keywords[9].score | 0.3477540612220764 |
| keywords[9].display_name | Computer science |
| keywords[10].id | https://openalex.org/keywords/mathematical-analysis |
| keywords[10].score | 0.11039245128631592 |
| keywords[10].display_name | Mathematical analysis |
| keywords[11].id | https://openalex.org/keywords/economics |
| keywords[11].score | 0.07077884674072266 |
| keywords[11].display_name | Economics |
| keywords[12].id | https://openalex.org/keywords/statistics |
| keywords[12].score | 0.06969216465950012 |
| keywords[12].display_name | Statistics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2403.18131 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://arxiv.org/pdf/2403.18131 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2403.18131 |
| locations[1].id | doi:10.48550/arxiv.2403.18131 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2403.18131 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5007563103 |
| authorships[0].author.orcid | https://orcid.org/0009-0004-9714-6256 |
| authorships[0].author.display_name | Luke S. Baker |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Baker, Luke S. |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5087659134 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-8503-7758 |
| authorships[1].author.display_name | André Luiz P. de Lima |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | de Lima, Andre Luiz P. |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5024207408 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-2646-8264 |
| authorships[2].author.display_name | Anatoly Zlotnik |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Zlotnik, Anatoly |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5079314465 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-6693-3979 |
| authorships[3].author.display_name | Jr-Shin Li |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Li, Jr-Shin |
| authorships[3].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2403.18131 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Convergence of Iterative Quadratic Programming for Robust Fixed-Endpoint Transfer of Bilinear Systems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10791 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9901999831199646 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2207 |
| primary_topic.subfield.display_name | Control and Systems Engineering |
| primary_topic.display_name | Advanced Control Systems Optimization |
| related_works | https://openalex.org/W4206704743, https://openalex.org/W4313119266, https://openalex.org/W2164807043, https://openalex.org/W2019128690, https://openalex.org/W4231448069, https://openalex.org/W2128461291, https://openalex.org/W2355907103, https://openalex.org/W2270789747, https://openalex.org/W436931041, https://openalex.org/W1495847109 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2403.18131 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2403.18131 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2403.18131 |
| primary_location.id | pmh:oai:arXiv.org:2403.18131 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://arxiv.org/pdf/2403.18131 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2403.18131 |
| publication_date | 2024-03-26 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 2, 113, 139, 161 |
| abstract_inverted_index.We | 0, 25, 159 |
| abstract_inverted_index.as | 202, 204 |
| abstract_inverted_index.by | 20, 63 |
| abstract_inverted_index.in | 76, 82, 99, 108, 198, 215 |
| abstract_inverted_index.is | 61, 90, 184 |
| abstract_inverted_index.of | 13, 36, 46, 58, 95, 104, 115, 141, 178 |
| abstract_inverted_index.on | 51, 92 |
| abstract_inverted_index.to | 74, 119, 137, 147, 164, 168 |
| abstract_inverted_index.Our | 87 |
| abstract_inverted_index.The | 127, 182 |
| abstract_inverted_index.and | 39, 80, 102, 134, 173 |
| abstract_inverted_index.are | 18, 129 |
| abstract_inverted_index.for | 5, 10, 144, 186, 192, 209 |
| abstract_inverted_index.one | 28 |
| abstract_inverted_index.the | 32, 37, 40, 44, 47, 52, 70, 77, 83, 96, 105, 109, 124, 148, 153, 156, 169, 176, 179, 187, 193, 205, 210 |
| abstract_inverted_index.two | 21 |
| abstract_inverted_index.use | 160 |
| abstract_inverted_index.This | 56 |
| abstract_inverted_index.atom | 217 |
| abstract_inverted_index.free | 78 |
| abstract_inverted_index.hold | 121 |
| abstract_inverted_index.norm | 177 |
| abstract_inverted_index.over | 123 |
| abstract_inverted_index.part | 35 |
| abstract_inverted_index.that | 17, 27, 150, 196, 213 |
| abstract_inverted_index.then | 174 |
| abstract_inverted_index.time | 110, 125 |
| abstract_inverted_index.well | 203 |
| abstract_inverted_index.Bloch | 194 |
| abstract_inverted_index.about | 132 |
| abstract_inverted_index.based | 91 |
| abstract_inverted_index.class | 57 |
| abstract_inverted_index.first | 165 |
| abstract_inverted_index.pulse | 67 |
| abstract_inverted_index.space | 101 |
| abstract_inverted_index.state | 98 |
| abstract_inverted_index.until | 155 |
| abstract_inverted_index.using | 112 |
| abstract_inverted_index.where | 69 |
| abstract_inverted_index.domain | 111 |
| abstract_inverted_index.effect | 45 |
| abstract_inverted_index.ensure | 166 |
| abstract_inverted_index.inputs | 50 |
| abstract_inverted_index.linear | 34 |
| abstract_inverted_index.matrix | 116 |
| abstract_inverted_index.method | 4, 89, 183 |
| abstract_inverted_index.robust | 64 |
| abstract_inverted_index.scales | 31, 43 |
| abstract_inverted_index.second | 41 |
| abstract_inverted_index.state, | 172 |
| abstract_inverted_index.system | 195, 212 |
| abstract_inverted_index.appears | 197, 214 |
| abstract_inverted_index.applied | 48 |
| abstract_inverted_index.control | 8, 49, 66, 84, 133, 149, 180 |
| abstract_inverted_index.desired | 170 |
| abstract_inverted_index.improve | 152 |
| abstract_inverted_index.indexed | 19 |
| abstract_inverted_index.nuclear | 199 |
| abstract_inverted_index.present | 1 |
| abstract_inverted_index.problem | 191, 208 |
| abstract_inverted_index.product | 114 |
| abstract_inverted_index.quantum | 65 |
| abstract_inverted_index.suppose | 26 |
| abstract_inverted_index.systems | 16, 60 |
| abstract_inverted_index.uniform | 189 |
| abstract_inverted_index.varying | 23 |
| abstract_inverted_index.bilinear | 14, 54 |
| abstract_inverted_index.controls | 122 |
| abstract_inverted_index.dynamics | 128 |
| abstract_inverted_index.ensemble | 15, 29, 71, 97 |
| abstract_inverted_index.iterates | 136 |
| abstract_inverted_index.magnetic | 200 |
| abstract_inverted_index.minimize | 175 |
| abstract_inverted_index.programs | 143 |
| abstract_inverted_index.sequence | 140 |
| abstract_inverted_index.terminal | 171 |
| abstract_inverted_index.transfer | 12, 167, 190 |
| abstract_inverted_index.canonical | 188 |
| abstract_inverted_index.computing | 145 |
| abstract_inverted_index.dynamical | 59 |
| abstract_inverted_index.dynamics, | 38 |
| abstract_inverted_index.dynamics. | 55 |
| abstract_inverted_index.equations | 107 |
| abstract_inverted_index.evolution | 106 |
| abstract_inverted_index.formulate | 138 |
| abstract_inverted_index.function. | 181 |
| abstract_inverted_index.iteration | 157 |
| abstract_inverted_index.motivated | 62 |
| abstract_inverted_index.objective | 154 |
| abstract_inverted_index.open-loop | 6 |
| abstract_inverted_index.parameter | 30, 42, 100 |
| abstract_inverted_index.quadratic | 142 |
| abstract_inverted_index.splitting | 207 |
| abstract_inverted_index.synthesis | 9 |
| abstract_inverted_index.two-stage | 162 |
| abstract_inverted_index.Raman-Nath | 211 |
| abstract_inverted_index.converges. | 158 |
| abstract_inverted_index.correspond | 73 |
| abstract_inverted_index.intervals. | 126 |
| abstract_inverted_index.linearized | 131 |
| abstract_inverted_index.parameters | 72 |
| abstract_inverted_index.polynomial | 93 |
| abstract_inverted_index.resonance, | 201 |
| abstract_inverted_index.synthesis, | 68 |
| abstract_inverted_index.trajectory | 135 |
| abstract_inverted_index.ultra-cold | 216 |
| abstract_inverted_index.zero-order | 120 |
| abstract_inverted_index.Hamiltonian | 79 |
| abstract_inverted_index.computation | 163 |
| abstract_inverted_index.matter-wave | 206 |
| abstract_inverted_index.parameters. | 24 |
| abstract_inverted_index.uncertainty | 75 |
| abstract_inverted_index.Hamiltonian, | 85 |
| abstract_inverted_index.continuously | 22 |
| abstract_inverted_index.demonstrated | 185 |
| abstract_inverted_index.exponentials | 117 |
| abstract_inverted_index.homogeneous, | 33 |
| abstract_inverted_index.minimum-norm | 7 |
| abstract_inverted_index.successively | 130, 151 |
| abstract_inverted_index.approximation | 94 |
| abstract_inverted_index.computational | 3, 88 |
| abstract_inverted_index.corresponding | 118 |
| abstract_inverted_index.inhomogeneity | 81 |
| abstract_inverted_index.perturbations | 146 |
| abstract_inverted_index.respectively. | 86 |
| abstract_inverted_index.discretization | 103 |
| abstract_inverted_index.fixed-endpoint | 11 |
| abstract_inverted_index.inhomogeneous, | 53 |
| abstract_inverted_index.interferometry. | 218 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile |