양자 컴퓨팅 입문 가이드.
0%
메뉴
양자란 무엇인가? 기술 다양한 양자 컴퓨터 세상을 바꾸다 보안 이야기 투자 현황 학습 (커리큘럼) 기업들 응용 분야 용어집 타임라인 주장 평가하기 강좌 Quantum, But Friendly Inside a Quantum Computer Quantum in the Real World Quantum Computing Foundations Quantum Circuits, Algorithms, and Industry Fault-Tolerant Quantum Computing and Technical Strategy 내 학습 진도 뉴스 자주 묻는 질문 추가 자료 양자 질문하기 AI 에이전트 ★ 저장됨
소개 소개 방법론 문의 면책 조항
내 학습 진도
0%

양자 입문자

전체 진도 보기
진도 저장하기

Progress lives in this browser and is lost if you log out or clear it: unless you save it with your email. Same email on any device = same progress.

다크 모드

가이드 보기
처음이신가요? 학습하면서 쉬운 언어로 된 힌트와 설명을 추가로 제공합니다. 동일한 강좌에 도움말이 함께 담겨 있습니다.

전문가 보기
You just want the lessons: clean, fast and compact, with no extra reminders. This is the default view.

인터페이스 언어

타임라인

이 분야의 연표로, 모든 항목에 근거 태그와 1차 출처가 붙어 있습니다. 신뢰하는 근거 수준으로 필터링하세요.

1981

Feynman argues nature should be simulated quantum-mechanically Peer-reviewedPeer-reviewed: Published in a refereed venue. Int. J. Theor. Phys. 21, 467 (1982) ↗

Richard Feynman's 'Simulating Physics with Computers' keynote frames the founding argument: exact classical simulation of quantum systems scales badly, so use a quantum machine.

1994

Shor's algorithm Peer-reviewedPeer-reviewed: Published in a refereed venue. Proc. 35th FOCS (1994) ↗

Peter Shor shows a quantum computer could factor integers and take discrete logarithms efficiently: the result that ties quantum computing to cryptography forever.

1996

Grover's search algorithm Peer-reviewedPeer-reviewed: Published in a refereed venue. Proc. 28th STOC (1996) ↗

Lov Grover proves a quadratic quantum speedup for unstructured search: broad, real, and much more modest than exponential.

2019

Google claims quantum supremacy on a sampling benchmark DisputedDisputed: A credible published challenge exists. Nature 574, 505 (2019); challenge: IBM Research blog, Oct 2019 ↗

A 53-qubit processor performs a contrived sampling task claimed to be classically infeasible. IBM published a credible challenge to the classical-runtime estimate: the canonical example of why benchmark claims need scrutiny.

2022

Nobel Prize for entanglement experiments OfficialOfficial: Standards body or institutional primary source. NobelPrize.org ↗

Aspect, Clauser and Zeilinger honored for Bell-test experiments establishing that entanglement's 'spookiness' is physically real.

2023–2024

The logical-qubit era begins Peer-reviewedPeer-reviewed: Published in a refereed venue. e.g. Google Quantum AI, Nature 638, 920 (2024) ↗

Multiple groups demonstrate error-corrected logical qubits improving as code size grows — the 'below threshold' behavior the field considers its honest scoreboard.

Aug 13, 2024

NIST publishes the first post-quantum encryption standards OfficialOfficial: Standards body or institutional primary source. NIST CSRC announcement ↗

FIPS 203 (ML-KEM), FIPS 204 (ML-DSA) and FIPS 205 (SLH-DSA) are approved: the starting gun for the worldwide cryptography migration.

2025

NIST selects HQC as an additional PQC algorithm OfficialOfficial: Standards body or institutional primary source. NIST PQC project ↗

A code-based backup encryption algorithm joins the standardization portfolio, diversifying beyond lattices.

범례: Peer-reviewed Preprint Vendor Disputed Analyst Official : 태그는 색상에만 의존하지 않으며, 각각 고유한 기호를 포함합니다.

Quantum, But Friendly

How Small Is Small?The Spinning CoinBit vs QubitSpooky Friends 최종 테스트

Inside a Quantum Computer

The Golden ChandelierHow It ThinksGood At, Bad At 최종 테스트

Quantum in the Real World

Quantum You Already OwnThe Great Quantum RaceFollowing the Quantum Money 최종 테스트

아카데미

Quantum Computing FoundationsQuantum Circuits, Algorithms, and IndustryFault-Tolerant Quantum Computing and Technical Strategy 전체 커리큘럼

빠른 답변

용어집자주 묻는 질문 추가 자료양자 질문하기 양자 뉴스