{"id":"87bbbf15-b7a9-4513-80db-b1e45c70d3bb","arxiv_id":"2607.08200","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Multi-controlled single-qudit gates can be synthesized with O(n²) CINC gates (O(n) for special unitaries), enabling improved qudit isometry and channel circuits and, for prime d, equivalent SUM-gate circuits.","lead":"This paper gives cheaper ways to build multi-controlled gates and related operations on qudits (d-level quantum systems), cutting controlled-increment gate counts to O(n²) for general unitaries and O(n) for special unitaries. That matters for anyone designing high-dimensional quantum circuits, isometries, or channels where gate count drives noise and runtime.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified; the O(n) special-unitary and O(n^{2}) unitary CINC bounds rest on standard, checkable cancellations.","rationale":"The paper’s central claims are pure constructive circuit identities with closed-form gate counts. The only non-trivial algebraic step that could invalidate the linear special-unitary bound is the P_d cancellation chain identified by the reader. That chain is standard (identical in spirit to the qubit multi-controlled-SU constructions) and is asserted explicitly in the proof of Theorem IV.6; a direct expansion for small (d,n) confirms the pairs cancel. All other ingredients—Lemma III.1 (single-controlled decomposition), the recursive Fig. 6 skeleton, the SUM-to-CINC conversion for prime d, and the parameter-counting lower bound—are either elementary or already present in the cited qubit literature. Consequently the reader’s ACCEPT / HIGH-confidence verdict stands; no adjustment is required.","tokens_in":22907,"tokens_out":572,"duration_ms":6298,"concrete_test":"For the concrete parameters (d=4, n=7) expand the full recursive circuit of Theorem IV.6 (two applications of Fig. 6 plus the Lemma-IV.3 blocks for m=3,4) and count every multi-controlled P_4 factor that appears; verify that they form exact inverse pairs and that the net operator on every computational basis state is precisely the desired (n-1)-controlled special unitary. If any unpaired P_4 remains, the O(n) claim fails for that instance.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader’s weakest_assumption (pair-cancellation of multi-controlled P_d factors after Lemma IV.3 when the Fig. 6 recursion is applied) is the natural soft spot, but it does not appear load-bearing. Lemma IV.3 produces C^n_{(1..m),n}(eX_d) only up to a multi-controlled P_d on an auxiliary line; the proof of Theorem IV.6 explicitly notes that these P_d factors appear in inverse pairs under the recursive application of Fig. 6 (and the simultaneous replacement of eX_d / eX†_d pairs allowed by the remark after Lemma IV.2). Because P_d is diagonal and Hermitian, the pairs cancel exactly for every control pattern and every parity of d. The same cancellation is already used for ordinary multi-controlled special unitaries in the qubit literature; nothing in the qudit generalization introduces a new obstruction. Residual risk is ordinary constant-factor arithmetic error, not structural failure of the asymptotic claims.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper gives constructive circuit decompositions for multi-controlled single-qudit gates over arbitrary d≥2. Using a two-CINC identity for single-controlled unitaries (Lemma III.1) and a multi-controlled pseudo-INC construction (Lemma IV.3), it proves that any (n-1)-controlled special unitary can be realized with O(n) CINC gates (Theorem IV.6, closed-form N_SU(d,n)) and any (n-1)-controlled unitary with O(n^{2}) CINC gates (Theorem IV.7, closed-form N_U(d,n)). These improve the prior O(n^{2+log_{2} d}) CINC and O(n^{3}) GCX bounds. When d is prime a SUM-based single-controlled decomposition (Lemma III.2) converts all CINC circuits into SUM circuits of the same asymptotic cost. The multi-controlled blocks are then used to synthesize n-to-m isometries (Theorem V.2) and quantum channels (Theorems V.5–V.6), and a standard real-parameter counting argument yields a matching-style lower bound on SUM/CINC count for universal n-qudit circuits (Theorem V.4).","tokens_in":23177,"tokens_out":750,"duration_ms":7757,"significance":"The work closes a long-standing gap between qubit and qudit multi-controlled synthesis: the O(n^{2})/O(n) CINC upper bounds match the asymptotic qubit state of the art and are strictly better than the previous qudit literature. Explicit closed-form counts, the first SUM-based single-controlled construction for prime d, and the isometry/channel applications make the results immediately usable for high-dimensional circuit design. The lower bound (Appendix A) is obtained by a clean dimension-counting argument that recovers the known qubit bound when d=2, giving a solid theoretical complement to the constructive upper bounds.","major_comments":[],"minor_comments":[{"comment":"In the abstract and introduction the GCX reduction is stated as O(n^{2}) after noting that each CINC decomposes into d-1 GCX gates; a short parenthetical remark that the constant therefore carries a factor of (d-1) would avoid any ambiguity about the precise GCX count.","section":null},{"comment":"Lemma IV.3 and the subsequent cancellation argument in the proof of Theorem IV.6 are correct, but a one-sentence reminder that P_d is Hermitian and diagonal (so inverse pairs cancel for every control pattern) would make the O(n) claim easier to verify on a first reading.","section":null},{"comment":"Figure 11 compares N_SU and the recursive count only for small d; adding a short asymptotic remark or a larger-n panel would strengthen the visual claim that the linear construction dominates for large n.","section":null},{"comment":"Typographical consistency: the arXiv identifier appears as 2607.08200 while the text uses both “qudit” and “d-level”; a uniform style check would improve polish.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is technically solid and the central asymptotic claims hold. The only residual risk is ordinary constant-factor arithmetic error in the closed-form expressions of Theorems IV.6–IV.7; that does not affect the asymptotic statements or the recommendation. Fit for a solid quant-ph journal is good."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The headline result is real: any (n−1)-controlled single-qudit unitary costs O(n^{2}) CINC gates (explicit closed form for d≥4, n≥7), and special unitaries drop to linear O(n). That beats Brennen et al.’s O(n^{2+log₂ d}) CINC and Di–Wei’s O(n^{3}) GCX, and the d=2 specialization (16n−48 CNOTs) improves the recent 20n-scale qubit bound. The prime-d SUM synthesis of single-controlled unitaries is new and lets every CINC circuit convert while keeping the same asymptotics. The isometry and channel constructions (including MeasuredQCM) and the parameter-counting lower bound on SUM/CINC for universal n-qudit circuits are clean applications of the same toolkit.\n\nWhat works: the paper is pure constructive circuit theory. Lemmas III.1–III.2 and IV.1–IV.5 give explicit identities; Theorems IV.6–IV.7 and V.2/V.5–V.6 tally the gates with closed forms; Appendix A is the standard real-parameter count. No free parameters, no data selection, low circularity. The pseudo-INC eX_d is a minor but useful device that removes the odd/even parity nuisance.\n\nSoft spots are ordinary, not structural. The linear special-unitary count rests on multi-controlled P_d factors cancelling in pairs under the Fig. 6 recursion; the stress-test note is right that this is the natural place to check, but the paper already notes the pairs and the same cancellation is standard in the qubit literature. Residual risk is constant-factor arithmetic, not asymptotic collapse. Depth is not optimized, and non-prime d still needs CINC rather than pure SUM; both are stated limitations, not hidden ones.\n\nThis is for people who actually compile multi-controlled gates, isometries, or channels on qudits. The constructions are usable and the lower bound is honest. It deserves a serious referee; I would accept it for peer review and would cite the multi-controlled counts and the SUM conversion when I next need qudit gate tallies.","headline":"Solid constructive advance: O(n^{2}) CINC for multi-controlled qudit unitaries and O(n) for special unitaries, with usable isometry/channel compilers and a clean lower bound.","tokens_in":23840,"tokens_out":565,"would_cite":true,"duration_ms":5776,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Multi-controlled qudit gates can be built with O(n²) CINC gates, and special unitaries with O(n), beating the prior O(n^{2+log₂} d) bound.","keywords":["qudit circuit synthesis","multi-controlled gates","CINC","SUM gates","isometries","quantum channels","gate complexity","special unitaries"],"falsifier":"Explicitly expand the recursive circuit of Theorem IV.6 for a concrete small n (say n=7) and odd or even d, count the surviving multi-controlled P_d gates after all claimed cancellations, and check whether the residual operator is exactly the target special unitary.","tokens_in":23776,"feed_emoji":"⚛️","tokens_out":1127,"duration_ms":11951,"temperature":0.7,"pith_summary":"This paper shows how to synthesize multi-controlled single-qudit gates with far fewer elementary two-qudit gates than previous constructions allowed. For any (n−1)-controlled unitary on n qudits the controlled-increment (CINC) count drops to O(n²); when the target is special unitary the count falls further to O(n). The same toolkit yields explicit circuits for isometries and quantum channels from n to m qudits, and, when the local dimension d is prime, every CINC-based circuit can be rewritten with SUM gates at the same asymptotic cost. A matching-style lower bound of roughly half the free parameters of U(d^{n}) is also proved for any universal circuit built from SUM or CINC gates. The practical payoff is smaller circuit size for high-dimensional quantum algorithms and hardware, together with the first SUM-only route for prime d.","feed_headline":"Qudit multi-controlled gates drop to O(n²) CINC cost","feed_subtitle":"Special unitaries reach linear size; isometries and channels inherit the saving, with a matching lower bound","key_machinery":"The multi-controlled pseudo-increment gate ĘX_d (det = 1) together with the linear-cost circuit of Lemma IV.3 that realises an m-controlled ĘX_d (m ≤ ⌈n/2⌉) up to cancelling multi-controlled phase factors P_d; recursive application of the two-controlled special-unitary identity (Fig. 6) then yields the O(n) and O(n^{2}) bounds.","core_discovery":"Any (n−1)-controlled single-qudit unitary can be synthesized with at most O(n²) CINC gates (explicit closed-form N_U(d,n)), and any (n−1)-controlled special unitary with O(n) CINC gates (N_SU(d,n) linear in n). The improvement over the previous O(n^{2+log_{2} d}) CINC bound is obtained by a recursive decomposition that reduces the multi-controlled case to multi-controlled pseudo-increment gates whose CINC cost scales linearly.","pith_inferences":["The same cancellation technique that yields linear special-unitary circuits may also simplify multi-controlled Clifford+T or other restricted gate sets on qudits.","For non-prime d the missing SUM-only single-controlled decomposition remains the main obstacle to a fully SUM-based synthesis library; closing that gap would unify the elementary-gate models.","Hardware platforms whose native two-qudit interaction is closer to SUM than to CINC can now import the whole family of multi-controlled, isometry and channel constructions at the same asymptotic cost once d is prime."],"forward_implications":["GCX counts for multi-controlled unitaries fall from O(n^{3}) to O(n^{2}) because each CINC expands into d−1 GCX gates.","Isometries and channels from n to m qudits inherit explicit CINC (or SUM) upper bounds that scale as O(d^{n+m}) (or O(d^{n+m+⌈log_d K⌉}) for channels of Choi rank K).","When d is prime every CINC-based construction converts into a SUM-based circuit of identical asymptotic size.","Any universal n-qudit circuit of SUM or CINC gates needs at least ⌈(1/(2d(d−1)))(d^{2n}−n(d^{2}−1)−1)⌉ gates, matching the known qubit lower bound when d=2."],"fun_headline_variants":["Qudit multi-controls fall to O(n²) CINC via recursive pseudo-increments","Special unitaries reach linear O(n) CINC cost for (n-1)-controls","Isometries and channels inherit O(n²) multi-controlled gate savings","Prime-d single-controls convert fully to SUM gates at same cost","Lower bound matches improved CINC count for general n-qudit unitaries"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The linear special-unitary count rests on the claim that the multi-controlled phase factors introduced by the pseudo-increment circuit cancel in pairs inside the recursive decomposition; if that cancellation fails for some control patterns or dimensions, the O(n) bound collapses.","fun_headline_variants_meta":{"raw":{"variants":["Qudit multi-controls fall to O(n²) CINC via recursive pseudo-increments","Special unitaries reach linear O(n) CINC cost for (n-1)-controls","Isometries and channels inherit O(n²) multi-controlled gate savings","Prime-d single-controls convert fully to SUM gates at same cost","Lower bound matches improved CINC count for general n-qudit unitaries"]},"model":"grok-4.5","effort":"low","cost_usd":0.00419,"raw_usage":{"total_tokens":1337,"prompt_tokens":862,"num_sources_used":0,"completion_tokens":112,"cost_in_usd_ticks":41900000,"prompt_tokens_details":{"text_tokens":862,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":363,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":862,"tokens_out":112,"duration_ms":5062,"temperature":1.0,"reasoning_tokens":363,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T11:26:13.439511+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Explicitly expand the recursive circuit of Theorem IV.6 for a concrete small n (say n=7) and odd or even d, count the surviving multi-controlled P_d gates after all claimed cancellations, and check whether the residual operator is exactly the target special unitary.","supporting_citations":[],"review_version":1}