CoChat

Optimal control of entangling operations for trapped-ion quantum computing

Open access
Nebendahl, V., Häffner, H., Roos, C. F. · 2009 · Physical Review A
Cited by 84

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

Abstract

Optimal control techniques are applied for the decomposition of unitary quantum operations into a sequence of single-qubit gates and entangling operations. To this end, we modify a gradient-ascent algorithm developed for systems of coupled nuclear spins in molecules to make it suitable for trapped-ion quantum computing. We decompose unitary operations into entangling gates that are based on a nonlinear collective spin operator and complemented by global spin flip and local light shift gates. Among others, we provide explicit decompositions of controlled-NOT and Toffoli gates, and a simple quantum error correction protocol.

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.79.012312

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

Research works printed but not linked: 17

  1. M. A. Nielsen, 2000, Quantum Computation and Quantum Information
  2. 10.1038/nature07125 · DOI · Paper page
  3. 10.1103/PhysRevA.60.145 · DOI · Paper page
  4. 10.1007/s00340-003-1346-9 · DOI · Paper page
  5. 10.1038/nature01492 · DOI · Paper page
  6. 10.1038/35005011 · DOI · Paper page
  7. 10.1038/nphys961 · DOI · Paper page
  8. M. A. Rowe, 2002, Quantum Inf. Comput., 2, 257
  9. 10.1103/PhysRevLett.89.157901 · DOI · Paper page
  10. 10.1103/PhysRevA.68.062308 · DOI · Paper page
  11. 10.1088/0953-4075/40/9/S06 · DOI · Paper page
  12. 10.1103/PhysRevLett.99.170501 · DOI · Paper page
  13. 10.1103/PhysRevA.77.052333 · DOI
  14. 10.1103/PhysRevA.77.052334 · DOI · Paper page
  15. 10.1103/PhysRevLett.97.050501 · DOI · Paper page
  16. 10.1126/science.1130886 · DOI · Paper page
  17. 10.1038/35042541 · DOI · Paper page

Cited by

See all 84

Metadata

Authors
Nebendahl, V., Häffner, H., & Roos, C. F.
Venue
Physical Review A
Published
2009-01-13
Volume
79
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2110391970
Cited by
84
References
8
FWCI
8.31
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

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.