ESP32-S3 Bench Guide
ESP32‑S3 N16R8 벤치 가이드: 실시간 핀아웃, 강의, 시뮬레이터 및 벤치 로그
개인 계정의 공개 저장소 소유자는 GitHub로 로그인해 운영자를 확인하고 소개를 직접 관리할 수 있습니다. 관리자 승인은 필요하지 않습니다.
로그인한 뒤 확인 파일을 만들어 이 저장소의 기본 브랜치에 30분 안에 커밋해 주세요. 다른 브랜치나 포크의 파일은 인정하지 않습니다. 파일을 올린 뒤 아래에서 확인하면 관리자 승인 없이 관리할 수 있습니다. 자격을 유지하려면 파일을 남겨 두세요.
로그인이 필요하면 로그인 화면으로 이동합니다. 로그인 후 이곳으로 돌아와 원하는 확인 버튼을 다시 눌러 주세요.
프로젝트 폴더에서 /nomorevibe verify를 실행하면 소유권을 확인하고 소개를 직접 관리할 수 있습니다.
1분 만에 확인하기Quantum games and the fun-with-quantum.org family portal — quantum computing to play, build & learn
저장소 README에서 가져옴
README 전체를 불러오는 중입니다. 아래는 저장된 발췌입니다.
"Fun with Quantum" is a collection of Jupyter notebooks that highlight specific aspects of Quantum Computing that are interesting and/or fun.
1. Quantum Coin Game (superposition & interference)
2. Solving logic puzzles with Grover's search (Boolean satisfiability, 3-SAT)
3. (merged into 2)
4. Hardy's Paradox (three certain facts, one impossible outcome — that happens anyway)
5. GHZ Game (entanglement)
6. GHZ Game on real devices
7. Mermin-Peres Magic Square (entanglement beats every classical strategy)
8. CHSH Game (the Bell test: 85% with entanglement, 75% without)README 전문 보기 ↗Quantum computing taught through games: Jupyter notebooks, written with Qiskit, in which superposition, interference and entanglement are the tricks that win the game. Play first, then pull back the curtain and see the circuit.
More games, and the family of projects around them: fun-with-quantum.org.
| Game | What it shows | Launch |
|---|---|---|
| 1. Quantum Coin Game | superposition, interference | ▶ Open · Binder · View |
| 2. GHZ Game | entanglement | ▶ Open · Binder · View |
| 3. The CHSH Game | the Bell test: 85% with entanglement, 75% without | ▶ Open · Binder · View |
| 4. Mermin–Peres Magic Square | entanglement beats every classical team | ▶ Open · Binder · View |
| 5. Hardy's Paradox | three certain facts, one impossible outcome — that happens anyway | ▶ Open · Binder · View |
| 6. The Quantum Prisoner's Dilemma | quantum game theory — and its catch | ▶ Open · Binder · View |
| 7. 3-SAT with Grover's Algorithm | Grover search, Boolean satisfiability (3-SAT) | ▶ Open · Binder · View |
| 8. GHZ on Real Quantum Devices | noise, transpiler, readout error mitigation | ▶ Open · Binder · View |
▶ Open starts a free Jupyter session on mybinder.org through QuBins, with Qiskit preinstalled — no install, no account. Starting it can take a few minutes. Games 1–7 open as slideshows (how to use them); game 8 opens as a regular notebook. Binder builds this repository's own environment instead, which can take longer. View shows the notebook on GitHub without running it.
A quantum coin game that illustrates the power of quantum superposition and interference — two players take turns turning a hidden coin or leaving it as it is, and the player who may also use a Hadamard gate can win every time. Implemented by Jan-R. Lahmann using Qiskit, binder and RISE.
Play it right in your browser — no Jupyter, in seven languages: fun-with-quantum.org/play/quantum-coin-game.
Inspired by the TED talk of Shohini Ghose "Quantum computing explained in 10 minutes". The math behind the game: these charts.
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
A quantum game that illustrates the power of quantum entanglement: three players answer questions about colors and shapes without talking. No classical team wins every round; sharing three entangled qubits in a GHZ state, they always do. Implemented by Isabell Heider using Qiskit.
For an introduction to the GHZ Game, take a look at this presentation by Jana Foehlisch.
Play it right in your browser — no Jupyter: fun-with-quantum.org/play/ghz-game.
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
The best-known nonlocal game and the Bell test behind the 2022 Nobel Prize in Physics. Alice and Bob each get a random bit and answer with a bit, without talking; they win if their answers differ exactly when both bits are 1. No classical strategy wins more than 75% of the rounds; sharing one entangled qubit pair and measuring along well-chosen angles, they win cos²(22.5°) ≈ 85.4% — the most quantum mechanics allows (Tsirelson's bound). The notebook tries all 16 classical tables, plays the quantum strategy in Qiskit, lets you turn the measurement angles yourself, and shows why 75% and 85.4% are the limits. Based on Clauser, Horne, Shimony and Holt (1969); see also IBM Quantum Learning's CHSH game lesson. Notebook by Jan-R. Lahmann (2026), generated by tools/build_chsh.py.
Play it right in your browser — no Jupyter: fun-with-quantum.org/play/chsh-game.
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
Alice and Bob, in separate rooms, each fill in one row or column of a 3×3 square of 0s and 1s under parity rules that no square of numbers can satisfy — the best classical team wins 8 of 9 questions. Sharing two entangled qubit pairs, they win every round. The notebook lets you hunt for a magic square yourself, brute-forces every classical strategy, then builds and runs the quantum circuits for all nine questions. An appendix plays the game on simulated copies of six IBM quantum computers (fake backends) with readout error mitigation, and optionally on a real one. Original version by David Drexlin & Jan-R. Lahmann (2021), rebuilt in 2026 with Qiskit (generated by tools/build_mermin_peres.py); inspired by the Qiskit blog post This Proof Demonstrates a Quantum Advantage, Even for Noisy Quantum Computers.
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
Two cars leave a factory; far apart, two inspectors each check a car's color or its engine. Three facts hold every single time — and by simple logic they rule out two diesel cars. Classical cars (any spec sheets, even random ones) obey that logic; quantum cars — two entangled qubits — still come out both diesel 1 time in 12 when both inspectors check the engine, and up to (5√5 − 11)/2 ≈ 9% with the best measurement angle. The notebook tries all classical spec sheets, builds the quantum factory in Qiskit, shows where the logic fails ("unperformed experiments have no results") and finds the 9% maximum. Based on Lucien Hardy (1992, 1993) and a former chapter of the Qiskit Textbook. Original version by Jan-R. Lahmann (2020) and Bengt Wegner (2022), rebuilt in 2026 (generated by tools/build_hardy.py).
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
The classic dilemma of game theory: defecting pays more whatever the other player does, so rational players end at 1 point each instead of 3. In the quantum version of Eisert, Wilkens and Lewenstein (1999), a referee entangles the players' qubits and a new quantum move Q makes (Q, Q) an equilibrium worth 3 each — the dilemma disappears. The notebook builds the game in Qiskit, maps the payoffs and searches for equilibria — and then shows the catch found by Benjamin and Hayden (2001): with every one-qubit move allowed, each move has a counter, so equilibria exist only with random (mixed) strategies — for example both players choosing completely at random, worth 2.25 points each. Notebook by Jan-R. Lahmann (2026), generated by tools/build_pd.py.
Play it: ▶ Open on QuBins · fallback: Binder · view the notebook
Starts with the whole quantum program — the formula plus seven lines of Qiskit — then builds Grover's quantum search algorithm step by step from Qiskit 2 building blocks and uses it on two puzzles: a party guest list that keeps everybody happy, and a classic 3-SAT formula given in DIMACS format. Explains oracle, diffuser and the √N speed-up, checks the answers classically, and lets you enter your own puzzle. (Rebuilt in 2026 from two Qiskit Aqua–era notebooks, which it replaces; generated by tools/build_3sat.py.)
Try it: ▶ Open on QuBins · fallback: Binder · view the notebook
How noise costs the quantum team rounds of the GHZ game, and how to win them back. The notebook plays the game on simulated copies of six IBM quantum computers (fake backends with noise from a calibration snapshot of each device), chooses good qubits by hand and with the Qiskit transpiler, and corrects readout errors with a calibration matrix. An appendix runs the same experiment on a real IBM quantum computer (free IBM Quantum Platform account). Implemented by Lennart Schulze and Jan-R. Lahmann (2020), rebuilt for Qiskit 2.x in 2026 (generated by tools/build_ghz_real.py).
Run it: ▶ Open on QuBins · fallback: Binder · view the notebook
git clone https://github.com/JanLahmann/Fun-with-Quantum
cd Fun-with-Quantum
conda env create -f environment.yml # Python 3.11, Qiskit 2.x, classic Notebook + RISE
conda activate Qiskitenv
jupyter notebook
Checks (also run by GitHub Actions on every pull request and weekly): python tools/run_notebooks.py runs every notebook headless and stops at the first error (.github/workflows/notebooks.yml does this on Qiskit 2.5, as on QuBins, and on the newest Qiskit, and checks that the generated notebooks match their builders in tools/); .github/workflows/links.yml checks every link in this README, in the notebooks and on the portal. python tools/check_numbers.py checks that every percentage, decimal number and fraction in the notebooks, this README and the portal is reproduced by a computation (or listed with a reason).
The games open as RISE slideshows:
A sister project: RasQberry, a Raspberry Pi–based model of a quantum computer for meetups, classrooms and demo booths — see RasQberry Two and the original RasQberry.
An overview of serious games for quantum computing, using several quantum games that make superposition, interference and entanglement tangible for beginners, and a first look at noise and error mitigation on real quantum computers. Start with these slides, then play the Quantum Coin Game, the GHZ Game and the GHZ on Real Quantum Devices.
The tutorial at the IEEE International Conference on Quantum Computing and Engineering (QCE20) used the Quantum Coin Game (part 2), the GHZ Game (part 3.1) and the GHZ on Real Quantum Devices (part 3.2). Recordings of the three one-hour sessions: part 1, part 2, part 3; the agenda.
Jan-R. Lahmann, https://www.linkedin.com/in/JanLahmann
These games are the home of Fun with Quantum, a family of open-source quantum outreach projects: RasQberry Two · RasQberry One · Quantego · Qutie · Qoffee-Maker · Entangible · CertiQ · QuBins · doQumentation · QAMPoser.
God does play dice. Come play, build, learn.