{"id":"97734d28-eaf6-4c70-955c-cf575c6affd1","arxiv_id":"2607.27341","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"With finite resources, classical erasure via majority voting can be made arbitrarily accurate in one interaction by adding subsystems, while a single qubit is capped by a fidelity ceiling — the asymptotic Landauer bound is the same, but the resource costs are not.","lead":"Erasing a classical bit made of many small magnets can be made arbitrarily cheap and fast by adding more magnets, while erasing a single quantum bit needs much longer times, sharper control, and larger energy gaps. The paper shows both obey the same theoretical minimum heat cost from Landauer's principle, but only when resources are infinite.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The quantum time/control disadvantage rests on an unstated sequential-only restriction; a qubit coupled simultaneously to n reservoir pairs via ∑H_i cools in τ_opt/√n, so the claimed asymmetry may be an artifact.","rationale":"The reader's weakest assumption identifies the most load-bearing concern: the asymmetric control model. I agree and sharpen it with an explicit Hamiltonian-level counterexample. The natural parallel strategy for a single qubit is not a (2n+1)-partite interaction; it is the sum of n tripartite terms, and it yields a collective √n speed-up. This does not invalidate the exact sequential formula F_Q^max(n), but it does undermine the inference that quantum erasure inherently requires more time and control under the stated assumptions. Because the reader already flagged this and chose CONDITIONAL, my read does not move the verdict; the paper can be repaired by adding a sequential-only control assumption and justifying it physically. The unexplained dissipation formula Eq. (5) is a secondary correctness risk but not the central load-bearing issue.","tokens_in":15916,"tokens_out":12753,"duration_ms":139288,"concrete_test":"Compute (exactly for n=2,3, numerically for larger n) the fidelity of a single qubit evolved under U_parallel=exp[-i(∑_{i=1}^n H_i)τ] with H_i from Eq. (3), starting from ρ_Q⊗(τ_β⊗ρ_W)^{⊗n}, optimizing τ; compare with F_Q^max(n)=1-(1-w1)^n/2 and F_C^max(N_min) from Eq. (9). In the ideal limit ΔE_B→∞, the single-excitation bright-state calculation predicts full |1⟩-to-reservoir transfer at τ=π/(2√n g), which would falsify the claim that a qubit needs n sequential swaps or longer times. If a sequential-only restriction is intended, the paper should state it as an explicit assumption and re-derive the trade-off under it.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The comparison (Eqs. 6–9) gives the quantum bit only the product unitary U_Q=∏e^{-iH_iτ_opt} while the classical bit is allowed U_C=e^{-i∑H_iτ_opt}. The stated Protocol Assumptions restrict only to a single control frequency; they do not forbid applying all H_i simultaneously to a single qubit. For a qubit, H_sum=∑_{i=1}^n H_i (with the same σ_S in each term) is not a (2n+1)-partite interaction: it is a sum of n tripartite couplings, each energy-preserving and at one frequency. In the single-excitation sector with n virtual qubits prepared in the relevant |0_V⟩ state, the bright state has coupling √n g, so the qubit's |1⟩ population can be fully transferred in time π/(2√n g) — shorter than the classical single-interaction time τ_opt and much shorter than nτ_opt. Thus a qubit with the same parallel resources reaches at least the sequential fidelity F_Q^max(n) (and in the ideal limit exact erasure) within a single global interaction. The paper's dismissal of the parallel qubit strategy as requiring a (2n+1)-partite interaction applies only if one insists on reproducing U_Q exactly, not if one uses the physically natural Hamiltonian ∑H_i. The central 'time and control' advantage of classical encodings is therefore not established by the stated model; it appears to be an artifact of an unstated sequential-only restriction for the qubit. The mathematical bounds themselves may be sound, but the comparative conclusion needs an explicit, physically justified control assumption.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper compares the thermodynamics of erasing one bit of information encoded in a quantum two-level system versus a classical many-body majority-vote encoding. It claims that the asymptotic Landauer bound is the same for both, but that with finite resources—finite interaction time, finite work-source purity, and limited control—classical erasure is significantly cheaper and faster. The central quantitative result is an expression for the minimum number N of classical subsystems needed for a single parallel global interaction to reach the same asymptotic fidelity as n sequential swaps of a quantum qubit (Eq. (9)), together with trade-off relations and a robustness analysis against timing errors. The equal-bounds claim is supported by elementary entropy accounting; the classical advantage is derived from large-deviation estimates of majority voting.","tokens_in":16189,"tokens_out":2711,"duration_ms":41976,"significance":"If the central comparison is correct, the paper provides a conceptually interesting explanation of why practical erasure schemes fall short of the Landauer bound and identifies a fundamental thermodynamic advantage of classical encodings. The equal asymptotic bounds are not new, but framing them in a common virtual-qubit framework and contrasting finite-resource behavior is a useful contribution. The paper also makes explicit falsifiable scaling predictions, e.g., the N_min formula, and provides a supplement with derivations of the population dynamics and large-deviation bounds. However, the advertised quantum-versus-classical resource asymmetry rests on an asymmetric control assumption that is not stated in the Protocol Assumptions; this is a load-bearing issue that must be addressed before the main conclusion can be accepted.","major_comments":[{"comment":"The comparison limits the qubit to sequential unitaries U_Q = ∏ U_i (Eq. (6)), while the classical bit is allowed the parallel unitary U_C = exp(-i ∑ H_i τ_opt) (Eq. (7)). The Protocol Assumptions only restrict to a single control frequency; they do not forbid applying all H_i simultaneously to a single qubit. The text dismisses the parallel qubit strategy as requiring a (2n+1)-partite interaction, but H_sum = ∑_i H_i is a sum of n tripartite couplings, each energy-preserving and at one frequency, not a single (2n+1)-partite interaction. In the single-excitation sector with n virtual qubits in the relevant state, the bright state couples with strength √n g, so a single interaction of duration π/(2√n g) fully transfers the qubit population in the ideal ΔE_B→∞ limit. Thus the qubit can reach at least F_Q^max(n) in time τ_opt/√n, undermining the claimed time and control advantage of the cla","section":"The Role of Time, Eqs. (6)-(7)"},{"comment":"Equation (5), the central dissipation expression ∆Q_B = ((F−1)p_i + F p_i′)/β log(F/(1−F W)), is asserted in the main text without derivation. The supplemental derives population dynamics and the infinite-swap limit, but does not derive this heat-dissipation formula. Since this expression underlies the dissipation-fidelity curves in Fig. 2 and the claimed trade-off between fidelity and dissipation, a derivation (or a precise reference) is essential. As written, the reader cannot verify the logarithmic divergence as F→1 or the claimed equality between the quantum and ladder cases.","section":"Eq. (5)"},{"comment":"Equation (10) is garbled as printed: FQ = 1− q^n/(1+e^{−βwΔE_S^Q} e^{−(β−βw)ΔE_B}) + q^n/2 is missing parentheses and the definition of q is ambiguous. This equation is used to argue that a finite-temperature work source constrains the reachable qubit fidelity. The reader cannot check this claim without a corrected formula and a clear statement of the regime of validity (e.g., which terms are kept in the large-gap limit).","section":"Eq. (10)"},{"comment":"The timing-error analysis in the supplement assumes that for the classical bit the timing errors for each subsystem are independent (ε_i drawn per subsystem), while for the qubit the error is common to all n swaps. This is a reasonable model for inhomogeneous coupling, but it is another asymmetry: a single global classical interaction with one clock would logically have a common error, not independent errors per subsystem. If the classical bit also suffers a common timing error, the majority-vote error suppression may degrade. The authors should state explicitly why independent per-subsystem errors are the relevant classical scenario and discuss the common-error case.","section":"Robustness of the protocol, Eq. (S27)-(S32)"}],"minor_comments":[{"comment":"Throughout, the notation F is used both for fidelity and for the probability in Eq. (S13); please disambiguate. Also, Eq. (S14) uses p for the single-subsystem 0-population, while the main text uses p_i and w_1; this inconsistency makes the supplement harder to follow.","section":"General"},{"comment":"The phrase 'communal folklore' in the abstract is informal for a journal article; consider 'previous observations' or a reference. Also, the definition of Π_0 in the classical-bit section is stated for even d, but the majority-vote construction later assumes odd N; this is fine, but the relationship between the two encodings should be made explicit.","section":"Introduction/Definitions"},{"comment":"In Fig. 2(a), the color gradient indicating protocol time is difficult to interpret because the legend does not give a quantitative scale. Please add a color bar with time units or a separate panel. In the caption, '10^11 + 1' is presumably meant as 10^11+1; the formatting is confusing.","section":"Fig. 2"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses an interesting and timely question, and the equal-bounds argument is sound. The main issue is the unstated sequential-only control restriction for the qubit versus the parallel control for the classical bit; the skeptic's objection is concrete and, on reading, lands. If the authors can justify this asymmetry from a physical control model—or if they modify the claims to explicitly state the restriction and its scope—the paper could be publishable. Otherwise, the central 'time and control' advantage of classical erasure is not established. The missing derivation of Eq. (5) and the garbled Eq. (10) also need attention. I would be willing to review a revised version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThis paper asks a good question and builds a genuinely new scaffold for comparing classical and quantum erasure. The majority-vote analysis of a classical bit encoded in N qubits, and the N_min trade-off formula (Eq. 9), are new and worth thinking with. The equal-Landauer-bound result is standard entropy accounting, but it is clearly stated and the finite-accuracy version is useful. The robustness section is a nice touch.\n\nThe soft spot is the comparison itself. The qubit is restricted to n sequential swaps (U_Q = ∏ U_i), while the classical bit is allowed the parallel sum U_C = e^{-i∑ H_i τ_opt}. But the H_i in Eq. (3) commute. So H_sum = ∑ H_i is a sum of n tripartite terms, not a (2n+1)-partite interaction, and evolving under H_sum for time τ_opt gives exactly the same unitary as the n sequential swaps. That is precisely the control resource the classical bit is given. So the qubit can match the classical bit's parallel strategy with the same control complexity and in the same time. The paper's claim that parallel quantum implementation requires a (2n+1)-partite interaction does not hold for commuting H_i.\n\nI would not push the stress-test's specific claim about a √n speedup from the bright-state coupling: that is a different operation (one collective swap) and does not replicate the n-swap fidelity. But the core issue stands: the paper's central asymmetry in time and control is an artifact of the sequential-only restriction. Compare like with like, and the quantum side can be parallelized just as easily.\n\nOther issues are secondary. Eq. (5) is asserted without derivation in main text or supplement; a referee should ask for it. Eq. (10) is garbled. The paper is otherwise clearly written and honest about idealisations.\n\nThis deserves a serious referee. The framework and the N_min formula are useful, and the flaw is fixable. But as it stands, the headline conclusion is not established. I'd send it to peer review with a request to redo the comparison under a symmetric control model.","headline":"A promising framework with a flawed central comparison: the qubit is denied the parallel control the classical bit gets, which drives the headline conclusion.","tokens_in":16755,"tokens_out":10345,"would_cite":false,"duration_ms":87915,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper establishes that although Landauer's erasure bound is identical for classical and quantum bits, a classical majority-vote encoding can reach in a single parallel interaction the fidelity a qubit can only approach with many sequent","keywords":["Landauer bound","information erasure","finite-time thermodynamics","virtual qubit","majority-vote encoding","control complexity","thermal dissipation","quantum cooling"],"falsifier":"Construct an explicit qubit erasure protocol that couples to n virtual qubits in parallel using only tripartite interactions and total time tau_opt; if its attainable fidelity exceeds F_Q^max(n) for n swaps, the claimed separation fails. Equivalently, in an experiment with identical bath temperature and work-source purity, find a qubit with n swaps that reaches a fidelity above F_C^max(N_min-1) or reaches the classical bit's fidelity in less time.","tokens_in":15728,"feed_emoji":"💾","tokens_out":5614,"duration_ms":60698,"temperature":0.7,"pith_summary":"A bit erased in a classical many-body system and a bit erased in a single quantum two-level system obey the same Landauer bound: both require at least k_B T ln 2 plus an excess that grows with the target error. The paper argues that the similarity ends there. For finite resources, a qubit's fidelity after n cooling interactions is capped by F=1-(1-w1)^n/2, while a classical bit encoded by majority vote over N subsystems can reach the same or better fidelity in a single parallel interaction once N exceeds a threshold N_min(n). The authors conclude that classical encodings have a thermodynamic advantage in realistic finite-time, finite-control settings, and that the gap between practical erasure and Landauer's bound reflects the difficulty of approaching the bound, not a different fundamental limit.","feed_headline":"Classical bits erase in one interaction what qubits need n swaps for","feed_subtitle":"A single global pulse over N majority-vote subsystems matches the fidelity of n sequential quantum swaps.","key_machinery":"The argument runs on two constructions. First, the virtual qubit: a two-level subspace of the bath-plus-work-source Hilbert space whose population ratio defines a virtual temperature; each tripartite Hamiltonian is a partial swap between the system and one such virtual qubit, so n interactions thermalise the system towards that virtual temperature. Second, the majority-vote encoding: a classical bit is a set of N non-interacting two-level subsystems whose logical 0/1 is decided by the majority of individual outcomes, addressed by mutually commuting Hamiltonians in a single unitary U_C=exp(-i sum H_i tau_opt). The binomial tail bound F_C(N) >= 1 - exp(-N D(1/2||p)) converts many slightly cool","core_discovery":"Working with energy-preserving tripartite swaps among system, thermal bath, and work source, the paper proves that the minimal dissipation for erasure to fidelity 1-epsilon is identical for a qubit and for a d-dimensional classical bit when the target population is spread uniformly over each logical subspace. In the asymptotic limit of infinitely many swaps, the two dissipations again coincide. The central quantitative result is a threshold: with work-source purity w1, a qubit allowed n perfectly timed swaps can at best reach F_Q^max(n)=1-(1-w1)^n/2 in the infinite-dissipation limit; a classical majority-vote bit of N qubit subsystems, each cooled by one swap and addressed simultaneously by","pith_inferences":["If the control asymmetry were relaxed—for example, if a qubit could be coherently coupled to many virtual qubits with a single global pulse of only modest complexity—the resource advantage of the classical encoding could shrink; the paper's own discussion of the (2n+1)-partite interaction needed for parallel qubit control flags this as the main boundary of the result.","The same exponential-concentration mechanism should apply to any redundant encoding with a binomial tail bound, not only majority vote; repetition codes and other classical error-correcting codes are natural testbeds.","The dissipation measure here charges only heat into the thermal bath; a fuller accounting that includes the preparation and maintenance cost of N subsystems, or the much larger energy scale of the classical bit, might partially offset the classical advantage.","A direct experimental probe would be sideband cooling of a single trapped ion (n pulses) versus collective cooling of a spin ensemble, measuring time and heat at fixed fidelity; the threshold N_min predicts where the classical protocol overtakes the qubit."],"forward_implications":["For a given number n of allowed qubit swaps, any classical bit with more than N_min subsystems can match or beat the qubit's best possible fidelity in one interaction time tau_opt rather than n tau_opt.","Because the binomial error decays exponentially in N, adding subsystems is a direct substitute for longer interaction times, sharper control, or colder work sources.","The finite-error Landauer bound is the same for both encodings, so the practical shortfall from Landauer's limit is governed by control and time resources, not by the number of microstates.","Imperfect timing degrades the qubit's reachable fidelity by replacing w1 with (1-s^2)w1, whereas the classical bit retains its exponential error suppression in N.","With a finite-temperature work source, the qubit's reachable fidelity is capped by the virtual temperature; the classical bit can still reach high fidelity by increasing N."],"fun_headline_variants":["Classical erasure needs less control, energy, and time than quantum","Equal Landauer bound, but classical erasure is far cheaper","Quantum erasure needs n swaps; classical does it with one pulse","Classical bits erase with far fewer resources than qubits","Same erasure limit, but quantum pays more in control and time"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The comparison assumes the qubit is limited to n sequential tripartite swaps while the classical bit is allowed one simultaneous global interaction with all N subsystems; if a qubit can be cooled by a collective coupling to many virtual qubits without that high control complexity, the claimed classical advantage could disappear.","fun_headline_variants_meta":{"raw":{"variants":["Classical erasure needs less control, energy, and time than quantum","Equal Landauer bound, but classical erasure is far cheaper","Quantum erasure needs n swaps; classical does it with one pulse","Classical bits erase with far fewer resources than qubits","Same erasure limit, but quantum pays more in control and time"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000543,"raw_usage":{"total_tokens":2418,"prompt_tokens":704,"completion_tokens":1714,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":448,"completion_tokens_details":{"reasoning_tokens":1625}},"tokens_in":448,"tokens_out":1714,"duration_ms":12287,"temperature":1.0,"reasoning_tokens":1625,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T09:08:01.421298+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct an explicit qubit erasure protocol that couples to n virtual qubits in parallel using only tripartite interactions and total time tau_opt; if its attainable fidelity exceeds F_Q^max(n) for n swaps, the claimed separation fails. Equivalently, in an experiment with identical bath temperature and work-source purity, find a qubit with n swaps that reaches a fidelity above F_C^max(N_min-1) or reaches the classical bit's fidelity in less time.","supporting_citations":[],"review_version":1}