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

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

Realizing a robust practical Majorana chain in a quantum-dot-superconductor linear array

Open access
Sau, Jay D., Sarma, S. Das·2012·Nature Communications
DOI 10.1038/ncomms1966
Open this paper in CoChat — free account

Abstract

Semiconducting nanowires in proximity to superconductors are promising experimental systems for realizing the elusive Majorana fermions, which, because of their non-Abelian anyonic braiding statistics, may ultimately be used as building blocks for topological quantum computers. A serious challenge in the experimental realization of the Majorana fermions is the suppression of topological superconductivity by disorder together with the tunability of carrier density for semiconductors in close proximity to superconductors. Here we show that Majorana fermions that are protected by a disorder robust topological gap can occur at the ends of a chain of gate-tunable quantum dots connected by s-wave superconductors. Such an array of quantum dots provides the simplest realization of Majorana fermions in systems as simple as a few quantum dot array. The proposed system provides a very practical and easily realizable experimental platform for the observation of non-Abelian Majorana modes. Majorana fermions—the particles renowned for being their own antiparticles—have been proposed as candidates for storing qubits for quantum computers. Sau and Das Sarma propose a method for creating stable Majorana fermions in an array of quantum dots.

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/ncomms1966

Cites

34 of 34 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 260

Metadata

Authors
Sau, J. D., & Sarma, S. D.
Venue
Nature Communications
Publisher
Springer Science and Business Media LLC
Published
2012-07-17
Volume
3
Issue
1
Pages
964-964
ISSN
2041-1723 (ISSN-L)
DOI
10.1038/ncomms1966
OpenAlex
W2024459022
Cited by
260
References
34
FWCI
9.30
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.