{"id":"928da38c-f3db-46ee-a958-d99f6c2626e4","arxiv_id":"2507.11536","paper_version":1,"verdict":"UNVERDICTED","confidence":"HIGH","novelty_score":1.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A 16-lesson course presenting the standard theory of quantum information, quantum algorithms, and quantum error correction with worked derivations.","lead":"This is a free, 16-lesson course on the theory of quantum computing, based on material originally published on IBM Quantum Learning. It explains the standard mathematics of quantum information, quantum algorithms, and quantum error correction through videos and written lessons.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: as educational exposition the document makes no original scientific claim; adopting Born-rule/projective measurements is an explicit pedagogical postulate, not a hidden correctness risk.","rationale":"The reader's verdict of UNVERDICTED is appropriate: this is a course text, not a research preprint, so it cannot be accepted or rejected on the strength of a new scientific claim. My independent stress-test focused on whether the conditional central claim—correctness as an introduction—is threatened by a hidden assumption or a mathematical error. The measurement-postulate concern raised by the reader does survive as an 'assumption,' but it is an explicit, standard axiom and is not a hidden load-bearing step; no derivation in the reviewed portion depends on a nonstandard or silently introduced rule. The worked examples that are visible (teleportation, superdense coding, CHSH, no-cloning, non-orthogonal discrimination) are mathematically sound. Thus an honest non-finding is warranted. The only genuinely unverified part is the bulk of the course (Lessons 5-16), which is not in the excerpted material; that is a scope limitation rather than a defect. If any checked protocol in the full text contains an algebraic error, the central claim would need revision; until then, UNVERDICTED stands.","tokens_in":62367,"tokens_out":8036,"duration_ms":97510,"concrete_test":"Symbolically evaluate the teleportation protocol of §4.1 with a computer algebra system: expand |π0⟩, apply the controlled-NOT and Hadamard circuits, and verify that in each of the four measurement branches the final state of qubit B is α|0⟩+β|1⟩ (and, in the general case, α|0⟩|γ0⟩+β|1⟩|γ1⟩); if any branch fails, the course contains a concrete error.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is conditional: if the course is correct, it provides a rigorous, accessible introduction. The submission explicitly identifies itself as a 'Director's Cut' of an existing IBM course, so there is no novel empirical or mathematical claim whose acceptance or rejection would be the subject of review. In the material available (Lessons 1-4, table of contents, preface), the worked derivations are internally consistent: the teleportation four-branch analysis, the superdense-coding Bell-state shifts, and the CHSH case-by-case probabilities all check against the stated identities. The reader's flagged weakest assumption—Born-rule probabilities and projective collapse—is genuinely an assumption, but it is not a load-bearing flaw: every quantum computing course must start from some formulation of the measurement postulates, the text states the rule explicitly in Lesson 1.2 and generalizes it in Lessons 9-11, and the protocols' internal correctness follows from those postulates rather than from an alternative hidden model. I therefore find no significant objection to the pedagogical claim. The only caveat is coverage: the full 16-lesson text is not excerpted here, so the correctness of Lessons 5-16 (especially Shor's algorithm and fault tolerance) has not been independently checked; that is a scope limitation, not an identified error.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This manuscript is a textbook-style course on the theory of quantum computing, consisting of a preface, a table of contents for 16 lessons in four units, and the full text of Lessons 1-4 (Single Systems, Multiple Systems, Quantum Circuits, Entanglement in Action). It develops the formalism of quantum states, measurements, unitary operations, tensor products, and entanglement, with worked proofs of the no-cloning theorem, the impossibility of perfect discrimination of non-orthogonal states, and detailed analyses of teleportation, superdense coding, and the CHSH game. The material is presented as an educational exposition with no new research claims; the measurement postulates are stated explicitly, and standard results such as Tsirelson's inequality are attributed to their originators.","tokens_in":62554,"tokens_out":44694,"duration_ms":431940,"significance":"Within the visible portion, the mathematical exposition is careful and internally consistent: the four-branch teleportation analysis, the Bell-state encoding of superdense coding, and the case-by-case CHSH calculation all check out against the stated definitions, and the no-cloning and state-discrimination proofs are valid. The course's explicit treatment of the Born rule and projective collapse as postulates, its transparent ordering conventions, and its worked derivations make it a potentially valuable rigorous introduction for advanced undergraduates and beginning graduate students. The adoption of the Born rule and projective collapse as postulates is explicit and is not a defect for a course at this level. If Lessons 5-16 maintain this standard, the full course would be a significant freely available educational resource. The manuscript makes no empirical or mathematical claims beyond established results, so its significance is pedagogical rather than research-oriented.","major_comments":[],"minor_comments":[{"comment":"The Set-up paragraph says 'together the two qubits (X, Y) are in the |ϕ+⟩ state'; this should refer to (A, B), since Alice's and Bob's qubits were named A and B in the preceding sentence.","section":"§4.3 (Set-up)"},{"comment":"In the paragraph on extending orthonormal sets to bases, the sentence 'The last n − m columns ban be filled' contains a typo; it should read 'can be filled'.","section":"§3.2"},{"comment":"The proof of the impossibility of perfect discrimination is presented for circuits consisting of unitary gates followed by a single standard-basis measurement. Since the section states the result in general terms, it would be helpful to note explicitly that this restriction is without loss of generality, citing the implementation of projective measurements in §3.2 and the standard possibility of deferring intermediate measurements.","section":"§3.3"},{"comment":"Tsirelson's bound is stated as the optimal quantum winning probability without proof or a visible citation. Please ensure the bibliography includes a precise reference, and consider adding a sentence indicating that the proof is beyond the scope of the lesson.","section":"§4.3"},{"comment":"The historical claim that Tsirelson 'first described the CHSH experiment as a game' would benefit from a citation; if no citation is available, consider softening the wording.","section":"§4.3"},{"comment":"The argument ruling out qubit transmission by classical communication alone is presented as an intuitive no-cloning argument. The text already notes that a formal proof uses quantum information theory; it may be worth flagging explicitly that the no-cloning argument is a heuristic account rather than a complete proof, so that readers do not mistake it for the full argument.","section":"§4.1"}],"recommendation":"minor_revision","confidential_remarks":"The submission is a course text, not a research paper. The visible lessons are technically sound and well-written. My positive assessment applies only to Lessons 1-4, as the remainder of the 16 lessons was not included in the material provided for review; if the journal is willing to accept an educational manuscript, I recommend minor revision. The editor may also wish to verify that the publication venue is appropriate for expository content."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This is a course, not a research paper, so I read it as that. The useful thing to know: it is a serious, clean, and unusually careful introduction to quantum information, now freely available as a Director's Cut of the IBM Quantum Learning course. The preface says it is mostly unchanged, which I take at face value.\n\nThe visible lessons (1–4) are excellent. The derivations are complete and correct: teleportation four-branch analysis, superdense coding Bell-state shifts, CHSH case-by-case probabilities, no-cloning, and the non-orthogonal state discrimination argument. The text is transparent about conventions like Qiskit's qubit ordering, and it explicitly names the measurement postulates it adopts (Born rule, projective collapse). That is not a hidden risk; every quantum computing course starts somewhere. Credit also goes to the proper attribution of Tsirelson's inequality and the historical remarks.\n\nSoft spots: only Lessons 1–4 were visible to me, plus the preface and table of contents. Lessons 5–16 (Shor, Grover, density matrices, channels, error correction, fault tolerance) are unverified in this submission. That is a scope limitation, not an identified error, but it means I cannot vouch for the whole course. As a research submission, there is no new result, so it cannot be accepted or rejected in the usual sense. The correct peer-review analogy is a careful editorial review of an educational artifact.\n\nIf I were a journal editor, I would not send this to research referees as a scientific paper. But as a course to be freely used by students and educators, it deserves a serious referee for correctness of the later lessons, especially fault tolerance. I would use it in teaching and point newcomers to it, but I would not cite it in a research paper for a technical result.","headline":"Free, well-built quantum computing course; nothing scientifically new, but the teaching craft and precision are real, and the visible math checks out.","tokens_in":63070,"tokens_out":2032,"would_cite":false,"duration_ms":28571,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68","81P45"],"pacs":["03.67.-a","03.67.Lx"],"model":"deepseek-v4-flash","headline":"This course claims that the full theory of quantum computing—from single-qubit state vectors through the core algorithms to density matrices, quantum channels, and fault-tolerant error correction—can be learned in one self-contained…","keywords":["quantum computing","quantum information","quantum circuits","entanglement","density matrices","quantum channels","quantum error correction","fault tolerance"],"falsifier":"A direct experimental check would be to prepare many copies of the plus state $|+\\rangle = (|0\\rangle + |1\\rangle)/\\sqrt2$, measure each in the standard basis, and test whether the outcome frequencies converge to $1/2$ each; a systematic deviation would contradict the Born rule on which the course's measurement analyses are built.","tokens_in":62128,"feed_emoji":"⚛️","tokens_out":7982,"duration_ms":100672,"temperature":0.7,"pith_summary":"This course sets out to demonstrate that the theory of quantum computing can be learned from first principles in a single, self-contained sequence of sixteen lessons. The sequence begins with quantum states as complex unit vectors and builds up through quantum circuits, the core algorithms, the density-matrix and channel formalism, and finally quantum error correction and fault tolerance. Its central claim is that this full arc is accessible to a reader with basic linear algebra, and that the delicate ideas—entanglement, measurement, and noise—can be presented through concrete mathematical objects rather than hand-waving. If the course succeeds on its own terms, it offers a rigorous public route into quantum information for learners who do not have access to university courses.","feed_headline":"Sixteen lessons take quantum computing from vectors to fault tolerance","feed_subtitle":"A self-contained course that starts with qubits and ends with stabilizer codes and the toric code.","key_machinery":"The load-bearing object is the quantum circuit model together with the simplified formulation of quantum information, in which states are unit vectors, operations are unitary matrices, and measurements are standard-basis or projective rules. This pair provides the derivational engine for the early lessons: every protocol is reduced to multiplying matrices and reading squared amplitudes. The later lessons replace the simplified formulation with density matrices and quantum channels precisely because the simplified version cannot describe the reduced state of one subsystem, and that replacement is what makes quantum error correction treatable. A second key object is the e-bit, the unit of entanglement embodied by the shared state $|\\phi^+\\rangle = (|00\\rangle + |11\\rangle)/\\sqrt2$, which the course uses to make teleportation, superdense coding, and the CHSH strategy concrete.","core_discovery":"On its own terms, the work claims that the whole of quantum information and computation admits a coherent pedagogical derivation from a small set of linear-algebraic structures: Dirac notation, tensor products, unitary operations, and projective measurements, later generalized to density matrices, quantum channels, and general measurements. The course argues that this simplified formulation is already enough to analyze teleportation, superdense coding, the CHSH game, the no-cloning theorem, and the impossibility of perfectly discriminating non-orthogonal states; the general formulation then supplies the tools needed for reduced states, noisy evolution, and error correction. Entanglement is treated as a concrete resource measured in e-bits, with the shared two-qubit state $|\\phi^+\\rangle = (|00\\rangle + |11\\rangle)/\\sqrt2$ as the unit that powers the protocols. The final claim is that the stabilizer formalism and the toric code turn abstract error correction into an explicit path to fault-tolerant computation.","pith_inferences":["A consequence the text leaves implicit: its ordering, with projective measurements before general measurements, could be tested against a density-matrix-first curriculum by comparing learners' ability to analyze teleportation and noisy states.","If the course's accessibility claim is right, then the main barrier to entering quantum computing is mathematical maturity rather than access to specialized teaching, which would make a self-contained open course a meaningful educational intervention; this is an inference, not something the text itself tests.","The CHSH game could serve as a compact diagnostic for whether a learner has genuinely understood entanglement: because the quantum advantage appears as a single number that lies strictly between the classical maximum and impossibility, a learner who can reproduce the derivation has mastered the relevant linear algebra."],"forward_implications":["A reader who masters the first four lessons can derive teleportation and superdense coding directly from unitary circuits and the shared entangled state, rather than taking them as black-box facts.","The no-cloning theorem and the impossibility of perfect discrimination of non-orthogonal states follow from linearity and inner products, so the same foundations that enable quantum protocols also delimit what they cannot do.","The CHSH analysis shows that a quantum strategy wins with probability $(2+\\sqrt2)/4 \\approx 0.85$, above the classical maximum of $3/4$, giving a concrete operational test of entanglement.","Once density matrices and channels are introduced, noise can be described within the same formalism, and the stabilizer formalism plus the toric code show how error correction can be made fault-tolerant."],"supporting_citations":[],"fun_headline_variants":["16 lessons from qubits to fault tolerance","From vectors to fault tolerance in 16 lessons","Quantum course: 16 lessons to fault-tolerant error correction","Learn Shor, Grover, and the toric code in 16 lessons","Quantum computing from vectors to fault tolerance in 16 lessons"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The course rests on the standard measurement postulate that when a quantum system is measured, each outcome appears with probability equal to the squared amplitude and the system is left in the corresponding projected state; every protocol and algorithm analysis in the course inherits this assumption.","fun_headline_variants_meta":{"raw":{"variants":["16 lessons from qubits to fault tolerance","From vectors to fault tolerance in 16 lessons","Quantum course: 16 lessons to fault-tolerant error correction","Learn Shor, Grover, and the toric code in 16 lessons","Quantum computing from vectors to fault tolerance in 16 lessons"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001557,"raw_usage":{"total_tokens":6148,"prompt_tokens":798,"completion_tokens":5350,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":414,"completion_tokens_details":{"reasoning_tokens":5269}},"tokens_in":414,"tokens_out":5350,"duration_ms":43871,"temperature":1.0,"reasoning_tokens":5269,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:06:33.091755+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct experimental check would be to prepare many copies of the plus state $|+\\rangle = (|0\\rangle + |1\\rangle)/\\sqrt2$, measure each in the standard basis, and test whether the outcome frequencies converge to $1/2$ each; a systematic deviation would contradict the Born rule on which the course's measurement analyses are built.","supporting_citations":[],"review_version":1}