Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in value between...
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Thevinin's Theorem01:15

Thevinin's Theorem

Thévenin's theorem plays a pivotal role in electrical circuit analysis, offering a solution to the challenges posed by variable loads within a circuit. In practical applications, it is common to encounter circuits where certain elements remain fixed while others fluctuate, often referred to as the "load." A typical household electrical outlet serves as a prime example of a variable load, as it can be connected to a variety of appliances, each with its own unique electrical characteristics.
Second Uniqueness Theorem01:16

Second Uniqueness Theorem

Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Norton's Theorem01:14

Norton's Theorem

Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the one depicted in...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Time-crystalline eigenstate order on a quantum processor.

Nature·2021
Same author

Information scrambling in quantum circuits.

Science (New York, N.Y.)·2021
Same author

Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact.

Scientific reports·2017
Same author

Blueprint for a microwave trapped ion quantum computer.

Science advances·2017
Same author

Synthesis of Arbitrary Quantum Circuits to Topological Assembly.

Scientific reports·2016
Same author

Surface code implementation of block code state distillation.

Scientific reports·2013
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Related Experiment Video

Updated: May 16, 2026

Theoretical Calculation and Experimental Verification for Dislocation Reduction in Germanium Epitaxial Layers with Semicylindrical Voids on Silicon
06:57

Theoretical Calculation and Experimental Verification for Dislocation Reduction in Germanium Epitaxial Layers with Semicylindrical Voids on Silicon

Published on: July 17, 2020

Proof of finite surface code threshold for matching.

Austin G Fowler1

  • 1Centre for Quantum Computation and Communication Technology, School of Physics, The University of Melbourne, Melbourne, Victoria 3010, Australia.

Physical Review Letters
|December 11, 2012
PubMed
Summary
This summary is machine-generated.

This study proves the experimental feasibility of quantum computation using the surface code. Reliable quantum computation is achievable with physically reasonable error rates on a 2D qubit lattice.

Related Experiment Videos

Last Updated: May 16, 2026

Theoretical Calculation and Experimental Verification for Dislocation Reduction in Germanium Epitaxial Layers with Semicylindrical Voids on Silicon
06:57

Theoretical Calculation and Experimental Verification for Dislocation Reduction in Germanium Epitaxial Layers with Semicylindrical Voids on Silicon

Published on: July 17, 2020

Area of Science:

  • Quantum Information Science
  • Quantum Error Correction
  • Computational Complexity

Background:

  • Quantum computation requires robust error correction due to qubit fragility.
  • The surface code offers a promising approach using a 2D qubit lattice and nearest-neighbor interactions.
  • Previous feasibility proofs relied on unrealistic assumptions like high-order operator measurements or unphysical interaction properties.

Purpose of the Study:

  • To formally prove the experimental feasibility of quantum computation under physically realistic conditions.
  • To establish a practical error threshold for reliable quantum computation using the surface code.
  • To address limitations of prior theoretical models for quantum error correction.

Main Methods:

  • Analysis of quantum error correction using the surface code on a 2D lattice.
  • Theoretical proof for arbitrarily reliable quantum computation with nearest-neighbor two-qubit gates.
  • Inclusion of realistic single-qubit gates (measurement, initialization, unitary) with a general error rate 'p'.

Main Results:

  • Demonstrated that arbitrarily reliable quantum computation is possible with the surface code.
  • Established a critical error rate threshold of p < 7.4 × 10(-4) for experimental feasibility.
  • Overcame limitations of previous models by using only nearest-neighbor interactions and realistic gate error rates.

Conclusions:

  • The experimental feasibility of quantum computation is formally proven under physically reasonable assumptions.
  • The established error threshold is achievable by current experimental standards.
  • This work resolves a long-standing open problem in the field of quantum error correction.