{"id":"c19fdf9e-6a5e-4fe5-9554-d2ce0103729b","arxiv_id":"1908.00507","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Permitting loopless isolated vertices in dynamic graphs yields simpler quantum-walk implementations of the Pauli, Hadamard, T, and CNOT gates, with the T gate reduced to a single graph.","lead":"This paper shows that allowing isolated vertices without self-loops in dynamic graphs simplifies quantum gate implementations for continuous-time quantum walks. The T gate drops from a six-graph sequence to a single graph, and a three-qubit circuit is simulated as a quantum walk.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the loopless-isolated-vertex constructions are internally consistent and the Hamiltonian convention is explicit.","rationale":"Reading the paper in good faith, its aim is to show that allowing loopless isolated vertices materially simplifies dynamic-graph quantum-walk gates. For that claim to hold, three things must be true: a loopless isolated vertex must have a zero row and column in the chosen Hamiltonian; a looped isolated vertex must acquire the phase e^{-it}; and the proposed graph sequences must compose to the target unitaries. The first two follow directly from choosing the Hamiltonian to be the adjacency matrix, which the paper states explicitly and consistently. The third I checked algebraically for the Y, Z, H, alternate H, T, and CNOT sequences; the phases and times all work, including the three-graph H construction and its 13π/4 total time, and the alternate four-graph H with 9π/4 total time. The circuit simulation also sums correctly to the stated times and reproduces the analytical states in Eqs. (3)-(6). The reader's weakest assumption about the adjacency-matrix versus Laplacian convention is not a weakness of the argument because the paper clearly defines its model and even notes how to adapt to forward-time evolution. The genuine issues are the two prose inconsistencies the reader identified: the Z-gate paragraph swaps the roles of K1 and K1^loop, and the review of Herrman and Humble's Y gate contains sign errors. These should be corrected but do not undermine the paper's own constructions, which are verified by the simulation. I therefore see no reason to change the reader's CONDITIONAL verdict, and I do not find a separate load-bearing technical objection.","tokens_in":12249,"tokens_out":15319,"duration_ms":161033,"concrete_test":"Run the Fig. 5 dynamic graph with a full superposition initial state, for example equal amplitudes on all eight vertices with arbitrary phases, and compare the complete statevector, including phases, at t = 17π/2, 21π/2, 59π/4, and 67π/4 against the analytical expressions in Eqs. (3)-(6). If any amplitude phase mismatches, there is a hidden sign or time error; if all match, the central claim is confirmed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I find no load-bearing flaw in the central claim that permitting loopless isolated vertices (K1) alongside looped ones (K1^loop) yields simpler dynamic-graph implementations of Pauli gates, H, T, CNOT, and generalized phase gates. The calculations are explicit matrix exponentials, and the circuit simulation in Section IV matches the analytically derived layer states, including phases. The reader's flagged dependence on the Hamiltonian equaling the adjacency matrix is not a hidden assumption: Section I states it plainly ('we choose the jumping rate to be -1, so the Hamiltonian is equal to the adjacency matrix'), and all gate times, such as 7π/4 for T, are calibrated to that convention. The two prose inconsistencies identified by the reader—the Z-gate paragraph reversing K1 and K1^loop, and the Y-gate review signs for Herrman and Humble's construction—are real but localized to expository text and do not enter the paper's own gate constructions, which are independently supported by the Fig. 5 simulation. The existing CONDITIONAL verdict is appropriate as a consistency/style condition, not a correctness condition.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper considers continuous-time quantum walks on dynamic graphs, taking the Hamiltonian to be the graph adjacency matrix with jumping rate -1. It generalizes earlier work by Herrman and Humble by permitting isolated vertices to be either loopless (K1), whose amplitudes remain constant, or looped (K1^loop), which acquire a phase e^{-it}. Using this distinction, the author constructs simplified dynamic graphs for the Pauli X, Y, Z gates, the Hadamard, T, CNOT gates, and a generalized phase gate. The main claimed improvements are the elimination of ancillas for Y, Z, H, and T, and the reduction of the T gate from six static graphs on eight vertices to a single graph on two vertices. The paper validates the constructions by numerically simulating a three-qubit circuit with alternating one- and two-qubit gate layers; the simulated probabilities match the analytical state evolution at each layer.","tokens_in":12332,"tokens_out":19372,"duration_ms":164025,"significance":"The central results are internally consistent and derived by explicit matrix exponentiation with exact evolution times. The constructions are parameter-free, and the Hamiltonian convention is stated in the introduction, so the gate times are reproducible. The numerical simulation in Section IV verifies the phases as well as the probabilities, giving confidence that the dynamic graphs implement the intended unitaries. The simplification of the T gate and the removal of ancillas for several gates is a concrete improvement over Herrman and Humble's constructions and should be useful for translating quantum circuits into continuous-time quantum walks. The contribution is incremental rather than groundbreaking, but it is technically sound and directly relevant to the quantum walk literature.","major_comments":[],"minor_comments":[{"comment":"The sentence '|0⟩ can be made stationary under K ⟲ 1 while |1⟩ evolves by a phase under K1' is reversed: according to Table I, K1^loop produces a phase e^{-it} and K1 leaves the amplitude unchanged. The construction shown in the last row of Table II is correct, but the prose should be fixed to avoid instructing readers to implement the wrong graph.","section":"II. Pauli Gates, Z gate paragraph"},{"comment":"In the review of Herrman and Humble's Y gate, the stated net evolution of the ancilla vertices is −ic2|010⟩−ic3|011⟩−ic4|100⟩+ic5|101⟩+..., but tracing the described first graph (P2 π/2) and second graph (phase −1) for these vertices gives +ic2|010⟩+ic3|011⟩+ic4|100⟩−ic5|101⟩−.... The signs on the ancilla amplitudes are therefore inconsistent with the described evolution; since the ancillas begin with zero amplitude, the conclusion that |000⟩ and |001⟩ undergo a Y gate is unaffected, but the review should be corrected.","section":"II. Pauli Gates, Y gate review"},{"comment":"The CNOT row of Table III lists graph times 3π/2, π/2, π/2, 3π/2 and reports a total time of 2π for each implementation; the sum of these times is 4π. If the two implementations each consist of two graphs (3π/2 and π/2), the linearized table should be relabeled to distinguish the two columns; otherwise the total time should be corrected.","section":"Table III, CNOT row"},{"comment":"The phrase 'the quantum approximate approximation algorithm (QAOA)' should be 'the Quantum Approximate Optimization Algorithm (QAOA)'.","section":"I. Introduction"}],"recommendation":"minor_revision","confidential_remarks":"The new constructions are sound and the numerical validation is convincing. The manuscript needs a careful proofreading pass to correct the reversed Z-gate explanation, the sign errors in the review of Herrman and Humble's Y gate, and the CNOT table layout. These are local issues that do not affect the correctness of the paper's own results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague—\n\nA short, clean paper. It does what it claims: permitting loopless isolated vertices (K1) alongside looped ones (K1^loop) in dynamic graphs gives simpler gate constructions, and the derivations check out. The T gate becomes a single graph of two vertices instead of six graphs of eight; the Y/Z/H gates drop their ancillas; and there's a generalized phase gate that covers Z, S, and T. The three-qubit circuit simulation in Section IV matches the analytical layer states, so the central claim is supported.\n\nThe key observation is immediate from the adjacency matrix, so novelty is modest. But the paper is honest about that, and the simplified constructions are real. The arbitrary phase gate is a genuine convenience, and the multi-qubit extension is natural.\n\nTwo soft spots, both in prose. The Z-gate paragraph reverses K1 and K1^loop: it says |0> can be made stationary under K1^loop while |1> evolves under K1, which is exactly backwards. And the review of Herrman and Humble's Y gate has sign errors for |011> and |110> that don't follow from the described ancilla placement. Neither issue affects Wong's own constructions, which are derived by direct matrix exponentiation and verified by the simulation. They are revision-level fixes, not correctness problems.\n\nThe Hamiltonian convention (adjacency matrix with jumping rate -1) is stated explicitly up front, so the reader's concern about that is unfounded. No free parameters are fitted; evolution times are exact. No code is shipped, but the simulation is reproducible from the graph description.\n\nThis is a subfield paper, for people who build gate sets out of continuous-time quantum walks or study dynamic-graph simulation. It deserves a serious referee and would be accepted after minor revisions. I wouldn't cite it in my own work, but I'd point anyone doing circuit-to-walk compilation to it. The stress test's no-objection verdict holds up.","headline":"A modest but correct simplification of dynamic-graph quantum-walk gate constructions; fix two prose slips and accept.","tokens_in":12939,"tokens_out":5320,"would_cite":false,"duration_ms":49761,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-08-14T15:51:28.416829+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}