{"id":"704c554e-600a-4f7d-ada5-b3986dca75f9","arxiv_id":"2412.00197","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A protocol to split a qubit in a graph state into two qubits while preserving selected connections, requiring only one Bell pair of additional entanglement.","lead":"This paper introduces a protocol called graph state fission, which splits one qubit of an entangled graph state into two while preserving chosen connections, using one Bell pair as the minimum extra entanglement. It is proposed as a tool for reconfiguring entanglement in quantum networks and error correction.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1's one-ebit lower bound is false as stated: for a degree-1 vertex, fission can be done with zero additional ebits via a SWAP with a |+> ancilla.","rationale":"The most load-bearing concern is the optimality theorem, which is the paper's strongest quantitative claim. The reader correctly identified the gap that the post-fission two-qubit party need not share two ebits, but did not note the decisive degree-1 counterexample: a SWAP with a |+> ancilla achieves the claimed fission for a degree-1 vertex using zero additional ebits. This makes the theorem false as stated, not merely unproven. The paper's protocol and the one-ebit lower bound remain valid for vertices of degree at least two, so the core idea is salvageable with a modest restriction to the theorem. Since the reader's CONDITIONAL verdict already requires revision, our read does not change the verdict; it sharpens the required revision. The unverified protocol correctness remains a secondary concern, but we found no concrete counterexample there, and the optimality counterexample is decisive on its own.","tokens_in":8808,"tokens_out":17985,"duration_ms":156701,"concrete_test":"Simulate the fission of vertex 2 in the two-vertex connected graph state (Bell pair). Prepare ancilla 2' in |+>, apply SWAP_{2,2'}, and verify that the final state equals the graph state on edge (1,2') plus isolated vertex 2. Compute the von Neumann entropy of the reduced state on {2,2'}; if it equals 1 ebit, the protocol used zero additional ebits, directly refuting Theorem 1's one-ebit lower bound for 'any qubit'.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 1 claims that any fission of a qubit in a connected graph state, carrying one neighbor, requires at least one ebit. The proof argues that after fission the two-qubit central party shares two ebits with the remaining nodes because the state is 1-uniform. This inference is invalid: 1-uniformity bounds single-qubit reductions, while the entropy of a two-qubit subset equals the GF(2) rank of its adjacency rows to the complement. For a degree-1 vertex (e.g., the two-vertex graph 1-2), a valid fission splits 2 into {2,2'} with neighbor 1 attached to 2' and vertex 2 isolated. The central bipartition {2,2'} vs {1} has entropy 1 ebit, not 2. Moreover, this fission is achievable with zero additional ebits: prepare an ancilla 2' in |+>, apply a SWAP between qubits 2 and 2', yielding the Bell pair on (1,2') and |+> on 2. This is a local unitary on the central register and consumes no entanglement, contradicting the theorem. The lower bound can be repaired by requiring the selected vertex to have degree at least 2, in which case both split qubits have nonempty, disjoint outside neighborhoods and the central bipartition has rank 2; but the theorem as stated is false.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces \"graph state fission,\" a protocol for splitting a selected qubit of a graph state into two qubits while preserving selected neighbor connections. The basic version uses an auxiliary Bell state and is claimed to require exactly one ebit of additional entanglement; a generalized version uses a GHZ state to split off arbitrary neighbor subsets. The authors state an optimality theorem (Theorem 1) for the single-neighbor case, sketch a resource-minimization strategy via local complementation, and discuss applications to purification, modular quantum computing, entanglement routing, and quantum secret sharing. The technical content is presented through figures and terse textual descriptions, with no explicit stabilizer or circuit-level verification of the proposed transformations.","tokens_in":9134,"tokens_out":6159,"duration_ms":56903,"significance":"If established, graph state fission would be a useful addition to the graph-state manipulation toolbox, providing a reverse operation to the well-studied fusion process and potentially enabling flexible entanglement distribution and resource-efficient state partitioning. The paper identifies a genuine gap in the literature and proposes a conceptually simple construction. However, the optimality claim is false as stated, and the correctness of the central protocol is not formally demonstrated. The significance therefore depends on the authors closing these technical gaps; as written, the paper reads as a promising proposal rather than a validated result.","major_comments":[{"comment":"Theorem 1 is false as stated because it quantifies over \"any qubit in a connected graph state.\" For the two-vertex connected graph 1-2, fission of qubit 2 carrying neighbor 1 can be performed with zero additional ebits: prepare an ancilla 2' in |+>, apply a SWAP between qubits 2 and 2' (a local unitary on the central register), yielding the Bell pair on (1,2') and the product state |+> on qubit 2. This contradicts the claimed lower bound of one ebit. The proof's inference that the post-fission two-qubit central party \"shares two ebits with the remaining nodes\" is invalid: 1-uniformity constrains only single-qubit reduced density operators, while for graph states the entanglement entropy of a subset A is the GF(2) rank of the adjacency submatrix between A and its complement. In the example above that rank is 1, not 2. The theorem may be repairable by restricting to vertices of degree at least 2 and proving a rank-2 condition, but the theorem and proof must be corrected.","section":"Optimality (Theorem 1)"},{"comment":"The correctness of the central protocol is only asserted and illustrated; no stabilizer calculation, circuit identity, or graph-state transformation proof is provided for the sequence of local complementations, Z-measurements, and CZ operations. This is the load-bearing claim of the paper: if the protocol does not implement the claimed graph state, the applications do not follow. The authors should provide an explicit step-by-step verification, for example a stabilizer table showing how the graph-state stabilizers evolve under each operation and that the final state is the claimed graph state, including the case of the GHZ-based protocol for arbitrary neighbor subsets.","section":"Fission protocol 1 (Fig. 2) and Fission protocol 2 (Fig. 3)"},{"comment":"The statements that \"a similar argument\" proves k fission operations require k ebits, and that local complementation can reduce the required GHZ size, are not substantiated. The k-fold claim requires a careful resource-counting argument, especially because sequential fissions may reuse or disturb previously prepared entanglement. The resource-minimization example in Fig. 4 is qualitative and lacks a proof that the LU-equivalent graph yields the claimed reduction in all cases. These claims support the paper's generality and should either be proved or explicitly qualified as observations.","section":"Optimality and Minimizing resources"}],"minor_comments":[{"comment":"The word \"wihtout\" in the introductory paragraph of \"Fission protocol 2. Arbitrary neighbors\" should be \"without.\"","section":"Fission protocol 2 (text)"},{"comment":"The phrase \"aflexible possibility\" should be \"a flexible possibility.\"","section":"Applications (text)"},{"comment":"The term \"1-uniform\" is used without definition; either define it explicitly or provide a precise citation. The current citation [49] is an arXiv preprint and may not be the most standard reference for this notion.","section":"Basic concepts / Theorem 1"},{"comment":"The paper does not formally define \"fission\" in terms of input graph, selected vertex, allowed operations, and resource metric. A precise definition would clarify the theorem's quantification over \"any qubit\" and prevent edge cases such as degree-1 vertices.","section":"General (formal definitions)"},{"comment":"The figure captions and text describe the steps, but the actual operations in each panel are not fully explicit (e.g., which qubits are measured, which CZ gates are applied, and the exact local complementation vertices). A table or explicit circuit diagram would substantially improve reproducibility.","section":"Figures 2 and 3"}],"recommendation":"major_revision","confidential_remarks":"The central idea is appealing and the applications are plausible, but the paper currently has a false optimality theorem and no formal correctness proof for the protocol. Both issues appear fixable within the manuscript's scope: the theorem can be restricted to degree at least 2 with a rank-based proof, and the protocol can be verified via stabilizer tables. If the authors are unwilling or unable to provide such proofs, the paper would not meet the standard for publication in a serious journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the fission protocol itself is a nice new tool — the reverse of fusion, with selective neighbor routing via a Bell/GHZ ancilla plus local complementation and measurements. That is new and likely useful for quantum network people. The figures convey the sequence clearly enough that a competent reader can reconstruct the circuit, though a stabilizer-level proof would be better. The applications talk is speculative but not outrageous; the purification and modular-QEC examples are standard motivators.\n\nThe soft spot is Theorem 1. As stated, it is false. For a degree-1 vertex in a two-node graph, you can split without any additional ebits: prepare |+> on an ancilla, SWAP the original qubit with the ancilla, done. The original neighbor ends up entangled with the new qubit, the original qubit is isolated. No additional entanglement is consumed. The proof's step from 1-uniformity to \"the two-qubit central party shares two ebits\" fails because 1-uniformity only constrains single-qubit reductions; the two-qubit entropy depends on the rank of adjacency rows to the complement, which for a leaf vertex is 1, not 2. The theorem can likely be repaired by requiring the selected qubit to have degree at least 2, in which case the two split qubits have nonempty disjoint outside neighborhoods and the central bipartition has rank 2. But the current statement, and its \"k operations need k ebits\" generalization, need correction.\n\nAlso worth flagging: the paper never gives an explicit stabilizer or circuit-level verification that the Fig. 2 sequence yields the claimed output. I traced it for small cases and it looks right for degree ≥2, but a referee should ask for a clean proof, maybe via local complementation rules.\n\nBottom line: this is worth engaging with. The fission operation is a legitimate addition to the graph-state manipulation toolbox, and the resource-optimality question is interesting even if the answer needs a degree condition. I would send it to peer review with a request to fix Theorem 1 and add a stabilizer verification. I would not cite it as-is, but I would cite a corrected version.","headline":"Fission protocol is a genuinely useful new primitive, but the optimality theorem is overstated: a degree-1 vertex can be split for free.","tokens_in":9558,"tokens_out":3880,"would_cite":false,"duration_ms":35260,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P68"],"pacs":["03.67.Mn"],"model":"deepseek-v4-flash","headline":"A new protocol splits a qubit in a graph state while keeping every edge and using just one ebit of extra entanglement.","keywords":["graph states","fission","entanglement manipulation","local complementation","Bell state","GHZ state","quantum networks","resource optimality"],"falsifier":"Take a small concrete graph state, such as a three-qubit path, run the fission protocol with one Bell pair, and compute the final stabilizer generators; if the resulting state is not locally equivalent to the predicted graph state, the protocol's correctness fails. Separately, compute the entanglement entropy between the two central qubits and the rest after the operation: if it is not exactly two ebits for some valid fission, the optimality bound's premise is false.","tokens_in":8646,"feed_emoji":"✂️","tokens_out":4602,"duration_ms":38540,"temperature":0.7,"pith_summary":"This paper introduces 'fission,' the reverse of graph-state fusion: a protocol that splits one qubit in an arbitrary graph state into two qubits while preserving all existing edges and letting the experimenter choose which original neighbors attach to each new qubit. The basic version, carrying one neighbor along, consumes exactly one Bell pair (one ebit) of additional entanglement, and the authors prove this is the minimum possible. For arbitrary neighbor selection, the protocol uses an auxiliary GHZ state of the appropriate size. The authors argue this beats straightforward qubit-measurement methods in overhead and security, since only the directly involved parties must cooperate. If correct, the protocol gives quantum networks a flexible tool for dynamic entanglement management.","feed_headline":"Fission splits a graph-state qubit with just one ebit","feed_subtitle":"Reverse of fusion keeps every edge and lets you choose which neighbors stay attached, opening new ways to reshape entangled networks.","key_machinery":"The protocol's machinery is the graph-state stabilizer formalism together with local complementation, a unitary operation that rewires a vertex's neighborhood while preserving the state up to local unitaries. Fission works by attaching an auxiliary Bell or GHZ state to the qubit to be split, performing local complementations and Pauli-Z measurements to decouple selected neighbors onto the auxiliary qubits, and finally applying a CZ gate and local complementation to restore the graph structure. The optimality argument rests on the 1-uniformity property of connected graph states and on the fact that local operations cannot increase entanglement across any bipartition.","core_discovery":"The central claim is that any qubit in a connected graph state can be split into two (or more) qubits with full control over which neighbors remain connected to each fragment, using only local operations plus a single Bell state (for one carried neighbor) or a GHZ state of matched size (for arbitrary selection). This is achieved by entangling the auxiliary state with the involved qubits, applying local complementations and Z-measurements, and disentangling at the end. Theorem 1 states that at least one ebit is necessary for one fission with one neighbor carried along, because a connected graph state is 1-uniform (each single qubit is maximally mixed with the rest) and after fission the central two-qubit party must share two ebits with the rest; since local operations cannot increase entanglement across a bipartition, one extra ebit is needed. The protocol is presented as optimal in this basic configuration and generalizes to k fissions needing at least k ebits.","pith_inferences":["The protocol's reliance on only local complementation and Z-measurements means it should be implementable on any platform that can realize graph states and such measurements, such as photonic cluster states; a concrete circuit-level implementation for a small state is a direct next step.","Fission naturally pairs with existing fusion operations: a network could use fusion to grow states and fission to carve them into wanted topologies, effectively making entanglement distribution programmable.","The resource-optimization idea of pre-applying local complementations to minimize the GHZ size could be generalized into an automated search for the cheapest fission implementation given a target graph and split.","A possible extension beyond graph states is to define fission for general stabilizer states by tracking the stabilizer generators through the splitting operation, which the authors explicitly list as future work."],"forward_implications":["If correct, any fixed graph-state source in a quantum network can be reconfigured on demand by fission, without regenerating entanglement from scratch.","Fusion and fission together give a complete toolbox for splitting and recombining graph states, enabling purify-then-reassemble strategies that improve entanglement purification efficiency.","The protocol's security property, that only the parties directly involved need to cooperate, could support multiparty cryptographic tasks where untrusted nodes are selectively excluded.","The claimed optimality means the resource overhead cannot be reduced below one ebit per fission, setting a benchmark for any alternative splitting method."],"supporting_citations":[{"why":"Supplies the local complementation formalism and the fact that Pauli measurements induce local complementation plus edge deletion.","marker":"[21]"},{"why":"Defines graph states, their stabilizers, and 1-uniformity; used by both the protocol and the optimality proof.","marker":"[22]"},{"why":"Provides the stabilizer formalism underlying the graph-state definition.","marker":"[20]"},{"why":"Cited as the source of the 1-uniformity property used in Theorem 1's lower bound.","marker":"[49]"},{"why":"Represents the baseline method (Z-measurement edge deletion) that fission improves upon, and is later referenced for entanglement routing.","marker":"[48]"},{"why":"Describes graph-state fusion, the operation that fission inverts.","marker":"[24]"},{"why":"Defines the ebit as the unit of bipartite entanglement used in the optimality statement.","marker":"[45]"}],"fun_headline_variants":["Fission splits a graph-state qubit with just one ebit","Reverse of fusion: one ebit splits a qubit, choose neighbors","Split a qubit, pick which neighbors stay: fission uses one ebit","Graph-state fission: with one ebit, split and choose connections","One ebit splits a qubit, preserving selected graph links"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper assumes the described sequence of operations really produces the claimed split graph state, and assumes that after a valid fission the two-qubit central party ends up sharing exactly two ebits with the rest of the graph; the second assumption does not follow from 1-uniformity alone.","fun_headline_variants_meta":{"raw":{"variants":["Fission splits a graph-state qubit with just one ebit","Reverse of fusion: one ebit splits a qubit, choose neighbors","Split a qubit, pick which neighbors stay: fission uses one ebit","Graph-state fission: with one ebit, split and choose connections","One ebit splits a qubit, preserving selected graph links"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000648,"raw_usage":{"total_tokens":2902,"prompt_tokens":798,"completion_tokens":2104,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":414,"completion_tokens_details":{"reasoning_tokens":2011}},"tokens_in":414,"tokens_out":2104,"duration_ms":15298,"temperature":1.0,"reasoning_tokens":2011,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T05:37:35.466729+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a small concrete graph state, such as a three-qubit path, run the fission protocol with one Bell pair, and compute the final stabilizer generators; if the resulting state is not locally equivalent to the predicted graph state, the protocol's correctness fails. Separately, compute the entanglement entropy between the two central qubits and the rest after the operation: if it is not exactly two ebits for some valid fission, the optimality bound's premise is false.","supporting_citations":[{"cited_title":"Enrico Fermi,","cited_arxiv_id":null,"evidence_quote":"Defines graph states, their stabilizers, and 1-uniformity; used by both the protocol and the optimality proof."},{"cited_title":"$n$-qubit states with maximum entanglement across all bipartitions: A graph state approach","cited_arxiv_id":"2201.05622","evidence_quote":"Cited as the source of the 1-uniformity property used in Theorem 1's lower bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Represents the baseline method (Z-measurement edge deletion) that fission improves upon, and is later referenced for entanglement routing."}],"review_version":1}