Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 343

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Quantum Computing by an Optimal Control Algorithm for Unitary Transformations

Open access
Palao, José P., Kosloff, Ronnie·2002·Physical Review Letters

Abstract

Quantum computation is based on implementing selected unitary transformations representing algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is independent of the physical implementation of the quantum computer and it is illustrated for one and two qubit gates in model molecular systems, where only part of the Hilbert space is used for computation.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.89.188301

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 343

Metadata

Authors
Palao, J. P., & Kosloff, R.
Venue
Physical Review Letters
Published
2002-10-14
Volume
89
Issue
18
Pages
188301-188301
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2036795049
Cited by
343
References
1
FWCI
12.04
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: Quantum Computing by an Optimal Control Algorithm for Unitary Transformations. https://app.cochat.ai/papers/10.1103/physrevlett.89.188301
The paper
Palao, J. P., & Kosloff, R. (2002). Quantum Computing by an Optimal Control Algorithm for Unitary Transformations. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.188301

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.