CoChat

Dressing the chopped-random-basis optimization: A bandwidth-limited access to the trap-free landscape

Open access
Rach, N., Müller, M. M., Calarco, T., Montangero, S. · 2015 · Physical Review A
Cited by 137

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

Abstract

The convergence of quantum control strategies can be undermined by the presence of local minima in the optimization landscape. In this work, a bandwidth-limited optimal control algorithm is shown to offer a way to tailor this landscape, thus circumventing the problem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1103/physreva.92.062343

Cites

8 of 8 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 8 references

Cited by

See all 137

Metadata

Authors
Rach, N., Müller, M. M., Calarco, T., & Montangero, S.
Venue
Physical Review A
Published
2015-12-30
Volume
92
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2594744993
Cited by
137
References
8
FWCI
8.13
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: Dressing the chopped-random-basis optimization: A bandwidth-limited access to the trap-free landscape. https://app.cochat.ai/papers/10.1103/physreva.92.062343
The paper
Rach, N., Müller, M. M., Calarco, T., & Montangero, S. (2015). Dressing the chopped-random-basis optimization: A bandwidth-limited access to the trap-free landscape. Physical Review A. https://doi.org/10.1103/physreva.92.062343

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.