The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal control theory for unitary transformations
Open accessAbstract
The dynamics of a quantum system driven by an external field is well described by a unitary transformation generated by a time-dependent Hamiltonian. The inverse problem of finding the field that generates a specific unitary transformation is the subject of study. The unitary transformation which can represent an algorithm in a quantum computation is imposed on a subset of quantum states embedded in a larger Hilbert space. Optimal control theory is used to solve the inversion problem irrespective of the initial input state. A unified formalism based on the Krotov method is developed leading to a different scheme. The schemes are compared for the inversion of a two-qubit Fourier transform using as registers the vibrational levels of the $X{}^{1}{\ensuremath{\Sigma}}_{g}^{+}$ electronic state of ${\mathrm{Na}}_{2}.$ Raman-like transitions through the $A{}^{1}{\ensuremath{\Sigma}}_{u}^{+}$ electronic state induce the transitions. Light fields are found that are able to implement the Fourier transform within a picosecond time scale. Such fields can be obtained by pulse-shaping techniques of a femtosecond pulse. Of the schemes studied, the square modulus scheme converges fastest. A study of the implementation of the Q qubit Fourier transform in the ${\mathrm{Na}}_{2}$ molecule was carried out for up to five qubits. The classical computation effort required to obtain the algorithm with a given fidelity is estimated to scale exponentially with the number of levels. The observed moderate scaling of the pulse intensity with the number of qubits in the transformation is rationalized.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Cited by
Monotonically convergent optimization in quantum control using Krotov’s method
Reich, D. M., Ndong, M., & Koch, C. P. (2012) · The Journal of Chemical Physics · doi:10.1063/1.3691827 · Cited by 220
Time-optimal unitary operations
Carlini, A., Hosoya, A., Koike, T., & Okudaira, Y. (2007) · Physical Review A · doi:10.1103/physreva.75.042308 · Cited by 126
Communication at the quantum speed limit along a spin chain
Murphy, M., Montangero, S., Giovannetti, V., & Calarco, T. (2010) · Physical Review A · doi:10.1103/physreva.82.022318 · Cited by 121
Optimal Protocols in Quantum Annealing and QAOA Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2020) · arXiv · doi:10.48550/arxiv.2003.08952 · Cited by 117
Magann, A. B., Arenz, C., Grace, M. D., Ho, T.-S., Kosut, R. L., McClean, J. R., Rabitz, H. A., & Sarovar, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010101 · Cited by 116
Metadata
- Authors
- Palao, J. P., & Kosloff, R.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2003-12-09
- Volume
- 68
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2035267156
- Cited by
- 313
- References
- 1
- FWCI
- 10.25
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal control theory for unitary transformations. https://app.cochat.ai/papers/10.1103/physreva.68.062308
- The paper
- Palao, J. P., & Kosloff, R. (2003). Optimal control theory for unitary transformations. Physical Review A. https://doi.org/10.1103/physreva.68.062308
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.