qubitsok.com

Cut Noise. Work Quantum.

Back to Job Listings

Americas, United States, Yorktown Heights

Posted 110 days ago

Intern 2026: Fault-tolerant quantum algorithms - 68009 - IBM

🏢 IBM

AI Summarised
Visit Website

Role Type

🧪 Scientist / Researcher

Role Focus

🛠️ Advance Science

Seniority

🌱 Internship / Entry-Level
🌸 PhD / Postdoc

Employer Type

🏢 Industry

This internship seeks a researcher to design quantum algorithms for solving useful problems, focusing specifically on fault-tolerant systems. Responsibilities include quantifying the run-time and gate complexity of the developed algorithms and rigorously comparing their performance against classical state-of-the-art methods. The intern is also expected to disseminate their findings by publishing research in reputable journals and presenting their work at scientific conferences.

Key Responsibilities

Design effective quantum algorithms tailored for solving practical problems.

Quantify the run-time or gate complexity of the developed algorithms.

Analyze and compare the performance of quantum algorithms against current state-of-the-art classical algorithms.

Publish research findings in reputable scientific journals.

Present research work at relevant conferences.

Required Skills

Must be a PhD candidate in computer science, physics, mathematics, electrical engineering, or an equivalent field.

Experience designing quantum algorithms specifically for fault-tolerant quantum computers.

Experience quantifying the worst-case performance of algorithms.

Nice-to-have Skills

Master's Degree (Preferred education)

Technology Tags

Quantum Computing

The intern is required to design quantum algorithms for useful problems.

Algorithms

The primary responsibility is designing novel quantum algorithms for practical applications.

Fault-tolerant

The role explicitly requires experience designing algorithms suitable for fault-tolerant quantum computers.

Complexity theory

The candidate must quantify the run-time, gate complexity, and worst-case performance of algorithms, which is the domain of complexity theory.

Error correction

Designing algorithms for fault-tolerant systems fundamentally requires understanding quantum error correction techniques.

Qubits & gates

Quantifying gate complexity requires deep knowledge of fundamental qubits and quantum gates.

Classical programming

The candidate must understand and compare their quantum algorithms against state-of-the-art classical algorithms.

Is this your company's listing?

Boost it to the top of search results and reach 497+ newsletter subscribers.

Promote This Job