{"id":"11489902-546b-4764-b41f-258e4a79a16b","arxiv_id":"2411.12049","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"The authors implement the exact HEOM propagator as a linear combination of two unitary gates and run it on IBM quantum hardware for 2-3 qubit models of charge and energy transfer.","lead":"This paper shows how to simulate non-Markovian molecular dynamics on noisy quantum computers by converting a precomputed classical propagator into a short quantum circuit. The demonstration is limited to tiny 2-3 qubit subspaces, offers no quantum advantage, and honestly documents where device noise breaks the results.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Walsh compilation cost for the diagonal unitary is not analyzed; the 'short circuit' claim may fail exponentially as the projected subspace grows.","rationale":"The reader's weakest assumption concerns the classical precomputation of G(t), which the authors explicitly acknowledge and which affects significance rather than correctness. I find that concern valid but already disclosed. A more concrete and less acknowledged gap is the Walsh compilation cost: the paper cites an efficient diagonal-unitary construction but gives no complexity analysis for subspaces beyond the 2-3 qubit examples. Since the strongest claim rests on the method being a 'generic recipe' for 'short' NISQ circuits, the exponential scaling of the Walsh representation is load-bearing. This does not change the overall CONDITIONAL verdict, but it sharpens the condition: the authors should provide a scaling analysis or explicitly limit the claim to small projected subspaces. I therefore keep the reader's verdict unchanged while noting a partially different concern.","tokens_in":30418,"tokens_out":15971,"duration_ms":171516,"concrete_test":"Compute G(t) for the FMO model at t = 612 fs for projection subspaces of sizes N_S = 4, 8, 16, 32 (e.g., S = {11,22}, {11,22,33,66}, plus selected coherences), and count the number of nonzero Walsh coefficients a_j from eq 12 and the ECR gate count after Qiskit compilation. If the two-qubit gate count does not stay below roughly 50 for N_S = 16 or grows as ~2^(N_S/2), the 'short circuit' claim fails for larger subspaces.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The SVD construction (eq 5) and the circuit in Fig. 1 are mathematically sound, and the projection (eq 33) is exact for initial states in S. The load-bearing weakness is the efficiency claim. The diagonal unitary U_Sigma is implemented by expanding its phase vector in the full Walsh basis (eqs 9-13); the number of Walsh operators is N = 2^(n+1) for a subspace of size N_S = 2^n states. Even with Gray-code optimization, a generic n-qubit diagonal unitary requires O(2^n) CNOT gates (Ref. 79). The phase vector f_k = +/- arccos(sigma_k/sigma_0) inherits the singular values of a projected HEOM propagator, and no argument is given that its Walsh spectrum is sparse. The paper reports depths 15-67 for n = 2, 3, but provides no scaling data for larger S. Thus the claimed 'short quantum circuit' and 'generic recipe' for arbitrary master equations on NISQ are only demonstrated for tiny population subspaces; for any larger subspace of interest (e.g., the full 7x7 density matrix of FMO, requiring ~7 qubits), the compiled circuit may already exceed NISQ depth. This is an unsubstantiated scalability claim, not an internal inconsistency.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper presents qHEOM, a quantum algorithm for simulating non-Markovian open quantum system dynamics on NISQ devices. The non-unitary propagator G(t) of the hierarchical equations of motion (HEOM) is precomputed classically (eq 33), decomposed via SVD into a sum of two unitaries (eq 5), and implemented with a one-qubit dilation circuit (Fig. 1). The diagonal unitary in the dilation is compiled using a Walsh-operator representation (Section 2.4). The method is demonstrated for a molecular triad charge-transfer model and the FMO complex, using both a noisy simulator (QasmSimulator) and the IBM Sherbrooke device, with dynamic decoupling and twirling error mitigation. The paper also compares HEOM with a Lindblad-type TCL-Redfield equation for the same models, showing that the Lindblad equation fails in these strongly coupled regimes.","tokens_in":30657,"tokens_out":4502,"duration_ms":43391,"significance":"The SVD dilation and subspace projection are mathematically sound and the derivation is clear. The paper is refreshingly honest in stating that the propagator is precomputed classically and that no quantum advantage is claimed; the code is publicly available. If the efficiency of the Walsh compilation held for larger subspaces, the method would be a valuable generic recipe for turning any classically-computable open-system propagator into a short quantum circuit. However, the demonstrations are limited to two- and three-qubit circuits, the agreement with HEOM is forced by construction, and the hardware results lack error bars. The scalability of the Walsh approach for the phase vectors arising from HEOM propagators is not analyzed, so the central claim of a 'generic recipe' for arbitrary master equations on NISQ remains unsubstantiated.","major_comments":[{"comment":"The agreement between qHEOM and HEOM in Figures 7–11 is guaranteed by construction, because the circuit is built from the classically computed HEOM propagator G(t) = M P e^{-iHt} P M†. The statement that 'the excellent agreement ... validates the accuracy of our quantum algorithm' is therefore an overstatement; the figures demonstrate that the circuit implements the desired unitary operations under noise, not that the underlying HEOM dynamics are correct. The paper should either remove or qualify this claim and present the demonstration as an implementation check. This is important because the paper's stated purpose is to show how HEOM can be implemented on quantum circuits, and the validation should be framed accordingly.","section":"Section 5.3, eq 33"},{"comment":"The claim that the Walsh operator representation provides an 'efficient' implementation of the diagonal unitary UΣ is not supported for large subspaces. For a generic n-qubit diagonal unitary, the Walsh decomposition requires N = 2^n terms and O(2^n) CNOT gates (Ref. 79). The paper reports circuit depths for n=2 and n=3 only (Tables 3 and 4) and provides no argument that the phase vector f_k of a projected HEOM propagator has a sparse Walsh spectrum. Without such an argument or scaling data, the claim that the method is a 'generic recipe' for arbitrary quantum master equations on NISQ devices is unsubstantiated.","section":"Section 2.4"},{"comment":"The hardware results are presented without error bars, confidence intervals, or a quantitative error metric. With 20,000 shots per time point, the statistical sampling error should be reported to support claims such as 'almost perfectly aligned with numerically exact benchmark results'. Without this information, the reader cannot judge the significance of the observed deviations (or lack thereof).","section":"Section 5.3, Figures 8–11"},{"comment":"The comparison of circuit complexity with the Sz.-Nagy method (Ref. 63) is based on a single time point and a single model system. The claim that SVD+Walsh reduces circuit complexity by 'more than a factor of 2' is not justified as a general statement; additional time points or model systems are needed to establish the generality of this comparison.","section":"Section 5.3, Table 3"}],"minor_comments":[{"comment":"The extraction formula Pi = σ0 sqrt(Ni/Nc) should be clarified; it implies a specific normalization of the state |Φ(0)>, and the relation between the measured probability and the population should be stated explicitly.","section":"Eq 49"},{"comment":"The axis label 'Poulation' should be 'Population'.","section":"Figure 9"},{"comment":"The notation P|Ψ(0)⟩ = |Ψ(0)⟩ is used as a constraint; it would be helpful to state explicitly that this restricts the initial states to those supported on the subspace S, and that this is a limitation of the method for initial states outside S.","section":"Section 3.3"},{"comment":"The definition of the Walsh coefficients in eq 12 uses the Hilbert-Schmidt inner product; for readers not familiar with Walsh analysis, the relation to the standard Walsh-Hadamard transform could be stated more explicitly.","section":"Section 2.4"},{"comment":"The FMO parameters (η = 70 cm^-1, ω_c^-1 = 50 fs) are given in the text but not in a table; a table would improve readability.","section":"Section 5.2"}],"recommendation":"major_revision","confidential_remarks":"The paper's main selling point is the SVD dilation combined with Walsh compilation for any classically-computable propagator. However, the validation is largely by construction, and the scalability analysis is missing. The authors are transparent about the lack of quantum advantage, but the claims in the abstract and introduction ('enables the implementation of arbitrary quantum master equations on NISQ computers') go beyond what is demonstrated. The paper is likely to be of interest to the quantum-chemistry and quantum-dynamics community, but the presentation needs to be more careful about what is established."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a clean, honest implementation paper. It takes the known SVD-dilation trick, adds Walsh compilation for the diagonal unitary, and tests it on real IBM hardware for HEOM-based open-system dynamics. The demonstrations are tiny (2-3 qubits) and the quantum part adds no computational advantage — the propagator is precomputed classically. But the authors say that plainly, and the hardware results are a legitimate end-to-end check of the circuit construction.\n\nWhat is genuinely new is the specific combination: HEOM propagator projected onto a small subspace, SVD-dilated, and compiled with Walsh operators, with a clear comparison against Sz.-Nagy dilation (depth 148 to 60, 28 to 11 CNOTs for their 3-qubit example). That is a real engineering contribution. The projection argument (eqs 28-33) is correct, and the condition P|Psi(0)> = |Psi(0)> is stated, which is exactly what makes the subspace reduction exact. They also ship code and give circuit details, which helps reproducibility.\n\nSoft spots, in rough order of importance. First, the scalability claim. The paper calls the method a generic recipe for arbitrary master equations on NISQ, but the Walsh compilation of a generic n-qubit diagonal unitary needs O(2^n) CNOTs (their Ref. 79), and they give no argument that the HEOM singular-value phase vector has a sparse Walsh spectrum. The reported depths are for n=2,3. For a 7-site FMO density matrix (~7 qubits) the compiled circuit may already be too deep for current hardware. This is an unsubstantiated extrapolation, not an internal error, and the authors do hedge by saying future lower-error hardware would be needed. Second, the central validation in Fig. 7 is partly by construction — the circuit is built from the classical propagator, so agreement with HEOM is expected. The meaningful validation is the noisy-hardware data (Figs. 8-11), which does show the method working at small scale. Third, the hardware results have no error bars or repeated calibration data; 20k shots per point with error mitigation is reported, but we do not see shot-to-shot scatter. That is a minor omission, fixable in revision.\n\nThe comparison to Lindblad/TCL-Redfield is a useful cautionary tale, and the fit-window for rates is stated. The citation pattern is fine; same-group refs (Wang, Lyu) are used appropriately for the prior propagator-dilation work.\n\nBottom line: this is a solid incremental paper for the quantum-simulation-of-open-systems community. It deserves peer review. I would send it out, with a request for scaling analysis or at least an explicit statement that no scaling claim is made.","headline":"A clean, honest NISQ implementation paper: known ingredients combined for HEOM, with real-hardware demos on 2-3 qubits, but no quantum advantage and an unproven scalability claim.","tokens_in":31184,"tokens_out":2792,"would_cite":true,"duration_ms":29066,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that any non-unitary open-system propagator, in particular the numerically exact HEOM propagator, can be rewritten as a short two-unitary quantum circuit that reproduces exact population dynamics on noisy near-term…","keywords":["open quantum systems","non-Markovian dynamics","hierarchical equations of motion","NISQ quantum computing","SVD dilation","Walsh operators","quantum master equations","FMO complex"],"falsifier":"Take a model where the HEOM propagator has a singular value exactly or nearly equal to zero, so the construction in eq 4 becomes ill-conditioned, and check whether the circuit output still equals $G(t)|\\Phi(0)\\rangle/\\sigma_0$; a more direct falsifier is to run the 2-qubit circuits at parameter regimes where the exact population approaches zero and show that the measured deviation grows with the largest singular value $\\sigma_0$ faster than the sampling-error estimate in eq 50 predicts.","tokens_in":30209,"feed_emoji":"⚛️","tokens_out":5107,"duration_ms":55603,"temperature":0.7,"pith_summary":"Open quantum systems coupled to structured environments evolve non-unitarily, which quantum circuits cannot natively implement. This paper claims that such a propagator can be decomposed, via singular value decomposition, into a linear combination of two unitaries and compiled into a compact quantum circuit using Walsh operators. The authors then project the HEOM propagator onto the subspace of physical observables, obtaining 2-qubit circuits whose measured populations closely match converged HEOM results for charge transfer in a molecular triad and energy transfer in the Fenna-Matthews-Olson complex, both on a noiseless simulator and on real superconducting hardware. The same comparison shows that the Lindblad master equation fails badly in these strongly coupled, non-Markovian regimes. The paper states explicitly that its purpose is to show how numerically exact HEOM can be embedded in unitary circuits, not to demonstrate quantum advantage.","feed_headline":"SVD trick maps non-Markovian dynamics onto near-term quantum circuits","feed_subtitle":"Two-unitary decomposition plus Walsh compilation reproduces exact HEOM populations with 2-qubit circuits.","key_machinery":"The central object is the singular-value decomposition of the non-unitary propagator, written as a linear combination of two unitaries via the diagonal singular-value matrix $\\Sigma = (\\sigma_0/2)(\\Sigma_+ + \\Sigma_-)$, where $(\\Sigma_\\pm)_{jj} = \\tilde\\sigma_j \\pm i\\sqrt{1-\\tilde\\sigma_j^2}$. The circuit then implements $U_\\Sigma = \\Sigma_+ \\oplus \\Sigma_-$ as a diagonal unitary using Walsh operators, with Walsh coefficients obtained by a Walsh-Fourier transform, and a single Hadamard-controlled structure yields $G(t)|\\Phi(0)\\rangle/\\sigma_0$ when the ancilla reads 0. The projection operator onto the physical subspace is what reduces the circuit from the full HEOM space to two or three qubits, and this reduction is what makes the hardware results accurate.","core_discovery":"The central claim is that a non-unitary propagator $G(t)$, here the HEOM propagator in a projected subspace, can be lifted into a unitary circuit through the identity $G(t) = (\\sigma_0/2)(U\\Sigma_+ V^\\dagger + U\\Sigma_- V^\\dagger)$, where $\\Sigma_\\pm$ are diagonal unitaries built from the singular values of $G(t)$. The circuit uses one ancilla qubit, and the diagonal unitary $U_\\Sigma = \\Sigma_+ \\oplus \\Sigma_-$ is implemented with the Walsh-operator representation, which turns the dominant compilation cost into commuting rotations of tensor products of identity and Pauli-$Z$ operators. Because the projection operator can be chosen freely, the propagator can be restricted to the subspace of the physical quantities of interest, yielding two-qubit circuits for population dynamics. The paper reports that these circuits reproduce numerically exact HEOM population dynamics for the two model systems on both a noiseless circuit simulator and on a real NISQ device, with the largest remaining deviations occurring when the exact population approaches zero.","pith_inferences":["Because the propagator $G(t)$ is precomputed classically by solving HEOM before the circuit runs, the reported device agreement verifies the circuit implementation rather than demonstrating any quantum speedup; a genuine advantage would require the quantum device to construct or apply the propagator more efficiently than a classical solution.","The method's practical reach on noisy hardware is tied to finding small projection subspaces, so extending it to large multi-site systems will require either much lower error rates or a systematic way to compress the relevant subspace.","The paper's construction implies a general compiler: any classically available propagator, from path integrals, tensor-train methods, or generalized quantum master equations, could be substituted for the HEOM propagator without changing the circuit-building procedure.","A testable extension would be to apply the same circuits to a low-temperature or structured-reservoir model where HEOM requires many effective modes, and compare hardware fidelity against the classical HEOM cost; this would delimit the noise-limited regime of the method."],"forward_implications":["The same SVD-plus-Walsh recipe can convert propagators from any quantum master equation into quantum circuits, not only the HEOM propagator.","Choosing a smaller projection subspace cuts circuit depth and two-qubit gate count enough that NISQ results become nearly exact, as demonstrated by the reduction from 3-qubit to 2-qubit circuits.","The approach allows independent projection subspaces to be run in parallel, so different physical quantities can be simulated on separate circuits without approximation.","In the strongly coupled regimes studied, the Lindblad equation is quantitatively unreliable, while qHEOM reproduces the numerically exact dynamics, providing a benchmark for where Markovian master equations break down.","Circuit depth and two-qubit gate counts are reduced by more than a factor of two relative to Sz.-Nagy dilation for the same propagator."],"supporting_citations":[{"why":"Defines the HEOM method and establishes it as the numerically exact reference that the quantum algorithm must reproduce.","marker":"[21]"},{"why":"Provides the analytic Debye-spectral-density decomposition of the reservoir correlation function and the efficient filtering parameters used in the HEOM simulations.","marker":"[22]"},{"why":"Supplies the SVD-based decomposition of a non-unitary operator into a linear combination of two unitaries, the core identity of the circuit construction.","marker":"[62]"},{"why":"Gives the Walsh-operator representation and CNOT-based compilation of diagonal unitaries that makes the dilation circuit shallow.","marker":"[79]"},{"why":"Shows the prior combination of SVD dilation with Walsh operators for Kraus operators, which the paper adapts to the HEOM propagator and compares against.","marker":"[35]"},{"why":"Provides the Lindblad-equation unitary-decomposition algorithm that the paper contrasts with qHEOM and uses as the reference for LCU shot counts.","marker":"[59]"},{"why":"Presents the earlier GQME approach on NISQ devices with Sz.-Nagy dilation, serving as the baseline for circuit complexity and for the claim that SVD plus Walsh reduces depth.","marker":"[63]"},{"why":"Supplies the spin-boson model parameters for the carotenoid-porphyrin-C60 triad and the Marcus rate constants used to validate the HEOM results.","marker":"[76]"},{"why":"Provides the seven-site FMO Hamiltonian parameters and the excitation pathway used for the energy transfer simulations.","marker":"[126]"}],"fun_headline_variants":["Non-Markovian quantum dynamics, now NISQ-friendly","HEOM on a quantum chip: SVD lifts open-system propagator","Exact open-system dynamics via 2-qubit unitary circuits","Walsh compilation makes non-Markovian dynamics quantum-circuit ready","Non-Lindbladian dynamics on NISQ: SVD-based circuit mapping"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything hinges on the premise that the propagator $G(t)$ is already known classically: the quantum circuit only applies a precomputed matrix to a known vector, so the reported agreement is an implementation check, not an independent computation.","fun_headline_variants_meta":{"raw":{"variants":["Non-Markovian quantum dynamics, now NISQ-friendly","HEOM on a quantum chip: SVD lifts open-system propagator","Exact open-system dynamics via 2-qubit unitary circuits","Walsh compilation makes non-Markovian dynamics quantum-circuit ready","Non-Lindbladian dynamics on NISQ: SVD-based circuit mapping"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000433,"raw_usage":{"total_tokens":2219,"prompt_tokens":971,"completion_tokens":1248,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":587,"completion_tokens_details":{"reasoning_tokens":1153}},"tokens_in":587,"tokens_out":1248,"duration_ms":10853,"temperature":1.0,"reasoning_tokens":1153,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T17:57:42.965341+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a model where the HEOM propagator has a singular value exactly or nearly equal to zero, so the construction in eq 4 becomes ill-conditioned, and check whether the circuit output still equals $G(t)|\\Phi(0)\\rangle/\\sigma_0$; a more direct falsifier is to run the 2-qubit circuits at parameter regimes where the exact population approaches zero and show that the measured deviation grows with the largest singular value $\\sigma_0$ faster than the sampling-error estimate in eq 50 predicts.","supporting_citations":[],"review_version":1}