The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Design aspects of superconducting-phase quantum bits
Abstract
A superconducting-phase quantum bit (qubit) involves three or more Josephson junctions combined into a superconducting loop and defines one of the promising solid-state device implementations for quantum computing. Recently, so called $\ensuremath{\pi}$ junctions, Josephson junctions with a ground state characterized by a \ensuremath{\pi}-phase shift across, have attracted much attention. We show how to make use of such $\ensuremath{\pi}$ junctions in the construction of superconducting phase qubits and discuss the advantage over conventional designs based on magnetically frustrated loops. Starting from a basic five-junction loop with one $\ensuremath{\pi}$ junction, we show how to construct effective junctions with degenerate minima characterized by phase shifts 0 and $\ensuremath{\pi}$ and superconducting-phase switches. These elements are then combined into a superconducting-phase qubit which operates exclusively with switches, thus avoiding permanent contact with the environment through external biasing. The resulting superconducting-phase qubits can be understood as the macroscopic analog of the ``quiet'' s-wave--d-wave--s-wave Josephson-junction qubits introduced by Ioffe et al. [Nature (London) 398, 679 (1999)].
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.
Integrity signals
Registry
Cites
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.
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
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Cited by
Quantum-state engineering with Josephson-junction devices
Makhlin, Y., Schön, G., & Shnirman, A. (2001) · Reviews of Modern Physics · doi:10.1103/revmodphys.73.357 · Cited by 2,508
The current-phase relation in Josephson junctions
Golubov, A. A., Kupriyanov, M. Y., & Il’ichev, E. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.411 · Cited by 1,423
Quantum information processing with superconducting qubits in a microwave field
You, J. Q., & Nori, F. (2003) · Physical Review B · doi:10.1103/physrevb.68.064509 · Cited by 376
Metadata
- Authors
- Blatter, G., Geshkenbein, V. B., & Ioffe, L. B.
- Venue
- Physical Review B
- Publisher
- American Physical Society (APS)
- Published
- 2001-04-11
- Volume
- 63
- Issue
- 17
- ISSN
- 0163-1829 (ISSN-L)
- 1095-3795
- OpenAlex
- W2026868632
- Cited by
- 181
- References
- 6
- FWCI
- 18.40
- Type
- journal article
- Language
- en
- Open access
- closed
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.