{"id":"d55b2180-bb0d-429e-a211-e4be48ef7dcf","arxiv_id":"2412.06145","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":2.0,"correctness_risk":"high","formal_verification":"none","parameter_count":3,"one_line_summary":"QOSTBC-based qubit mapping is claimed to outperform stabilizer codes, but the supporting simulation tables are internally inconsistent and report over 100 percent error correction.","lead":"This paper claims that quasi-orthogonal space-time block codes, combined with quaternion orthogonal designs, correct quantum errors more efficiently than standard stabilizer codes in several qubit-mapping configurations. The supporting simulations report correction rates above 100 percent, which would mean correcting more errors than occur, and the tables for two different configurations are identical.","discovery_kind":"unclear","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The headline numerical claim is internally impossible: Tables 2–5 list QOSTBC corrected counts that are non-integer and exceed detected errors, so the claimed >100% correction rate cannot describe a real QEC simulation.","rationale":"The reader's verdict of REJECT is correct, but the most load-bearing problem is even more direct than the one singled out in the reader's weakest-assumption field. The reader highlighted the invalid theoretical step E(|error>) -> 0 in Section 2.3.2, which is a genuine and serious flaw. However, the simulation tables themselves are internally impossible: corrected-error counts are non-integer and systematically exceed the number of errors injected, which no legitimate QEC simulation can produce. This alone decisively undermines the abstract's central claim that QOSTBCs 'can correct more errors than those detected, achieving over 100% correction rates.' If the tables are instead meant to report percentages or some other scaled quantity, the labels and text do not say so, and the claimed comparison with stabilizer-group counts loses its meaning. The paper provides no code, no raw data, and no explicit decoding algorithm, so the numbers cannot be independently audited. A concrete rerun of the Z1 simulation with integer error counting would settle the issue. Because the central claim is unsupported both numerically and theoretically, the appropriate verdict remains REJECT, with no change from the reader's assessment.","tokens_in":13057,"tokens_out":3236,"duration_ms":34366,"concrete_test":"Ask the authors for the simulation script, then rerun the Z1 case (3 logical to 8 physical qubits, P=1) under a fixed noise model: inject exactly 50, 60, 70, 80, 90, and 100 random single-qubit Pauli errors, apply the decoding operation dq from Eq. (33), and record the integer number of errors successfully corrected in each run. If any row shows a corrected count greater than the number of injected errors, or any non-integer corrected count, the headline claim is falsified as a statement about real error correction. As a second check, independently re-derive Eq. (27) without the assumption E(|error>) -> 0 to see whether |phi_corrected> = d(E(|psi_i>)) still follows.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central assertion that QOSTBCs correct more errors than those detected fails on elementary counting, before any quantum theory is needed. In Table 2 (and its identical twin Table 3), with 50 detected errors the QOSTBC row reports 51.45 corrected errors and 102.90% improvement; subsequent rows report 61.95, 72.45, 82.95, 93.45, and 103.95 corrected errors for 60 through 100 detected errors. Corrected error counts in a simulation of discrete Pauli errors must be integers and cannot exceed the number of errors that occurred. A count of 51.45 corrected errors is not a physical output of any decoding run. The non-integer increments of exactly +1.45 across rows look like numbers fitted to a percentage curve, not counts of successful corrections. The underlying derivation compounds the problem: Section 2.3.2, around Eq. (27), assumes E(|error>) -> 0, but a legitimate QECC maps errors into orthogonal error subspaces, not to the zero vector. Without that step, Eqs. (26) and (33) do not establish the claimed recovery. Thus neither the numerical evidence nor the theoretical derivation supports the abstract's >100% correction-rate claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a framework that combines Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) and stabilizer-group formalism to map N logical qubits to M physical qubits and correct up to P errors. The authors derive encoding equations (26) and (33), then present simulation-style tables and figures for four configurations (Z1: 3-to-8, P=1; Z2: 4-to-10, P=1; Z3: 1-to-13, P=2; Z4: 1-to-29, P=5). The central claim is that QOSTBCs outperform stabilizer-group codes in Z1, Z2, and Z4, achieving correction improvement percentages above 100% in Z1 and Z2, while stabilizer codes perform slightly better in Z3.","tokens_in":13345,"tokens_out":2336,"duration_ms":22002,"significance":"If the claimed >100% correction rates were valid, they would contradict basic properties of discrete quantum error correction, so the paper would represent a major result. However, the numerical results are internally impossible: corrected error counts are non-integer and sometimes exceed the number of detected errors, and the two tables for different configurations are identical. No code, syndrome-measurement circuit, decoding algorithm, or error model is supplied, and the central derivation in Section 2.3.2 relies on an unphysical assumption that the encoding operator annihilates the error component. The paper therefore does not provide a sound basis for its conclusions.","major_comments":[{"comment":"Tables 2 and 3 are numerically identical even though they describe different configurations (N=3, M=8, P=1 for Z1 and N=4, M=10, P=1 for Z2). Since the proposed mapping depends on N, M, and P, identical QOSTBC corrected counts indicate either a duplication error or that the results do not actually depend on the encoding parameters. This undermines the Z1/Z2 comparison and the claim that QOSTBCs outperform stabilizer codes in both cases.","section":"Section 3, Tables 2 and 3"},{"comment":"The QOSTBC corrected counts in Table 2 (51.45, 61.95, 72.45, 82.95, 93.45, 103.95) are non-integer and exceed the corresponding detected-error counts (50 through 100). The same issue appears in Tables 3 and 4. In any simulation of discrete Pauli errors, corrected counts must be integers and cannot exceed the number of errors that occurred. The abstract's claim of 'over 100% correction rates' is therefore not a measurable simulation outcome; the numbers appear to follow a formula (e.g., detected errors times 1.029) rather than a decoding simulation.","section":"Section 3, Tables 2 and 4"},{"comment":"The derivation of the corrected state assumes E(|error>) -> 0, stated in the paragraph following Eq. (27). This is not a property of genuine quantum error-correcting codes: errors map the encoded logical state into orthogonal error subspaces, not to the zero vector. Without this cancellation, Eq. (26) does not imply |phi_corrected> = d(E(|psi_i>)), so the claimed correction mechanism is unsupported. This step is load-bearing because Section 3 states that Eqs. (26) and (33) are the basis for the simulation results.","section":"Section 2.3.2, Eq. (27)"},{"comment":"The QOSTBC decoding operation is written as d_q = Q_q^{-1} applied to the sum over all q, but the manuscript does not specify how the syndrome measurement identifies which error Q_q occurred, nor how the non-commutativity of Q8 corrects up to P multi-axis errors. The claim that Q8 'can correct up to P complex multi-axis errors via non-commutativity' is asserted without proof or a concrete code construction. Consequently, Eq. (33) does not establish a working error-correction procedure.","section":"Section 2.3.3, Eqs. (33)-(34)"}],"minor_comments":[{"comment":"The phrase 'logarithmic efficiency' is used without a precise definition or metric; the paper does not compute a logarithmic efficiency for the simulations.","section":"Abstract and Section 3"},{"comment":"The encoding matrix E in Eq. (20) is displayed as a scaled identity-like matrix, but for M > N the matrix is rectangular; the entries for the non-square case are not specified.","section":"Eq. (20)"},{"comment":"There is a typo: 'Ssabilizer formalism' should read 'Stabilizer formalism'.","section":"Section 3, Z4 paragraph"},{"comment":"The x-axis label 'Number of Qubits' is inconsistent with the text discussing scaling with system size, and the 'Efficiency (Error Correction Capability)' axis has no defined units or data source.","section":"Figure 5"}],"recommendation":"reject","confidential_remarks":"The manuscript's central quantitative claim is internally inconsistent (non-integer corrected counts, corrected counts larger than detected errors, and identical tables for different parameter sets), and the theoretical derivation rests on an unphysical cancellation. These issues cannot be fixed within the manuscript's current scope because no simulation code or decoding circuit is provided to replace the reported numbers. I recommend rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short take: the central claim is impossible on elementary counting, and the paper's derivation assumes a property no quantum error-correcting code has. Not ready for peer review.\n\nWhat is actually new: the paper brings together QOSTBCs, quaternion orthogonal designs, and qubit mapping. The mathematical sections restate standard encoding and stabilizer formalism, and the QOD definitions are taken from the literature without constructing a code. The four mapping cases are arbitrary parameter choices. The tables appear generated from simple multipliers rather than a simulation. I found no code construction, syndrome measurement circuit, decoding circuit, or noise model.\n\nCredit: the survey of quaternion orthogonal designs is competent, and the idea that classical MIMO quasi-orthogonal codes might inspire qubit mapping is worth a serious look. But that is an intuition, not a result.\n\nSoft spots: Tables 2 and 3 are identical despite different (N, M, P) values. Corrected error counts are non-integer and exceed detected errors: 51.45 corrected out of 50 detected. A real decoding run of discrete Pauli errors produces integer counts, and corrected counts cannot exceed the number of errors that occurred. The stress-test note is correct. The derivation in Section 2.3.2 assumes E(|error>) -> 0; a legitimate QECC maps errors into orthogonal error subspaces, not to the zero vector. That assumption drives equations (26) and (33), so the claimed correction mechanism collapses. A minor issue is that some citations are used loosely, but the main problem is internal inconsistency.\n\nWho this is for: a reader curious about QOSTBC-inspired QEC might skim the introduction, but no one can rely on the results. The paper deserves a desk rejection with clear feedback. If the authors revisit this line of work, they should rebuild from a proper QEC derivation, implement an actual code, and report integer counts from a real decoding simulation.","headline":"The paper's central claim fails on elementary counting and a load-bearing quantum-error-correction misunderstanding; it should go back for a complete rebuild, not peer review.","tokens_in":753,"tokens_out":1163,"would_cite":false,"duration_ms":26198,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper argues that QOSTBC-based qubit mapping outperforms stabilizer-group codes in three of four simulated error-correction scenarios.","keywords":["quantum computing","quantum error correction","quasi-orthogonal space-time block codes","quaternion orthogonal designs","stabilizer formalism","qubit mapping"],"falsifier":"Run a single-qubit Pauli error $X_1$ through the $Z_1$ (3-to-8 qubits) encoding and decoding specified by Eqs. (26) and (33): if $d_q(E_q(X_1|\\psi_i\\rangle))$ is not exactly $|\\psi_i\\rangle$, the claimed correction mechanism fails; the same computation should be repeated for all four parameter sets and compared with the reported percentages.","tokens_in":12846,"feed_emoji":"⚛️","tokens_out":7991,"duration_ms":73195,"temperature":0.7,"pith_summary":"The paper sets out to show that mapping logical qubits to physical qubits with quasi-orthogonal space-time block codes built from quaternion orthogonal designs gives better error correction than standard stabilizer-group codes. It reports simulations of four mappings, from 3-to-8, 4-to-10, 1-to-13, and 1-to-29 qubits, in which the QOSTBC scheme achieves a higher correction-improvement percentage in three of the four cases. In the first two cases the reported correction rate exceeds 100%, which the paper reads as the code correcting more errors than are detected. If true, this would make QOSTBC-based mapping a promising tool for high-error quantum computation and communication, where stabilizer codes' correction performance stays near 99% in the same simulations.","feed_headline":"QOSTBC qubit mapping tops stabilizer codes in error tests","feed_subtitle":"Simulations report over 100% correction rates for two of four qubit mappings, beating stabilizer codes in three.","key_machinery":"The carrying objects are the encoding-decoding pair of equations (26) and (33), built from quaternion error operators $Q_q$ and the decoding map $d_q = Q_q^{-1}$, together with the orthogonality condition $Q^\\dagger Q = I$ for the quaternion orthogonal design and the quaternion group $Q_8 = \\{\\pm 1, \\pm i, \\pm j, \\pm k\\}$. These equations define how an $N$-qubit state is mapped to an $M$-qubit state and how the corrected state is extracted; the cancellation $E(|\\text{error}\\rangle) \\to 0$ is what turns the corrupted input back into the logical state. The paper also relies on the complexity estimate $T_{\\text{corr}} = O(N \\log M)$ to argue that the correction process scales efficiently.","core_discovery":"The paper proposes a qubit-mapping scheme in which logical qubits are encoded onto more physical qubits through quasi-orthogonal space-time block codes built from quaternion orthogonal designs, and error correction is completed by the quaternion decoding operator $d_q = Q_q^{-1}$. On this scheme, the corrected state is written as $|\\phi_{\\text{corrected}}\\rangle = d_q(E_q(|\\psi_i\\rangle + |\\text{error}\\rangle))$, and the key assertion is that the encoding operator suppresses the error term so that the decoded output is the original logical state. Simulation comparisons for four parameter sets, $Z_1$ through $Z_4$, are reported: QOSTBCs give a higher correction-improvement percentage than stabilizer-group codes in $Z_1$, $Z_2$, and $Z_4$, with the first two cases exceeding 100% correction, while stabilizer codes stay slightly ahead in $Z_3$.","pith_inferences":["Not a paper claim: the reported >100% correction rates imply the metric counts corrected errors beyond the detected set; a direct check would be to compute the logical error rate under a depolarizing channel for the same $(N, M, P)$ parameters.","Not in the paper: because the quaternion group $Q_8$ is nonabelian, the same encoding structure could be tested against phase-flip and combined bit-phase errors, not only the counted single-error cases.","Not in the paper: a crossover test at low error rates would clarify whether the QOSTBC advantage is specific to high-error regimes, as the paper's conclusion suggests."],"forward_implications":["In the $Z_1$ and $Z_2$ configurations, the paper's numbers imply the QOSTBC scheme corrects more errors than the detector identifies, a redundancy that would help in high-error environments.","The reported $Z_4$ result (1-to-29 qubits, up to five errors) implies the QOSTBC advantage persists as the correction capacity grows, reaching 99.75% improvement versus 95.00% for stabilizer codes.","The scaling claim $T_{\\text{corr}} = O(N \\log M)$ implies the mapping overhead grows only logarithmically with the number of physical qubits, making large encodings computationally feasible.","In the $Z_3$ case, stabilizer codes remain slightly ahead, so the claimed advantage is parameter-dependent rather than universal."],"supporting_citations":[{"why":"Supplies the theory of quaternion orthogonal designs that underlies the QOD-based encoding.","marker":"[4]"},{"why":"Defines the stabilizer formalism that serves as the comparison baseline throughout the simulations.","marker":"[11]"},{"why":"Introduces quasi-orthogonal space-time block codes, the coding family whose quantum version is being tested.","marker":"[16]"},{"why":"Provides the orthogonal-design framework from which QOSTBCs are extended.","marker":"[17]"},{"why":"Gives the quantum error correction background and error models used to frame the four simulations.","marker":"[21]"},{"why":"Supplies the bridge between quantum error correction and space-time block codes on which the QOSTBC mapping is built.","marker":"[23]"},{"why":"Provides the Shor code example of an error-correcting encoding that the mapping framework invokes.","marker":"[30]"}],"fun_headline_variants":["Quaternion block codes outperform stabilizers in qubit error tests","QOSTBC qubit mapping beats stabilizer codes in three of four scenarios","Over 100% correction: QOSTBC mapping beats stabilizers in qubit tests","Quaternion orthogonal designs boost QOSTBC qubit error correction","QOSTBC-quaternion scheme corrects more qubit errors than stabilizer codes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire correction argument depends on the encoding operator eliminating the error term, $E(|\\text{error}\\rangle) \\to 0$; if that cancellation does not happen, the recovered state claimed in Eq. (27) does not follow.","fun_headline_variants_meta":{"raw":{"variants":["Quaternion block codes outperform stabilizers in qubit error tests","QOSTBC qubit mapping beats stabilizer codes in three of four scenarios","Over 100% correction: QOSTBC mapping beats stabilizers in qubit tests","Quaternion orthogonal designs boost QOSTBC qubit error correction","QOSTBC-quaternion scheme corrects more qubit errors than stabilizer codes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000638,"raw_usage":{"total_tokens":2974,"prompt_tokens":1017,"completion_tokens":1957,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":633,"completion_tokens_details":{"reasoning_tokens":1859}},"tokens_in":633,"tokens_out":1957,"duration_ms":14372,"temperature":1.0,"reasoning_tokens":1859,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T19:58:03.532953+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run a single-qubit Pauli error $X_1$ through the $Z_1$ (3-to-8 qubits) encoding and decoding specified by Eqs. (26) and (33): if $d_q(E_q(X_1|\\psi_i\\rangle))$ is not exactly $|\\psi_i\\rangle$, the claimed correction mechanism fails; the same computation should be repeated for all four parameter sets and compared with the reported percentages.","supporting_citations":[{"cited_title":"The theory of quaternion orthogonal designs","cited_arxiv_id":null,"evidence_quote":"Supplies the theory of quaternion orthogonal designs that underlies the QOD-based encoding."},{"cited_title":"A quasi-orthogonal space-time block code","cited_arxiv_id":null,"evidence_quote":"Introduces quasi-orthogonal space-time block codes, the coding family whose quantum version is being tested."},{"cited_title":"Space-time block codes from orthog- onal designs","cited_arxiv_id":null,"evidence_quote":"Provides the orthogonal-design framework from which QOSTBCs are extended."},{"cited_title":"Quantum codes in classical communication: A space-time block code from quantum error correction","cited_arxiv_id":null,"evidence_quote":"Supplies the bridge between quantum error correction and space-time block codes on which the QOSTBC mapping is built."}],"review_version":1}