{"id":"5ca513c2-5015-449c-b270-cb190939e800","arxiv_id":"2606.02451","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Perturbative programming reduces phase-shift ranges in photonic matrix-vector multiplication by operating near reference configurations and using subtraction, with phase distributions shrinking for larger matrices.","lead":"The paper proposes a perturbative programming method for photonic matrix-vector multiplication that keeps circuits near a fixed reference and uses interferometric subtraction to cut the needed phase-shift range. This targets scalability limits in programmable photonic meshes for analog computing.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Phase distribution shrinkage with matrix size relies on unproven scaling of local conditioning criterion for random matrices","rationale":"The reader's weakest assumption matches the load-bearing point exactly; the abstract-only review correctly flags the need to verify that the reported shrinkage and quantifiable trade-off actually materialize in the full analysis. No other internal inconsistency is visible from the given material.","tokens_in":1685,"tokens_out":298,"duration_ms":16322,"concrete_test":"Re-run the phase-statistics analysis of § (analysis paragraph) on an ensemble of 100 random N×N unitary targets for N=16,32,64 using the identical local conditioning criterion; report the median and 90th-percentile phase excursion versus N. If the scaling exponent is not negative and consistent, the compensation claim for lossy shifters weakens.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The strongest claim requires that favorable reference configurations (found via local conditioning) yield phase statistics whose range or variance shrinks with matrix dimension N for random targets, enabling loss compensation in the subtraction architecture. The abstract states this is shown via analysis of phase statistics, but provides no analytical bound or asymptotic argument; the result is therefore only as secure as the numerical evidence for the specific ensemble and criterion. If the observed shrinkage saturates or reverses for large N (due to the conditioning criterion failing to locate sufficiently close references), the trade-off quantification does not support the scalability conclusion.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper introduces a perturbative programming approach for photonic matrix-vector multiplication in universal unitary meshes and low-depth non-unitary constructions. By operating near a fixed reference configuration identified via a local conditioning criterion and realizing targets through interferometric subtraction, the method aims to reduce the required programmable phase excursion. It analyzes phase statistics for random target matrices, claims that the phase distribution shrinks with increasing matrix size, and quantifies the trade-off with the subtraction architecture's overhead, concluding that for sufficiently lossy phase shifters the reduced range can compensate the penalty.","tokens_in":1783,"tokens_out":484,"duration_ms":13775,"significance":"If the claimed phase-range reduction and its scaling with matrix dimension hold with supporting analysis, the work could offer a practical route to improve scalability of programmable photonic processors by relaxing demands on phase-shifter hardware, particularly in lossy regimes. The approach is framed as conditional on favorable references and loss levels rather than universally applicable.","major_comments":[{"comment":"Abstract: the central claim that 'perturbative programming produces phase distribution shrinking as the matrix size increases' is presented without an analytical bound, asymptotic argument, or description of the numerical evidence (e.g., ensemble size, conditioning criterion details, or observed scaling for large N). This scaling is load-bearing for the scalability conclusion and the subsequent trade-off quantification.","section":"Abstract"},{"comment":"Abstract: the statement that 'for sufficiently lossy phase shifters the reduced phase range can compensate for this penalty' requires explicit quantification of the overhead (e.g., extra loss or power) versus the phase-range benefit; no such numbers, equations, or parameter regimes are supplied in the provided description, leaving the compensation claim unsupported.","section":"Abstract"}],"minor_comments":[{"comment":"The abstract refers to 'analysis of phase statistics' and 'trade-off quantification' but supplies no equations, figures, or section references; adding these would clarify the method.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The manuscript appears to rest on numerical evidence whose robustness for large N is not yet demonstrated; if the full text contains only the abstract-level claims without derivations or data, the work may be better suited as a letter or short communication rather than a full article."},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their detailed review and constructive comments. We address the two major comments point-by-point below, proposing revisions to the abstract to better support the claims.","responses":[{"response":"We agree that the abstract would be strengthened by including more details on the numerical evidence. The manuscript analyzes phase statistics for random target matrices using the local conditioning criterion to identify favorable references, with numerical results demonstrating the shrinking phase distribution as matrix size increases. We will revise the abstract to describe the numerical evidence, including the ensemble details and observed scaling, while noting that the support is numerical rather than analytical.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the central claim that 'perturbative programming produces phase distribution shrinking as the matrix size increases' is presented without an analytical bound, asymptotic argument, or description of the numerical evidence (e.g., ensemble size, conditioning criterion details, or observed scaling for large N). This scaling is load-bearing for the scalability conclusion and the subsequent trade-off quantification."},{"response":"We agree that the abstract should provide more explicit details on the quantification. The manuscript quantifies the trade-off between the reduced phase range and the overhead of the subtraction architecture, identifying regimes where the benefit compensates for sufficiently lossy phase shifters. We will revise the abstract to include a brief reference to the overhead quantification and the relevant parameter regimes from the analysis.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the statement that 'for sufficiently lossy phase shifters the reduced phase range can compensate for this penalty' requires explicit quantification of the overhead (e.g., extra loss or power) versus the phase-range benefit; no such numbers, equations, or parameter regimes are supplied in the provided description, leaving the compensation claim unsupported."}],"tokens_in":1316,"tokens_out":361,"duration_ms":28769,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The one thing to take away is that this work shows how running a photonic mesh perturbatively around a fixed reference, then realizing the target via subtraction, can shrink the needed phase excursion, and that this shrinkage grows with matrix size for random targets. For lossy phase shifters the reduced range can offset the extra loss from the subtraction step.\n\nThey apply the idea to both full unitary meshes and low-depth non-unitary sums of unitaries. The practical step is using a local conditioning criterion to pick the reference, followed by an analysis of the resulting phase distributions across random matrices. That analysis is the main new piece: it is not just the perturbative idea itself but the explicit size-dependent statistics and the quantified trade-off.\n\nThe paper does a clean job framing the engineering constraint and showing a workable programming strategy that stays within the hardware limits. The local conditioning rule is a reasonable way to locate usable references without global search.\n\nThe soft spot is exactly the one the stress-test note flags. The shrinkage result comes from their phase-statistic analysis, but there is no closed-form bound or asymptotic argument given for why the local criterion continues to find sufficiently close references as N grows. If the distributions stop narrowing or the overhead does not stay favorable, the compensation claim weakens. The abstract presents the result as shown, yet the security of the conclusion rests on whatever numerical ensemble they used; readers will want to see how sensitive it is to matrix conditioning or to non-random targets.\n\nThis is for hardware-oriented groups working on scalable analog photonic processors. Someone already building or simulating mesh circuits will get concrete ideas about reference selection and the loss-phase trade-off. It is not a foundational theory paper.\n\nThe work is coherent on its own terms and engages the right literature on photonic computing limits, so it deserves a serious referee who can check the numerics and the conditioning criterion in detail. I would send it to review.","headline":"The paper gives a perturbative route to smaller phase ranges in photonic meshes via reference configs and subtraction, backed by phase stats on random matrices, but the scaling claim lacks an analytical bound.","tokens_in":2270,"tokens_out":468,"would_cite":false,"duration_ms":19650,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Perturbative programming reduces phase-shift ranges in photonic matrix-vector multipliers by operating near fixed references and subtracting interferometrically.","keywords":["photonic matrix-vector multiplication","perturbative programming","phase-shift range","interferometric subtraction","programmable photonic meshes","universal unitary meshes"],"falsifier":"Experimental measurement of the phase-shift distribution needed for ensembles of random target matrices of increasing dimension, comparing perturbative versus conventional programming to check whether the range shrinks and whether loss in the shifters offsets the subtraction penalty.","tokens_in":2584,"feed_emoji":"","tokens_out":534,"duration_ms":16609,"temperature":0.7,"pith_summary":"The paper introduces a perturbative programming method for photonic meshes used in analog matrix-vector multiplication. It keeps the circuit close to a chosen reference configuration and realizes the target matrix through interferometric subtraction, which lowers the programmable phase excursion required. Analysis shows that the resulting phase distributions shrink as matrix size grows. The approach quantifies the overhead from subtraction against the gain from smaller phase ranges, finding that the reduction compensates for the penalty when phase shifters are sufficiently lossy.","feed_headline":"Perturbative method shrinks phase range in photonic matrices","feed_subtitle":"Phase distributions narrow with matrix size and offset subtraction overhead when shifters are lossy","key_machinery":"perturbative programming method that operates near a fixed reference configuration and realizes targets through interferometric subtraction","core_discovery":"Perturbative programming in universal unitary meshes and low-depth sums-of-unitaries architectures produces phase distributions that shrink with increasing matrix dimension, with the reduced phase range compensating the subtraction overhead for sufficiently lossy phase shifters after selecting favorable references via a local conditioning criterion.","pith_inferences":["The local conditioning criterion for selecting references may allow systematic optimization beyond random targets.","The shrinking phase statistics suggest that the method's advantage grows with scale in hardware with fixed phase-shifter loss."],"forward_implications":["Phase distributions obtained for random target matrices shrink as matrix size increases.","The trade-off between reduced phase range and the intrinsic overhead of the subtraction architecture can be quantified.","For sufficiently lossy phase shifters the reduced phase range compensates the penalty introduced by subtraction."],"fun_headline_variants":["Phase range cut via perturbative subtraction in photonic meshes","Matrix size growth narrows phase distributions in photonic circuits","Lossy shifters offset by reduced phase ranges in subtraction setups","Local criterion selects references minimizing phase excursions","Perturbative approach reduces phase needs for unitary matrix meshes"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Favorable reference configurations exist that can be identified via local conditioning and that phase statistics for random matrices shrink with size while the overhead trade-off is quantifiable and favorable for lossy shifters.","fun_headline_variants_meta":{"raw":{"variants":["Phase range cut via perturbative subtraction in photonic meshes","Matrix size growth narrows phase distributions in photonic circuits","Lossy shifters offset by reduced phase ranges in subtraction setups","Local criterion selects references minimizing phase excursions","Perturbative approach reduces phase needs for unitary matrix meshes"]},"model":"grok-4.3","cost_usd":0.005965,"raw_usage":{"total_tokens":2786,"prompt_tokens":585,"num_sources_used":0,"completion_tokens":73,"cost_in_usd_ticks":59649500,"prompt_tokens_details":{"text_tokens":585,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2128,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":585,"tokens_out":73,"duration_ms":19089,"temperature":1.0,"reasoning_tokens":2128,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T12:49:03.010623+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Experimental measurement of the phase-shift distribution needed for ensembles of random target matrices of increasing dimension, comparing perturbative versus conventional programming to check whether the range shrinks and whether loss in the shifters offsets the subtraction penalty.","supporting_citations":[],"review_version":1}