{"id":"d99059d9-5ae9-4880-9684-389ac5af52df","arxiv_id":"2502.10355","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Diamond circuits implement a surface code on a Heavy-Square lattice using about 25% fewer qubits and 40% fewer control lines than the standard circuit, at the cost of a roughly 3x lower threshold and longer detecting regions.","lead":"This paper presents and benchmarks 'diamond circuits,' a new family of surface-code circuits that work on a low-connectivity Heavy-Square lattice using fewer qubits and control lines. They could help line-limited quantum computers reach higher code distances, at the price of a lower error threshold.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The distance-preservation claim is inherited from the LUCI framework rather than demonstrated; an undetectable low-weight error in the paired weight-3 gauge operators could reduce the effective distance and void the line-count crossover.","rationale":"Good-faith reading: the paper's goal is to present a more qubit- and coupler-efficient surface-code circuit and benchmark it in line-limited regimes. For the central claim to hold, the circuit must genuinely preserve the distance-d property, not merely terminate in a surface-code state. Two things need to be true: (1) the circuit implements a distance-d code, and (2) the line-count crossover analysis uses fair comparisons. On point (2), the resource counts are internally consistent: standard circuits use about 2d² qubits and 4d² couplers, while diamond circuits use 1.5d² qubits and 2d² couplers, giving total control-line counts of 6d² versus 3.5d² and the asymptotic distance ratio sqrt(6/3.5) ≈ 1.31 quoted in App. B. On point (1), the paper provides detector diagrams and simulations but no proof or independent verification, and it explicitly defers the compilation details to Ref. [9] ('For more details ... see Figures 3 and 4 in Ref. [9]'). The reader's weakest assumption names the LUCI framework; my concern is a narrow, testable instance of that: the weight-6 superstabilizers formed from paired weight-3 gauges might admit undetectable low-weight logical errors. The existing stim/matching simulations are meaningful evidence, but Fig. 3 shows no data points or error bars, so they cannot settle the distance claim. A decoder-independent shortest-graph-error computation for d=3, 5, 7 would settle whether the central distance claim is correct. Therefore I recommend keeping the conditional verdict: the paper is plausible and well-motivated, but the distance-preservation assertion needs an independent check before the efficiency claims are taken as established.","tokens_in":5842,"tokens_out":9566,"duration_ms":95783,"concrete_test":"Use stim to build the detector/observable model for the odd-distance diamond memory circuit (start with d=5, then d=3 and d=7) from the supplied LUCI diagram, and compute the minimum-weight undetectable logical error with `stim.Circuit.shortest_graph_error` (or an equivalent decoder-independent search) under the SI1000 or standard depolarizing model. If the minimum weight is < d, the preserved-spacelike-distance claim fails. Also run the even-distance variant of Fig. 6 to check for parity-specific gaps. This test is independent of the matching decoder and settles whether the cited LUCI construction maintains distance on the Lieb lattice.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The abstract and §1 assert that diamond circuits 'preserve the spacelike distance of the code' while suffering a timelike penalty, and the resource counts (1.5d² qubits, 2d² couplers) and the crossover in Fig. 4 all depend on the distance label d being genuine. The only evidence for this is the LUCI framework of Ref. [9] and the detector-slice diagrams in Fig. 2; no proof or independent check is supplied that every logical Pauli of weight < d triggers at least one detector under circuit-level noise. The delicate point is that half the measure qubits are removed, so bulk stabilizers are extracted as two weight-3 gauges paired into weight-6 superstabilizers on alternating rounds (Fig. 1 and Fig. 2). If an error flips one gauge component and is subsequently cancelled by the paired component across rounds, a sub-d logical operator could evade all detectors. The simulations with SI1000 (Fig. 3) are real evidence, but raw data, fitted thresholds, and error bars are absent, so they cannot verify the distance claim. This is a request to check a specific circuit-level property, not a challenge to the general LUCI framework.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript introduces 'diamond circuits', a family of surface-code memory circuits implemented on the Lieb (Heavy-Square) lattice using the LUCI framework. The mid-cycle state is a subsystem surface code whose weight-3 gauge checks are paired into weight-6 superstabilizers; by dropping half of the measure qubits, the construction uses roughly 1.5d^2 qubits and 2d^2 couplers for a distance-d code, compared with roughly 2d^2 qubits and 4d^2 couplers for the standard surface code circuit. The paper claims that the spacelike distance is preserved at the cost of a timelike-distance penalty, benchmarks the circuits under SI1000 noise using stim and sparse blossom, reports a threshold roughly three times lower than the standard surface code, and argues that a line-count-limited architecture can nevertheless favor diamond circuits at sufficiently low physical error rates.","tokens_in":6083,"tokens_out":7990,"duration_ms":82346,"significance":"If the distance-preservation claim holds, this is a useful architecture result: it gives a concrete way to realize a surface-code memory on a lower-connectivity lattice and quantifies the trade-off between hardware components and logical performance. The paper is commendably explicit about the fairness of the comparison (d x d x d versus d x d x 4d), about the timelike penalty, and about the fact that the numerical results ignore any noise improvement from reduced connectivity. The LUCI diagrams and detector slices make the construction reproducible in principle. The central weakness is that the key distance property is inherited from Ref. [9] rather than demonstrated here, and the numerical evidence lacks error bars, raw data, and a quantified threshold estimate.","major_comments":[{"comment":"The abstract and §1 state that diamond circuits 'preserve the spacelike distance of the code', and the resource counts (1.5d^2 qubits, 2d^2 couplers) and the crossover in Fig. 4 all depend on that distance being genuine. The only evidence offered is the LUCI framework of Ref. [9] and the detector slices of Fig. 2; no proof or independent check is supplied that every logical Pauli operator of weight < d triggers at least one detector. In particular, the paper does not rule out the possibility that an error on one weight-3 gauge component is later cancelled by an error on the paired component of the same weight-6 superstabilizer, producing an undetected sub-d logical operator. Please provide a proof or a computational certificate, for example an exhaustive circuit-level distance check using stim that enumerates logical operators of weight < d and verifies detector coverage, or a precise detector-graph argument showing that the paired gauge structure cannot cancel in that way.","section":"Abstract and §1, Fig. 2"},{"comment":"The threshold comparison in Fig. 3 is central to the paper's numerical claims, but the plot has no error bars, no number of shots, no fitting procedure, and no raw data. Without these, the reader cannot assess whether the apparent crossing is statistically significant or whether the crossover curve in Fig. 4 is reliable. Please report shot counts, error bars (for example binomial or bootstrap confidence intervals), a quantified threshold estimate with confidence interval, and make the simulation data and code available.","section":"Section 'Logical error rate comparison', Fig. 3"},{"comment":"The factor-of-four timelike penalty is asserted but not derived. The paper compares d x d x d for the standard surface code with d x d x 4d for diamond circuits, claiming that the detecting regions last four times as long. Because this volume comparison is part of the fairness of the benchmark and because the resource trade-off in Fig. 4 depends on the effective timelike distance, the paper should derive the factor of four from the detector graph or demonstrate it directly, for example by showing logical failure rates as a function of the number of rounds at fixed physical error rate, or by computing the shortest timelike logical operator in the circuit-level detector graph.","section":"Section 'Logical error rate comparison'"}],"minor_comments":[{"comment":"The final paragraph contains an incomplete sentence: 'This result shows that the LUCI framework contains architecturally interesting beyond considering dropout.' Please rephrase to state the intended claim.","section":"Conclusions"},{"comment":"The caption contains a duplicated word: 'The bottom plot plot shows ...' should be 'The bottom plot shows ...'.","section":"Fig. 4 caption"},{"comment":"The text mentions a 'Crumble link for a distance-5 circuit diamond circuit memory experiment' but no URL is given in the manuscript; please provide the link or remove the reference.","section":"Main text, 'Crumble link'"},{"comment":"The exact compilation of the LUCI diagram shapes into gates is deferred to Ref. [9], Figs. 3 and 4; for self-containedness, at least one representative example showing the compilation of a single weight-3 gauge measurement would help the reader verify the construction without consulting a separate paper.","section":"§1 and Fig. 2"},{"comment":"Appendix C describes two even-distance variants but does not state explicitly which variant is used in the simulations of Fig. 3; please clarify that the left variant with weight-3 corner stabilizers is used throughout the numerical results.","section":"Appendix C"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is a strong systems/architecture contribution, and the LUCI-based construction is interesting. However, the central distance-preservation claim is currently supported only by reference to the companion paper and by diagrams, and the numerical benchmark lacks the statistical detail expected for a threshold claim. If the authors add a concrete distance certificate or proof, and provide reproducible simulation data with error bars, the paper could become suitable for publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a real new circuit family, not a trivial restatement. The diamond circuit on the Heavy-Square lattice drops half the measure qubits and still ends each round in a surface code state, which is clever and worth knowing. The resource counts are concrete: about 1.5d² qubits and 2d² couplers versus 2d² and 4d² for the standard surface code, so for line-limited hardware the trade-off is meaningful.\n\nThe paper does two things well. First, it spells out the LUCI construction for this extremal case with clear diagrams and detector slices; the figures are readable and the logic of pairing weight-3 gauges into weight-6 superstabilizers is transparent. Second, the simulations are honest: they compare d×d×d standard blocks to d×d×4d diamond blocks, which fairly accounts for the timelike penalty, and they use a standard noise model (SI1000) and decoder. The threshold being roughly 3× lower is consistent with the larger detecting regions.\n\nThe soft spots are real but not disqualifying. The main one is that the central distance-preservation claim is inherited from the LUCI framework, not demonstrated here. The paper asserts that spacelike distance is preserved, and the resource-count crossover in Fig. 4 depends on that label being genuine. There is no formal proof that every logical Pauli below weight d triggers a detector, and the worry about paired gauge components cancelling an error across rounds is worth checking. The simulations are evidence, but without raw data or error bars they can't fully verify the distance claim. A serious referee should ask for either a proof or a more direct verification, e.g., a distance-checking script against the circuit's detector error model.\n\nA second, minor issue is that the paper leans heavily on the same group's earlier LUCI paper. That's fine if the framework is sound, but it would help to have an independent check or at least a self-contained statement of the relevant theorem.\n\nBottom line: this deserves a serious referee. It's an architecturally interesting result with a plausible performance trade-off, and the missing distance proof is fixable. I'd bring it to a reading group.","headline":"New surface-code circuit family cuts qubit/coupler counts by dropping half the measure qubits, but the distance claim needs a proof rather than being inherited from the LUCI framework.","tokens_in":6593,"tokens_out":2158,"would_cite":true,"duration_ms":20609,"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":"Diamond circuits run a surface code on a sparse qubit grid with about 25% fewer qubits, preserving spacelike distance at a timelike cost.","keywords":["surface code","Lieb lattice","Heavy-Square lattice","diamond circuits","subsystem surface code","logical error rate","quantum error correction","control line efficiency"],"falsifier":"For a distance-5 diamond circuit, build the full detector-error model from the compiled circuit and compute the minimum weight of an undetectable X-type and Z-type error chain; if any such chain has weight less than 5, the spacelike-distance claim is false. A second check is to run the memory experiment at several distances and look for the expected timelike factor: diamond logical error rates should match a standard surface code only after roughly 4x more rounds, so a measured timelike penalty much smaller or larger would contradict the detecting-region picture.","tokens_in":5649,"feed_emoji":"💎","tokens_out":6498,"duration_ms":59964,"temperature":0.7,"pith_summary":"This paper presents 'diamond circuits': a way to run the standard surface code on the sparse Heavy-Square (Lieb) lattice, where two-thirds of the qubits couple to only two neighbors. The construction removes half of the measurement qubits from a rotated surface-code grid, reducing the resource count for a distance-$d$ code from roughly $2d^2-1$ qubits and $4d^2$ couplers to $1.5d^2$ qubits and $2d^2$ couplers. The author argues through the LUCI framework that these circuits preserve the code's spacelike distance, while paying a roughly fourfold penalty in timelike distance, and benchmarks them under a superconducting-inspired noise model. The payoff is architectural: on a fixed budget of control lines or qubits, a diamond circuit can support a distance about 1.31 times larger than a standard surface code, making it competitive when wiring, frequency collisions, or fabrication constraints dominate.","feed_headline":"Diamond circuits shrink surface-code hardware by 25%","feed_subtitle":"A distance-d surface code on 1.5d² qubits keeps its spacelike distance while trading a fourfold timelike penalty.","key_machinery":"The load-bearing mechanism is the LUCI framework applied to the mid-cycle state of a subsystem surface code. In this construction the mid-cycle state is a set of weight-3 gauge operators (the 'facets' of the cut diamond) on a Lieb lattice; dotted-line pairings fuse adjacent gauges into weight-6 superstabilizers in the bulk, while unpaired boundary gauges become weight-3 stabilizers. Each measure qubit is shared by four stabilizers, so the circuit interleaves two layers of CNOTs, a measurement and reset, and the reverse CNOTs over four rounds to close one detecting region while opening the next. The framework is what certifies that dropping half the measure qubits still leaves a valid surface-code circuit with spacelike distance $d$.","core_discovery":"The central claim is that the Heavy-Square lattice is not a bad home for the surface code. By starting from a subsystem surface code mid-cycle state in which weight-3 gauge operators tile the lattice, pairing gauge operators across each square to form weight-6 superstabilizers, and measuring and resetting only half of the would-be measure qubits, the author constructs a circuit whose end-cycle state is exactly the usual surface code state. The resulting diamond circuits extract both X- and Z-type stabilizers with each measurement qubit serving four stabilizers, at the cost of making detecting regions about four times longer in time. The proof of principle is the LUCI diagram and detector slices for distance 5, plus numerical logical-error-rate curves: the diamond circuit threshold is roughly three times lower than the standard surface code, but when line count rather than distance is the fixed resource, the reduced qubit and coupler counts allow a larger distance and, below the crossover error rate, a lower logical error rate per code block.","pith_inferences":["If line count is the true scaling bottleneck, the right metric is not threshold but the crossover curve: diamond circuits only pay off below a physical error rate that shrinks as the system grows, so a hardware team should measure its per-qubit and per-coupler wiring cost before choosing.","The same LUCI 'dropout' recipe could be applied to other topological subsystem codes and to defect-tolerant surface codes, not just to the standard surface code; the author hints at this, but the generality is not demonstrated here.","A natural testable extension is a time-varying gauge pairing that swaps which gauges are paired each round; symmetry suggests this might halve the four-round timelike penalty without adding qubits, though the detecting-region overlap would need rechecking."],"forward_implications":["A distance-$d$ diamond circuit uses $1.5d^2$ qubits and $2d^2$ couplers, a more than 40% reduction in control lines compared with the standard circuit, so a line-limited machine can implement a larger code distance.","The timelike distance is degraded by roughly a factor of four, so diamond circuits need a decoder and error rates that tolerate longer detecting regions; the measured threshold is about three times lower.","If physical error rates lie below both thresholds and hardware resources are held fixed, the distance ratio asymptotes to $\\sqrt{6/3.5} \\approx 1.31$, which is enough for diamond circuits to win on logical error rate in the line-limited regime.","Because every data qubit has only two couplers, the architecture is expected to reduce crosstalk and frequency collisions in superconducting implementations, although the numerics in this paper deliberately do not assume that advantage."],"supporting_citations":[{"why":"Supplies the LUCI framework, which authorizes removing half the measure qubits while preserving the surface code; the paper's construction is an instance of it.","marker":"[9]"},{"why":"Introduces the mid-cycle-state approach to fault-tolerant circuits, the starting point for the diamond circuit.","marker":"[10]"},{"why":"Defines the subsystem surface code whose weight-3 gauge operators form the mid-cycle state.","marker":"[7]"},{"why":"Supplies the SI1000 noise model used for all logical-error-rate benchmarks.","marker":"[15]"},{"why":"The stabilizer-circuit simulator used for the numerical logical-error-rate benchmarks.","marker":"[16]"},{"why":"Correlated-error matching decoder used in the two-pass decode; part of the benchmark pipeline.","marker":"[17]"},{"why":"Minimum-weight matching decoder used in the two-pass correlated decode.","marker":"[18]"},{"why":"Prior surface-code construction in which bulk measure qubits double for boundary stabilizers, cited as precedent for shared measure qubits.","marker":"[13]"}],"fun_headline_variants":["Diamond circuits halve measure qubits for surface codes","Surface code on Lieb lattice: half the measurements, same distance","Diamond surface codes: qubit-efficient but fourfold timelike cost","Cut measure qubits in half, pay 4x in time: diamond circuits","Diamond circuits: 25% less hardware, same distance, slower detection"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction assumes the LUCI framework's guarantee: dropping exactly half the measure qubits and pairing the gauge operators as drawn still yields a valid distance-$d$ surface code with the claimed spacelike distance; this paper applies that framework rather than proving it from scratch.","fun_headline_variants_meta":{"raw":{"variants":["Diamond circuits halve measure qubits for surface codes","Surface code on Lieb lattice: half the measurements, same distance","Diamond surface codes: qubit-efficient but fourfold timelike cost","Cut measure qubits in half, pay 4x in time: diamond circuits","Diamond circuits: 25% less hardware, same distance, slower detection"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000778,"raw_usage":{"total_tokens":3387,"prompt_tokens":837,"completion_tokens":2550,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":453,"completion_tokens_details":{"reasoning_tokens":2455}},"tokens_in":453,"tokens_out":2550,"duration_ms":18521,"temperature":1.0,"reasoning_tokens":2455,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T18:18:26.850944+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a distance-5 diamond circuit, build the full detector-error model from the compiled circuit and compute the minimum weight of an undetectable X-type and Z-type error chain; if any such chain has weight less than 5, the spacelike-distance claim is false. A second check is to run the memory experiment at several distances and look for the expected timelike factor: diamond logical error rates should match a standard surface code only after roughly 4x more rounds, so a measured timelike penalty much smaller or larger would contradict the detecting-region picture.","supporting_citations":[{"cited_title":"Relaxing hard- ware requirements for surface code circuits using time- dynamics,","cited_arxiv_id":null,"evidence_quote":"Introduces the mid-cycle-state approach to fault-tolerant circuits, the starting point for the diamond circuit."},{"cited_title":"Subsystem surface codes with three-qubit check opera- tors,","cited_arxiv_id":null,"evidence_quote":"Defines the subsystem surface code whose weight-3 gauge operators form the mid-cycle state."},{"cited_title":"Benchmark- ing the planar honeycomb code,","cited_arxiv_id":null,"evidence_quote":"Supplies the SI1000 noise model used for all logical-error-rate benchmarks."},{"cited_title":"Sparse blossom: correcting a million errors per core second with minimum-weight matching,","cited_arxiv_id":null,"evidence_quote":"Minimum-weight matching decoder used in the two-pass correlated decode."},{"cited_title":"Low-distance surface codes under realistic quantum noise,","cited_arxiv_id":null,"evidence_quote":"Prior surface-code construction in which bulk measure qubits double for boundary stabilizers, cited as precedent for shared measure qubits."}],"review_version":1}