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

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

Spin-valley lifetimes in a silicon quantum dot with tunable valley splitting

Open access
Yang, C. H., Rossi, A., Ruskov, R., Lai, N. S., Mohiyaddin, F. A., Lee, S., Tahan, C., Klimeck, G., Morello, A., Dzurak, A. S.·2013·Nature Communications

Abstract

Although silicon is a promising material for quantum computation, the degeneracy of the conduction band minima (valleys) must be lifted with a splitting sufficient to ensure the formation of well-defined and long-lived spin qubits. Here we demonstrate that valley separation can be accurately tuned via electrostatic gate control in a metal–oxide–semiconductor quantum dot, providing splittings spanning 0.3–0.8 meV. The splitting varies linearly with applied electric field, with a ratio in agreement with atomistic tight-binding predictions. We demonstrate single-shot spin read-out and measure the spin relaxation for different valley configurations and dot occupancies, finding one-electron lifetimes exceeding 2 s. Spin relaxation occurs via phonon emission due to spin–orbit coupling between the valley states, a process not previously anticipated for silicon quantum dots. An analytical theory describes the magnetic field dependence of the relaxation rate, including the presence of a dramatic rate enhancement (or hot-spot) when Zeeman and valley splittings coincide. The presence of multiple minima, or valleys, in the conduction band of group IV semiconductors can be a problem for spin-based quantum computing, but can also enable alternative qubit implementations. Yang et al. demonstrate electrostatic control of the valleys’ energy splitting in a silicon quantum dot.

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.1038/ncomms3069

Cites

2 of 2 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

Cited by

See all 299

Metadata

Authors
Yang, C. H., Rossi, A., Ruskov, R., Lai, N. S., Mohiyaddin, F. A., Lee, S., Tahan, C., Klimeck, G., Morello, A., & Dzurak, A. S.
Venue
Nature Communications
Published
2013-06-27
Volume
4
Issue
1
Pages
2069-2069
ISSN
2041-1723 (ISSN-L)
OpenAlex
W1998025105
Cited by
299
References
2
FWCI
9.77
Type
journal article
Language
en
Open access
bronze

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.