{"id":"6be6e452-b099-4a08-9479-28718794fc3c","arxiv_id":"2608.11733","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"First reported 12-CNOT decomposition of the double qubit excitation operator, improving CNOT count, CNOT depth, and total depth over prior 13-CNOT circuits.","lead":"A quantum circuit designer reports a new, more compact way to build the double qubit excitation gate, a workhorse operation in quantum chemistry simulations. The new circuit uses 12 two-qubit CNOT gates instead of the previous best 13, a small but real improvement in a frequently used building block.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Figure 5 is not independently reconstructible from the text, so the claimed 12-CNOT circuit's equality to U(θ) is unverified; a misplaced CNOT or wrong Rz sign would invalidate the central claim.","rationale":"I read the construction in good faith and found no internal contradiction: the action of Eq. (1) reduces correctly to a rotation on |0011> and |1100>, and the standard L/R sandwich construction in Figure 1 is plausible. The load-bearing weakness is evidential rather than mathematical. The contribution is a specific circuit artifact, yet the manuscript gives no way to verify that artifact: no circuit file, no equivalence proof, and no explicit CNOT connectivity. The paper itself demonstrates how easy such errors are by inserting two correction gates into Yordanov's published circuit (Section 1.2). The reader's weakest assumption already identifies the unproven identity and angle layout, which is the same gap. A missing artifact is exactly the kind of condition that should make the paper conditional rather than accepted; it does not justify rejection because the claimed improvement is concrete and plausible. No verdict change is needed.","tokens_in":5428,"tokens_out":13603,"duration_ms":142500,"concrete_test":"Ask the author to provide an explicit OpenQASM or QuEST gate list for Figure 5 with all fan-outs expanded, then run a unitary equivalence check: for θ = 0, π/4, π/2, and a random value, simulate the reconstructed circuit and compare its 16×16 unitary, up to global phase, with exp(-iθ/8 * H), where H is the eight-Pauli sum in Eq. (1). Also independently count CNOTs, CNOT depth, and total depth. If the operator fidelity is 1 to numerical precision, the concern is resolved; any significant deviation means the central claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the Figure 5 circuit realizes U(θ) of Eq. (1) with 12 CNOTs. The paper provides no machine-readable circuit, no OpenQASM listing, no unitary equivalence check, and no derivation of the CNOT placement: Section 2 simply reports the result of undisclosed synthesis runs and lists only the one-qubit gates of Figure 5. The compact fan-out notation and the absence of explicit CNOT pairs mean a reader cannot reconstruct the circuit from the text. The L/R sandwich identity in Section 1.1 and Eq. (3) is cited from [21] and is standard, but the new 12-CNOT circuit is not shown to be a simplification of that identity; its correctness rests entirely on an unshown figure. If any CNOT control/target pair is misplaced, or if one of the Rz angles (for example Rz(-π/2-θ/4) on q_i or Rz(π/2) on q_k in Figure 5) has the wrong sign, the circuit implements a different unitary and the Pareto improvements in Table 1 are for the wrong gate.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a new quantum circuit for the double qubit excitation operator U(θ) of Eq. (1), claiming to be the first 12-CNOT decomposition, improving over previously reported 13-CNOT circuits. The construction is based on the standard L/R CNOT sandwich around a triple-controlled Ry rotation, with the new circuit shown in Figure 5. The paper reports resource counts of 12 CNOTs, CNOT depth 10, total circuit depth 16, and 13 single-qubit gates, and compares these in Table 1 with prior circuits from Yordanov et al., Nam et al., and Wang et al. No equivalence proof, numerical verification, or machine-readable circuit is provided; the central claim rests entirely on the correctness of Figure 5.","tokens_in":5588,"tokens_out":3150,"duration_ms":36432,"significance":"If the Figure 5 circuit is correct, the result is a modest but concrete improvement over the prior 13-CNOT state of the art, lowering CNOT count, CNOT depth, and total depth, at the cost of two additional single-qubit gates relative to the best prior one-qubit count. Such resource reductions are relevant for near-term ansatz circuits and Hamiltonian simulation. The paper makes falsifiable and precise metric claims in Table 1 and correctly attributes prior constructions. However, the result is not backed by any machine-checked proof, simulation, or code artifact, and the figure is not independently reconstructible from the text, so the central claim is currently unverified.","major_comments":[{"comment":"The central claim that the circuit in Figure 5 realizes U(θ) of Eq. (1) with 12 CNOTs is not supported by any equivalence proof, numerical simulation, or automated verification. The figure uses compact fan-out notation and does not list the explicit CNOT control/target pairs, so a reader cannot reconstruct the circuit from the text. This matters because the paper itself notes in the acknowledgements and Section 1.2 that corrections were needed to a previously published Yordanov circuit, demonstrating that this class of construction is error-prone. Please provide an explicit gate-by-gate circuit, a unitary equality check, or a rigorous derivation showing that Figure 5 equals Eq. (1).","section":"Section 2, Figure 5"},{"comment":"The description in Section 2 that various synthesis and optimization tools, including Q-Synth, Qiskit, and tket, were used to explore decompositions is not accompanied by any reproducible details: no synthesis scripts, parameter settings, output certificates, or machine-readable circuits are given. Since the paper reports a record resource count obtained from undisclosed synthesis runs, the central result is not reproducible as written. Please include a circuit file (e.g., OpenQASM), a verification script, or a synthesis certificate.","section":"Section 2, synthesis-tool description"},{"comment":"The reported metrics, especially CNOT depth 10 and total circuit depth 16, cannot be checked from the paper as printed. The caption of Figure 5 says fan-out CNOTs are expanded when computing depth, but the expanded circuit is never shown, and the single-qubit gate counting rule based on merging maximal runs into u3 gates is not applied explicitly to the displayed gates. Please provide the expanded circuit and a transparent depth computation to substantiate the Table 1 entries.","section":"Table 1 and Section 2, metric definitions"},{"comment":"The L transformation is stated in Eq. (3) but no explicit CNOT circuit realizing L is given in the paper; the text refers to [21] for the sandwich construction. Since the new 12-CNOT circuit is presented as a standalone result and not shown to be derived from that identity, the paper should either prove the L/R decomposition used in Figure 5 or cite the specific circuit from [21] with a clear mapping to the new figure.","section":"Section 1.1, Eq. (3)"}],"minor_comments":[{"comment":"There are missing spaces in 'Usingthecomputational-basisordering' and several other OCR-like spacing errors throughout the text; these should be corrected in a revision.","section":"Section 1, Eq. (1) and Eq. (2)"},{"comment":"Equation (1) is attributed to 'Eq. 20 of [21]'; please give the exact equation number in the cited paper and verify that the sign convention matches the present Eq. (1).","section":"Section 1, references"},{"comment":"The figures for the previous 13-CNOT circuits are difficult to parse because control/target positions and timing are not always visually aligned; adding explicit circuit coordinates or an OpenQASM listing would improve comparability.","section":"Figures 3 and 4"},{"comment":"The notation '√X†' is used without defining the phase convention; since Rz angles and one-qubit gate counts depend on the convention, please specify it explicitly.","section":"Section 2, Figure 5 caption"}],"recommendation":"major_revision","confidential_remarks":"The claimed record is plausible and the comparisons are clearly laid out, but the paper currently gives the reader no way to verify the central circuit. The acknowledgements mention correctness checks, yet no artifact accompanies the paper. In my view the appropriate path is major revision requiring an explicit circuit listing and verification, after which the result may be publishable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a real, incremental result—a 12-CNOT decomposition of the double qubit excitation operator, one fewer CNOT than the previous best, with the best reported CNOT depth and total depth. The comparison table is clear, the novelty claim is properly qualified, and the author is honest about having corrected a prior circuit. No red flags in the approach: the L/R sandwich identity is standard, and the claim is specific, not hand-wavy.\n\nThe soft spot is exactly what the reader flagged: the paper gives no way to verify the central artifact. Figure 5 is drawn with compact fan-out notation, the CNOT placements are not listed in the text, and there is no OpenQASM, no Qiskit code, no numerical unitary check, and no proof that the circuit equals Eq. (1). The acknowledgment that a published 13-CNOT circuit needed two added gates shows how easy it is to slip up. I cannot reconstruct the circuit from the text myself, so the central claim is credible but unconfirmed.\n\nThat said, the logic of the construction is not circular, and the burden is not on the author's identity—it's just missing evidence. This is the kind of paper that should have a one-line verification script as a supplementary file. Without it, the claim is essentially \"trust the figure.\"\n\nIs the result worth a referee's time? Yes. A one-CNOT reduction in a widely used building block for UCCSD/VQE and Hamiltonian simulation is a modest but real contribution to circuit compilation. The paper does not need a desk reject; it needs a referee who will actually run a unitary equivalence check. That is standard for this subfield.\n\nMy recommendation: send it to peer review, but make the acceptance conditional on shipping a machine-readable circuit (QASM or Qiskit) and a verification script that checks the unitary against Eq. (1). Also ask the author to clarify the synthesis method—saying \"we used Q-Synth, Qiskit, tket\" without details on how the 12-CNOT circuit was found or why it is optimal is thin. For a smaller point, the table is useful but would be stronger with an explicit statement of how single-qubit gates are merged into u3 counts, which the caption mentions.\n\nWho benefits: people who need concrete resource counts for excitation operators in compiled circuits. I would not cite it myself until the circuit is independently verified, but I would bring it to a reading group working on quantum compilation.","headline":"A concrete one-CNOT improvement with the best reported depth numbers, but the central circuit is unverifiable from the text and needs a machine-checked companion.","tokens_in":6130,"tokens_out":1269,"would_cite":false,"duration_ms":15896,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P68"],"pacs":["03.67.Lx"],"model":"deepseek-v4-flash","headline":"A 12-CNOT circuit implements the double qubit excitation operator, the fewest CNOTs reported to date.","keywords":["double qubit excitation operator","CNOT count","circuit depth","quantum circuit decomposition","unitary coupled cluster","quantum chemistry","triple-controlled rotation"],"falsifier":"Compute the $16 \\times 16$ unitary of the Fig. 5 circuit symbolically and compare it entry-by-entry with the matrix exponential of Eq. (1) at a generic angle such as $\\theta = \\pi/7$; any nonzero difference or a relative phase on the $|0011\\rangle \\leftrightarrow |1100\\rangle$ block would falsify the claimed 12-CNOT implementation.","tokens_in":5186,"feed_emoji":"⚛️","tokens_out":11129,"duration_ms":99639,"temperature":0.7,"pith_summary":"This paper presents a new explicit quantum circuit for the double qubit excitation operator, a four-qubit gate that rotates between the computational basis states $|0011\\rangle$ and $|1100\\rangle$ and is a building block of quantum chemistry ansätze and Hamiltonian simulation. The author claims the circuit uses 12 CNOT gates, one fewer than the best previously published implementations, and that it also achieves the lowest CNOT depth (10) and total circuit depth (16) among the compared circuits. If the claimed identity is correct, this is a concrete efficiency improvement: fewer two-qubit gates means less error accumulation on near-term hardware, and a shallower circuit means less exposure to decoherence. The construction starts from the standard $L$--$C^3R_y(2\\theta)$--$R$ sandwich and optimizes the CNOT placement using circuit synthesis software, adding only two one-qubit gates compared to the most gate-efficient prior circuit.","feed_headline":"Double qubit excitation gate cut from 13 to 12 CNOTs","feed_subtitle":"At depth 16, it is the shallowest reported implementation of this quantum-chemistry building block.","key_machinery":"The load-bearing object is the $L$--$R$ CNOT sandwich around a triple-controlled $R_y$ rotation: the double-excitation operator is written as $L\\, C^3R_y(2\\theta)\\, R$, with $R = L^{-1}$, where $L$ is a CNOT network sending $|0011\\rangle$ and $|1100\\rangle$ to states whose three control qubits are in $|1\\rangle$ and all other basis states to some $|x'\\rangle$ that does not trigger the rotation. The new 12-CNOT circuit is a specific optimized realization of this sandwich, in which CNOTs from the controlled-rotation decomposition are commuted, cancelled, or shared with the flanking networks. The whole argument depends on the previously established identity (cited to [21]) that such a sandwich exactly equals the eight-term Pauli exponential in Eq. (1); this identity supplies the correctness of the high-level circuit, and the paper's contribution is the concrete 12-CNOT layout of that circuit.","core_discovery":"The central claim is that the double qubit excitation operator $U(\\theta)$ of Eq. (1), which exponentiates a sum of eight Pauli strings, can be implemented with only 12 CNOT gates, improving on all known 13-CNOT implementations. The circuit shown in Fig. 5 realizes this with CNOT depth 10, total depth 16, and 13 one-qubit gates; in the paper's comparison table these are the lowest values among the listed circuits for all three metrics. The construction is an explicit four-qubit circuit obtained by decomposing the operator as $L\\,C^3R_y(2\\theta)\\,R$ with $R=L^{-1}$, where $L$ maps the two coupled basis states $|0011\\rangle$ and $|1100\\rangle$ to states that activate the triple-controlled rotation, and then optimizing the CNOT structure of the whole sandwich. The author reports that no previously published decomposition with fewer than 13 CNOTs was found in the literature.","pith_inferences":["The same $L$--controlled-rotation--$R$ template, optimized with the same style of CNOT minimization, may yield one-gate reductions for single, triple, and other fermionic excitation operators used in quantum chemistry.","A formal lower-bound proof would be the natural next step: the author reports no circuit with fewer than 12 CNOTs, but the paper does not attempt to show 12 is optimal.","On fully connected hardware, the fan-out CNOTs in Fig. 5 could be parallelized further, potentially reducing the CNOT depth below 10 without altering the circuit.","Real-device benchmarking against the 13-CNOT circuits would test whether the lower depth translates into higher end-to-end fidelity, given that the one-qubit gate count rises from 11 to 13."],"forward_implications":["Quantum chemistry circuits that use the double excitation gate, such as UCCSD variants and adaptive VQE ansätze, can be compiled with one fewer CNOT than before, reducing the two-qubit error budget on current processors.","The new circuit's CNOT depth of 10 and total depth of 16 make it the shallowest reported implementation, a favourable property for devices where decoherence limits the number of sequential operations.","The paper's Table 1 provides a new benchmark: any future compiler or synthesis tool targeting the double excitation operator now has a 12-CNOT reference point to beat.","Because the circuit adds only two one-qubit gates relative to the minimum-known 11, the improvement in CNOT count does not come at a large single-qubit cost."],"supporting_citations":[{"why":"Provides the operator identity (its Eq. 20) and the L–C3Ry–R decomposition on which the 12-CNOT circuit is built.","marker":"[21]"},{"why":"Gives one of the 13-CNOT SOTA circuits (with CNOT depth 11) that the new circuit improves on.","marker":"[20]"},{"why":"Gives the 13-CNOT SOTA circuit with the lowest one-qubit gate count (11) used as a comparison baseline.","marker":"[7]"},{"why":"Gives another 13-CNOT SOTA circuit included in the comparison table.","marker":"[18]"},{"why":"Supplies the Gray-code expansion of the triple-controlled Ry rotation used in the 14-CNOT baseline.","marker":"[6]"},{"why":"Also supplies the Gray-code expansion and related synthesis results for the baseline.","marker":"[15]"}],"fun_headline_variants":["12 CNOTs: New record for double qubit excitation gate","Double qubit excitation gate shrinks to 12 CNOTs","12-CNOT circuit beats 13-CNOT standard","Shallowest double qubit excitation gate: 12 CNOTs"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction assumes that the sandwich of the $L$ CNOT network, the triple-controlled $R_y(2\\theta)$ rotation, and $R=L^{-1}$ reproduces exactly the eight-term Pauli exponential in Eq. (1) with no spurious phase or sign; the paper takes this high-level identity from an earlier reference rather than proving it, so any mismatch between that identity and the angle layout of Fig. 5 would mean the circuit does not realize the intended gate.","fun_headline_variants_meta":{"raw":{"variants":["12 CNOTs: New record for double qubit excitation gate","Double qubit excitation gate shrinks to 12 CNOTs","12-CNOT circuit beats 13-CNOT standard","Shallowest double qubit excitation gate: 12 CNOTs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00057,"raw_usage":{"total_tokens":2644,"prompt_tokens":842,"completion_tokens":1802,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":458,"completion_tokens_details":{"reasoning_tokens":1729}},"tokens_in":458,"tokens_out":1802,"duration_ms":13232,"temperature":1.0,"reasoning_tokens":1729,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T00:28:54.234711+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the $16 \\times 16$ unitary of the Fig. 5 circuit symbolically and compare it entry-by-entry with the matrix exponential of Eq. (1) at a generic angle such as $\\theta = \\pi/7$; any nonzero difference or a relative phase on the $|0011\\rangle \\leftrightarrow |1100\\rangle$ block would falsify the claimed 12-CNOT implementation.","supporting_citations":[{"cited_title":"and Lishman, Jake and Gacon, Julien and Martiel, Simon and Nation, Paul D","cited_arxiv_id":null,"evidence_quote":"Gives one of the 13-CNOT SOTA circuits (with CNOT depth 11) that the new circuit improves on."},{"cited_title":"Proceedings of the International Conference on Automated Planning and Scheduling , volume =","cited_arxiv_id":null,"evidence_quote":"Gives another 13-CNOT SOTA circuit included in the comparison table."},{"cited_title":"2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) , address =","cited_arxiv_id":null,"evidence_quote":"Also supplies the Gray-code expansion and related synthesis results for the baseline."}],"review_version":1}