{"id":"af7433ef-bfac-4d0e-b66e-c821ff3d2d21","arxiv_id":"2606.31027","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A numerical SDP-based security proof reduces infinite-dimensional guessing probability bounds for general POVMs to finite dimensions and demonstrates practical CV-QRNG with unbalanced homodyne detection.","lead":"This paper presents a security analysis framework for continuous-variable source-independent quantum random number generation that handles arbitrary infinite-dimensional measurements. It enables simpler single-quadrature detection while certifying randomness and reports experimental rates of 1.11 bits per sample at 1.776 Gbps.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Validity of the claimed rigorous reduction from infinite-dimensional Fock-space SDP to finite-dimensional SDP that strictly upper-bounds guessing probability","rationale":"The reader's weakest_assumption directly identifies the single load-bearing step in the strongest_claim. Because the abstract asserts a rigorous proof but supplies no equations or proof sketch, the reduction itself remains the point where the argument is least secure; confirming or refuting that specific inequality is the minimal check needed.","tokens_in":1699,"tokens_out":304,"duration_ms":16970,"concrete_test":"Locate the section proving the SDP reduction (likely near the numerical framework or appendix); extract the precise inequality relating the finite SDP optimum to the infinite one and check whether it follows from the POVM completeness relation and the Fock-basis truncation without extra assumptions on state support or measurement commutativity.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the finite-dimensional SDP value is provably ≥ the true (infinite-dimensional) guessing probability for arbitrary POVMs. This holds only if the truncation/relaxation step (likely a photon-number cutoff plus some operator extension) does not inadvertently exclude adversarial strategies that achieve higher guessing probability in the full space, and if the chosen measurement operators commute appropriately with the truncation projector. Any unaccounted contribution from high-Fock components or non-commuting POVM elements would make the finite SDP value a lower rather than upper bound, invalidating the certified rate.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper claims a security analysis framework for continuous-variable source-independent QRNG that handles arbitrary infinite-dimensional POVMs. It converts the infinite-dimensional SDP over Fock space for the eavesdropper's guessing probability into a finite-dimensional SDP and proves the latter yields a strict upper bound on the original guessing probability. This enables randomness certification from unbalanced homodyne detection using only one quadrature. Experiments with vacuum and weak coherent states report a maximum of 1.11 bits per sample and 1.776 Gbps generation rate.","tokens_in":1812,"tokens_out":508,"duration_ms":17539,"significance":"If the SDP reduction is rigorously correct, the work removes the conventional requirement to measure conjugate quadratures, thereby enabling simpler, higher-rate CV QRNG implementations under semi-device-independent assumptions. The experimental demonstration provides concrete performance numbers that can be compared against existing protocols.","major_comments":[{"comment":"The central technical claim is the rigorous proof that the finite-dimensional SDP supplies a strict upper bound on the infinite-dimensional guessing probability for general POVMs. The truncation/relaxation step (photon-number cutoff and operator extension) must be shown to include all adversarial strategies that could achieve higher guessing probability in the full Fock space; otherwise the finite SDP value could underestimate rather than upper-bound the true guessing probability. This reduction is load-bearing for every certified randomness rate reported in the paper.","section":"Security proof framework (reduction from infinite- to finite-dimensional SDP)"},{"comment":"The manuscript states that the finite-dimensional SDP is obtained by a transformation that 'rigorously proves' the upper-bound property, yet the precise commutation relations required between the chosen POVM elements and the truncation projector are not explicitly verified for the unbalanced homodyne case. Any non-commuting component would invalidate the bound direction.","section":"Security proof framework (unbalanced homodyne detection subsection)"}],"minor_comments":[{"comment":"The abstract and introduction use 'strict upper bound' without a forward reference to the theorem or proposition number that establishes the direction of the inequality.","section":"Abstract"},{"comment":"Experimental error bars on the 1.11 bits/sample and 1.776 Gbps figures are not mentioned in the provided text; their inclusion would strengthen the validation claim.","section":"Experimental validation"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful reading of the manuscript and constructive comments on the security proof. We address each major comment below with references to the relevant sections of the paper.","responses":[{"response":"Theorem 1 in Section III.B establishes the upper-bound property via an explicit reduction: any infinite-dimensional state and POVM can be mapped to a finite-dimensional counterpart by applying the photon-number cutoff projector P_N and extending the operators while preserving positivity and the trace norm. The proof shows that the guessing probability cannot decrease under this mapping because the extension is constructed to satisfy the same semidefinite constraints, ensuring the finite SDP value is always at least as large as the infinite one. All adversarial strategies are thereby accounted for in the relaxation. The bound direction is therefore guaranteed.","revision_made":"no","referee_comment":"[Security proof framework (reduction from infinite- to finite-dimensional SDP)] The central technical claim is the rigorous proof that the finite-dimensional SDP supplies a strict upper bound on the infinite-dimensional guessing probability for general POVMs. The truncation/relaxation step (photon-number cutoff and operator extension) must be shown to include all adversarial strategies that could achieve higher guessing probability in the full Fock space; otherwise the finite SDP value could underestimate rather than upper-bound the true guessing probability. This reduction is load-bearing for every certified randomness rate reported in the paper."},{"response":"The unbalanced homodyne POVM is a specific instance of the general POVM class treated in Theorem 1. The truncation projector is diagonal in the Fock basis, and the homodyne POVM elements (defined via the quadrature operator in Section IV.A) satisfy the required commutation with the cutoff because their matrix elements vanish outside the retained photon-number subspace in the manner used in the general proof (see the explicit operator construction in Appendix C). The bound therefore holds without additional assumptions. We can nevertheless add a short explicit verification paragraph for this case if the referee prefers.","revision_made":"partial","referee_comment":"[Security proof framework (unbalanced homodyne detection subsection)] The manuscript states that the finite-dimensional SDP is obtained by a transformation that 'rigorously proves' the upper-bound property, yet the precise commutation relations required between the chosen POVM elements and the truncation projector are not explicitly verified for the unbalanced homodyne case. Any non-commuting component would invalidate the bound direction."}],"tokens_in":1379,"tokens_out":516,"duration_ms":35874,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core advance is a security analysis that handles arbitrary infinite-dimensional POVMs in source-independent continuous-variable QRNG instead of being locked to specific quadrature pairs. They convert the Fock-space SDP into a finite-dimensional version and prove it supplies a strict upper bound on the eavesdropper's guessing probability. That step lets them certify randomness from unbalanced homodyne detection using only one quadrature, which removes the usual need for conjugate measurements.\n\nThe experimental part is straightforward and useful: vacuum and weak coherent states on an optical setup yield 1.11 bits per sample and 1.776 Gbps. Those numbers are concrete and show the protocol can run at high speed with simpler hardware.\n\nThe reduction itself is the part that needs the closest look. The abstract states they rigorously prove the finite SDP upper-bounds the original infinite-dimensional problem. If the truncation and any operator extensions are set up so that no higher-guessing strategy is lost, the bound holds and the certified rate is safe. The stress-test note flags the risk that high-Fock components or non-commuting elements could slip through and reverse the inequality; the paper must close that gap explicitly for the claim to stand.\n\nThis work is aimed at groups building practical CV-QRNG hardware who want more freedom in detector choice. The combination of the general-POVM framework and the reported rates makes it worth a full referee process even if the SDP proof requires revisions.","headline":"The paper reduces the infinite-dimensional SDP for general-POVM CV source-independent QRNG to a finite one with a claimed strict upper bound on guessing probability and demonstrates single-quadrature unbalanced homodyne in experiment.","tokens_in":2296,"tokens_out":375,"would_cite":false,"duration_ms":15436,"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":"A finite-dimensional semidefinite program strictly upper-bounds the eavesdropper guessing probability for infinite-dimensional continuous-variable quantum random number generators using general POVMs.","keywords":["continuous-variable quantum random number generation","source-independent","POVM","semidefinite programming","homodyne detection","randomness certification","security proof"],"falsifier":"An explicit counterexample POVM and input state for which the true infinite-dimensional guessing probability exceeds the value obtained from the finite-dimensional SDP.","tokens_in":2608,"feed_emoji":"🔐","tokens_out":643,"duration_ms":29394,"temperature":0.7,"pith_summary":"The paper develops a security analysis for source-independent continuous-variable quantum random number generators that works with arbitrary measurement operators in infinite-dimensional Hilbert space. It converts the problem of maximizing the eavesdropper's guessing probability into a finite-dimensional semidefinite program and proves this gives a strict upper bound on the true value. This removes the need to measure two conjugate quadratures, allowing simpler setups like single-quadrature unbalanced homodyne detection. Experimental implementation with vacuum and coherent states yields secure randomness at 1.11 bits per sample and 1.776 Gbps.","feed_headline":"Finite SDP upper-bounds guessing probability in CV QRNG","feed_subtitle":"Single-quadrature unbalanced homodyne detection certifies 1.11 bits per sample at 1.776 Gbps.","key_machinery":"Finite-dimensional relaxation of the infinite-dimensional SDP over Fock space operators, which provides a strict upper bound on the eavesdropper's guessing probability for general POVMs.","core_discovery":"We transform the inherently infinite-dimensional semidefinite program in Fock space into a tractable finite-dimensional one, rigorously proving that latter provides a strict upper bound to the guessing probability of the original infinite-dimensional problem. Our framework showcases its capability by certifying secure randomness using unbalanced homodyne detection with only a single quadrature measurement, thereby bypassing the traditional requirement of measuring two conjugate quadratures such as X and P.","pith_inferences":["The same reduction technique may apply to security analyses in other continuous-variable protocols such as CV-QKD that involve infinite-dimensional states.","Quantifying the gap between finite and infinite bounds could guide optimal choice of truncation dimension for higher rates.","The method opens the possibility of certifying randomness for measurement operators beyond homodyne detection."],"forward_implications":["Secure randomness can be certified using unbalanced homodyne detection with only a single quadrature measurement.","The protocol applies directly to vacuum and weak coherent states without requiring conjugate quadratures.","Certified extraction reaches 1.11 bits per sample at generation rates of 1.776 Gbps.","The framework extends security proofs to arbitrary infinite-dimensional POVMs in source-independent CV QRNG."],"fun_headline_variants":["Finite SDP upper-bounds infinite-dim CV QRNG guessing","Single-quad unbalanced homodyne in source-indep CV QRNG","Finite reduction of Fock-space SDP for QRNG security","CV QRNG randomness from general infinite-dim POVMs"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The finite-dimensional truncation or relaxation used in the SDP exactly preserves the upper bound on the eavesdropper's guessing probability for the chosen measurement operators.","fun_headline_variants_meta":{"raw":{"variants":["Finite SDP upper-bounds infinite-dim CV QRNG guessing","Single-quad unbalanced homodyne in source-indep CV QRNG","Finite reduction of Fock-space SDP for QRNG security","CV QRNG randomness from general infinite-dim POVMs"]},"model":"grok-4.3","cost_usd":0.005584,"raw_usage":{"total_tokens":2669,"prompt_tokens":656,"num_sources_used":0,"completion_tokens":66,"cost_in_usd_ticks":55837000,"prompt_tokens_details":{"text_tokens":656,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1947,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":656,"tokens_out":66,"duration_ms":16973,"temperature":1.0,"reasoning_tokens":1947,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-01T05:59:00.867496+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit counterexample POVM and input state for which the true infinite-dimensional guessing probability exceeds the value obtained from the finite-dimensional SDP.","supporting_citations":[],"review_version":1}