Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Atomic Quantum Processors and the Error-Correction Frontier

Simons Institute via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the cutting-edge development of quantum computing through reconfigurable arrays of neutral atoms in this 33-minute conference talk from Quantum Industry Day 2025. Delve into how quantum computers, while opening new scientific avenues for exploring complex quantum mechanical systems and computational paradigms, face the fundamental challenge of decoherence and how this can be prevented through highly entangled states of physical qubits that encode error-corrected "logical" qubits. Learn about quantum processing based on coherent transport of atoms shuttled by optical tweezers, which enables any-to-any connectivity, high-fidelity programmable logic, and mid-circuit processing within a zoned architecture. Discover how logical qubit processing benefits from parallel control and transversal operations, facilitating experiments ranging from entangling logical qubits to their use for precise simulation of quantum scrambling. Examine the core physical mechanisms for achieving deep-circuit, universal algorithms with logical qubits and how these are leveraged into new techniques that significantly reduce overheads for large-scale computation. Understand how these results, alongside other recent advances, herald a transition to error-corrected quantum processing and establish foundations that can enable future large-scale quantum computers and their practical applications.

Syllabus

Atomic Quantum Processors and the Error-Correction Frontier

Taught by

Simons Institute

Reviews

Start your review of Atomic Quantum Processors and the Error-Correction Frontier

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.