{"id":"402f6525-856f-44b2-afc5-4fad158e7ccd","arxiv_id":"2502.01737","paper_version":2,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Presents a tensor network method in Heisenberg picture for computing permanents in Boson Sampling at optimal classical complexity with extensions to imperfections.","lead":"The paper introduces a Heisenberg picture tensor network formalism for optical circuits that uses the unitary interferometer matrix to compute photon-counting amplitudes. This matches the complexity of the best classical permanent algorithms and extends to loss and distinguishability, potentially aiding large-scale quantum optics simulations.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Whether the operator-basis MPS graphical representation computes the permanent at O(n 2^n) cost without extra tensor-contraction overhead remains unverified","rationale":"The reader's weakest assumption is precisely the load-bearing point for the central complexity claim. With the full text now accessible the same assumption still lacks an explicit contraction-cost proof, so the UNVERDICTED status is unchanged.","tokens_in":1680,"tokens_out":308,"duration_ms":20062,"concrete_test":"Implement the graphical operator-basis MPS for an n=5 Haar-random unitary, extract the permanent via the proposed contraction sequence, and count elementary operations; compare against Ryser's formula on the same matrix. If the MPS route exceeds O(n 2^n) operations or requires bond dimension >2, the complexity claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The strongest claim requires that the newly introduced graphical representation of the operator-basis MPS yields the permanent (via input-output relations encoded in the unitary) at exactly the complexity of the best classical algorithm, with no additional cost from the tensor-network contractions themselves. This holds only if the MPS bond dimensions and contraction order are such that the graphical structure collapses to an algorithm no worse than Ryser-style summation; any growth in virtual dimension with mode or photon number would reintroduce the complexity gap the paper claims to close. The abstract and reader's weakest assumption both locate the risk here, and the Heisenberg-picture construction does not automatically guarantee bounded contraction cost.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript introduces a Heisenberg-picture tensor network formalism for optical quantum circuits, including Boson Sampling. It claims to resolve the complexity mismatch of prior tensor-network methods by introducing a graphical representation of an operator-basis matrix product state (MPS) whose structure encodes the input-output relations of the unitary interferometer matrix, thereby allowing permanent evaluation at the same O(n 2^n) cost as the best classical algorithms; the framework is further extended to incorporate partial distinguishability and photon loss.","tokens_in":1775,"tokens_out":336,"duration_ms":18632,"significance":"If the central complexity claim is established with explicit contraction analysis, the work would supply a tensor-network route to ideal and imperfect Boson Sampling that matches the best known classical scaling while retaining the flexibility of tensor networks for modeling realistic experimental imperfections.","major_comments":[{"comment":"Abstract: the claim that the graphical representation of the operator-basis MPS yields the permanent at exactly the complexity of the best classical algorithm (without extra cost from tensor contractions) is load-bearing yet unsupported by any derivation, bond-dimension bound, or contraction-order argument. The skeptic note correctly identifies that any growth of virtual dimension with mode or photon number would reintroduce the complexity gap the paper asserts to close.","section":"Abstract"},{"comment":"The manuscript provides no explicit pseudocode, complexity proof, or numerical verification that the MPS contraction order and bond dimensions remain bounded independently of photon number when the unitary is encoded via the graphical operator-basis representation.","section":null}],"minor_comments":[],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful reading and constructive feedback. We address each major comment below and will revise the manuscript to provide the requested explicit derivations and supporting material.","responses":[{"response":"We agree that the abstract claim requires explicit supporting analysis. The graphical operator-basis MPS construction in the manuscript encodes the unitary matrix elements such that the network structure directly implements the inclusion-exclusion summation underlying the Ryser formula. In the revision we will add a dedicated subsection that (i) proves the virtual bond dimension remains bounded by a small constant independent of photon number n (due to the local operator-basis representation of each mode), and (ii) shows that an optimal left-to-right contraction order reproduces exactly the O(n 2^n) arithmetic operations of the best classical permanent algorithm with no additional tensor-contraction overhead.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the claim that the graphical representation of the operator-basis MPS yields the permanent at exactly the complexity of the best classical algorithm (without extra cost from tensor contractions) is load-bearing yet unsupported by any derivation, bond-dimension bound, or contraction-order argument. The skeptic note correctly identifies that any growth of virtual dimension with mode or photon number would reintroduce the complexity gap the paper asserts to close."},{"response":"We acknowledge the absence of these explicit elements. The current text relies on the graphical construction to imply the complexity result. In the revised version we will insert (a) pseudocode for the contraction algorithm, (b) a formal proof establishing that bond dimensions stay O(1) with respect to both mode number and photon number, and (c) small-n numerical benchmarks confirming that observed runtimes track the expected O(n 2^n) scaling without extra factors.","revision_made":"yes","referee_comment":"The manuscript provides no explicit pseudocode, complexity proof, or numerical verification that the MPS contraction order and bond dimensions remain bounded independently of photon number when the unitary is encoded via the graphical operator-basis representation."}],"tokens_in":1252,"tokens_out":439,"duration_ms":24820,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is a shift to the Heisenberg picture with an operator-basis MPS whose graphical representation is said to let you extract the permanent directly from the unitary at the same O(n 2^n) cost as the best classical algorithms, while also folding in loss and partial distinguishability. That combination is new. The practical extensions are the part that lands cleanly: once you have the MPS structure, adding those imperfections looks straightforward and relevant to real interferometry work. Credit for trying to close the usual tensor-network versus permanent complexity mismatch instead of just simulating the state evolution. The soft spot sits exactly where the stress-test note flags it. The claim that the graphical MPS representation incurs no extra contraction cost rests on the bond dimensions and contraction order staying controlled by the unitary alone. Nothing in the abstract shows a derivation or small example confirming that the virtual dimension does not grow with mode or photon number. If it does grow, the promised complexity match disappears. The paper is written for people already working on tensor networks for boson sampling and optical circuits. A reader who wants a fresh representation that also handles experimental imperfections will get something usable if the complexity argument holds; otherwise it is mainly an interesting reformulation. The thinking is coherent on its own terms and engages the right literature, so it is worth sending out for refereeing even though the central efficiency claim needs the full derivations and any numerical checks to be evaluated properly.","headline":"The paper offers a Heisenberg-picture operator-basis MPS tensor network for optical circuits that claims to compute permanents at Ryser-level cost, but the abstract leaves the contraction overhead unverified and the full details are needed to check it.","tokens_in":2256,"tokens_out":369,"would_cite":false,"duration_ms":16194,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"Operator-basis MPS graphical calculus for permanents has no structural overlap with RS forcing chain or J-cost","alignment":"orthogonal","rationale":"The paper's core machinery is a specialized MPS representation of evolved bosonic ladder operators (Eqs. 2-5), with nilpotent A-matrices, graphical merging rules (Eqs. 7-10), and combinatorial contraction cost O(n^{2} 2^{n}) matching Ryser's algorithm for permanents. This is a tensor-network technique in quantum optics/Boson Sampling that exploits unitary input-output relations. RS theorems (reality_from_one_distinction, AbsoluteFloorClosure, AlexanderDuality for D=3, Jcost uniqueness in Cost/FunctionalEquation, phi-ladder constants) derive geometry, 8-tick periodicity, and the reciprocal cost J(x) = ½(x + x^{-1}) - 1 from a single distinction with zero adjustable parameters. No J-cost, golden-ratio identities, 8-period clock, or parameter-free constant derivations appear; the domain (optical circuit simulation) lies outside RS scope with neither isomorphism nor contradiction.","tokens_in":51914,"confidence":"high","tokens_out":243,"duration_ms":7543,"cache_read_input_tokens":38528,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A Heisenberg-picture tensor network computes boson-sampling permanents at the complexity of the fastest classical algorithms.","keywords":["tensor networks","boson sampling","heisenberg picture","matrix product states","permanent","photon loss","partial distinguishability","quantum optics"],"falsifier":"Apply the procedure to a known 4-mode, 3-photon interferometer whose permanent is 6 and check whether the reported amplitude equals the exact value with runtime scaling linearly in the number of modes.","tokens_in":2564,"feed_emoji":"⚛️","tokens_out":570,"duration_ms":19139,"temperature":0.7,"pith_summary":"The paper develops a tensor-network representation for optical circuits that tracks photon creation operators rather than the full quantum state. It encodes the unitary interferometer matrix directly into an operator-basis matrix product state whose structure permits permanent evaluation without the usual contraction overhead. The same representation extends to photon loss and partial distinguishability. A reader would care because the method removes the mismatch between generic tensor-network simulation cost and the specific hardness of photon-counting probabilities.","feed_headline":"Heisenberg tensor networks compute boson permanents at optimal classical speed","feed_subtitle":"The operator-basis matrix product state encodes the unitary matrix so that amplitudes match the fastest known permanent algorithms while nat","key_machinery":"The graphical representation of the operator-basis matrix product state that encodes the unitary matrix action on photon creation operators.","core_discovery":"By working in the Heisenberg picture the evolution of creation operators is represented by a matrix product state whose graphical contraction directly yields the permanent of the interferometer submatrix. This construction matches the complexity of the best known classical permanent algorithms while incorporating loss and distinguishability through local modifications to the same tensor network.","pith_inferences":["The approach may extend to other sampling tasks whose amplitudes are permanents of submatrices.","Hybrid verification schemes could use the tensor network to certify small subsystems of larger optical experiments.","Similar Heisenberg-picture constructions might apply to other linear bosonic systems beyond optics."],"forward_implications":["Boson-sampling probabilities can be obtained with the same asymptotic cost as Ryser-style permanent algorithms.","Photon loss and partial distinguishability are included by local tensor modifications without changing the overall scaling.","The framework applies to any linear optical circuit whose unitary matrix is known.","Output statistics for large interferometers become accessible on classical hardware at optimal permanent complexity."],"fun_headline_variants":["Heisenberg MPS computes permanents at optimal classical complexity","Operator-basis MPS yields boson permanents at best speed","Tensor networks match classical permanent algorithms in Heisenberg picture","Graphical MPS contraction gives optimal permanent for optical circuits"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The graphical structure of the operator-basis matrix product state encodes all input-output relations so that permanent extraction incurs no extra contraction cost beyond the best classical methods.","fun_headline_variants_meta":{"raw":{"variants":["Heisenberg MPS computes permanents at optimal classical complexity","Operator-basis MPS yields boson permanents at best speed","Tensor networks match classical permanent algorithms in Heisenberg picture","Graphical MPS contraction gives optimal permanent for optical circuits"]},"model":"grok-4.3","cost_usd":0.006486,"raw_usage":{"total_tokens":2994,"prompt_tokens":584,"num_sources_used":0,"completion_tokens":59,"cost_in_usd_ticks":64862000,"prompt_tokens_details":{"text_tokens":584,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2351,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":584,"tokens_out":59,"duration_ms":19306,"temperature":1.0,"reasoning_tokens":2351,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-23T03:26:48.737425+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Apply the procedure to a known 4-mode, 3-photon interferometer whose permanent is 6 and check whether the reported amplitude equals the exact value with runtime scaling linearly in the number of modes.","supporting_citations":[],"review_version":1}