{"id":"848dce00-f93e-4f30-9e12-c6684a81cb3e","arxiv_id":"2412.11659","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A new symmetry-based formalism, quantum observables over time, derives observable-specific recovery maps that can reach optimal sampling overhead in quantum error mitigation.","lead":"This paper introduces quantum observables over time, a joint way to describe one measurement before and after quantum noise, and uses them to build recovery maps that restore the average value of a single chosen observable. For two common noise models the derived maps need fewer samples than standard probabilistic error cancellation.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The lambda-regularization limit for traceless observables is not proven scheme-independent; for the GAD-X example the regularized QOOT even violates the well-definedness condition (16), so the systematic construction may not define a unique recovery map.","rationale":"I agree with the reader that the lambda-regularization limit is the weakest load-bearing point. It is load-bearing because the two flagship examples both require it, and because the paper's novelty is the systematic derivation of recovery maps. The paper does verify the recovery property for the specific maps it displays (e.g., Eq. (57)), so I do not think the examples are arithmetically wrong; but those verifications are of the chosen map, not of the construction's uniqueness. The factor-of-2 inconsistency in Appendix F is a genuine error in a supporting derivation, and the optimality claims depend on Ref. [23]; however, those are secondary. A concrete alternative-regularization computation would settle whether the concern lands. The paper's explicit solutions and cost calculations are otherwise reproducible, but the missing proof of scheme-independence leaves a real gap in the central claim.","tokens_in":17577,"tokens_out":21146,"duration_ms":182252,"concrete_test":"Recompute the GAD-X pre-processing recovery map using the alternative regularization O_λ = X + λZ (λ>0), applying the same formula (26)/(48) and taking λ→0; then compute the Choi decomposition and sampling cost γ. Compare the limiting actions on X, Y, Z and the cost γ with Eqs. (53)-(56) and (62). If the limiting map or γ differs, the regularization limit is scheme-dependent and the systematic construction is ambiguous; if they agree, the λI result is robust for this example.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim that Eqs. (7) and (11) systematically define recovery maps is used to build the two headline examples. Both examples take the reference observable to be a traceless Pauli operator, so the eigen-decomposition of E†(O) has q_k+q_l=0 and the core formula (26) is singular. The paper regularizes O to O+λI and takes λ→0 (Eqs. (49)-(52), (66)-(67)). This is not a harmless technical step. For the GAD-X case the noise is non-unital, E(I)=I+αZ with α=ϵ(2p-1), so the Jordan QOOT well-definedness condition (16) fails for O_λ=X+λI: {O_λ,E(I)}/2 = O_λ+λαZ ≠ O_λ. The finite-λ equation therefore lies outside the regime where the QOOT marginal property (2) holds, and the limit is taken across a genuine eigenspace degeneracy (E†(X) has eigenvalues ±√(1-ε)). The paper gives no argument that the limit is independent of the regularization direction; a different Hermitian shift such as X+λZ, whose image under E† has nonzero trace when α≠0, could in principle yield a different limiting recovery map, with a different sampling cost. Since the claimed optimality of the examples is tied to the particular map obtained from the λI regularization, scheme dependence would undercut both the 'systematic construction' and the 'optimal' claims, not just the examples' arithmetic. The same singularity appears in the stochastic-Pauli-Z example, although there the noise is unital and the QOOT condition survives; uniqueness is still unproven.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"Bressanini et al. introduce the quantum observable over time (QOOT), a bipartite operator on HA⊗HB whose partial traces recover a reference observable O and its Heisenberg-evolved image E†(O). They characterize when such a QOOT exists (Tr[O]=Tr[E†(O)]) and, for their Jordan-product instance, when the additional condition {O,E(I)}=2O holds. They then define pre- and post-processing recovery maps P and R through time-reversal equations involving QOOTs, obtaining P†(E†(O))=O or E†(R†(O))=O. The maps are solved explicitly for qubits, and for generalized amplitude damping with reference X (pre-processing) and stochastic Pauli noise with reference Z (post-processing), the paper provides Choi decompositions into Pauli channels, sampling costs γ, and compares these with lower bounds from Ref. [23], finding that the costs match the optimal values and are lower than the PEC cost of implementing the channel inverse.","tokens_in":18048,"tokens_out":12447,"duration_ms":105008,"significance":"The paper makes a useful conceptual contribution by extending the state-over-time formalism to observables and linking it to observable-specific error mitigation. It provides fully explicit recovery maps for two standard noise models, with costs that reproduce the lower bounds of Ref. [23] and improve on standard PEC; the examples are worked out in enough detail to be checked, and their internal algebra is consistent. The main weakness is that the examples with traceless Pauli observables require a λI regularization of a singular equation, and the paper does not prove that the λ→0 limit is scheme-independent; for the GAD-X case the regularized observable even violates the well-definedness condition of the very QOOT used in the time-reversal equation. If this gap is closed, the framework would indeed provide a systematic closed-form route to optimal observable-specific recovery maps.","major_comments":[{"comment":"The GAD-X pre-processing map is obtained by applying Eq. (48) to the regularized observable Oλ=λI+X and taking λ→0. This step is not justified within the QOOT framework. For 2p≠1 the noise is non-unital, E(I)=I+ε(2p−1)Z, so {Oλ,E(I)} = 2(λI+X)+2λε(2p−1)Z = 2Oλ+2λε(2p−1)Z, which violates Eq. (16), the condition for the Jordan QOOT to satisfy the marginal property (2). The time-reversal equation (19) that defines the recovery map is therefore applied to a pair (E,Oλ) for which the QOOT is not well defined. Moreover, even setting this aside, the formula (48) is singular at λ=0 because the eigenvalues of E†(X) sum to zero, and the paper gives no argument that the limiting map is independent of the regularization scheme (e.g., X+λZ would also lift the degeneracy when E†(Z) has a trace component). Since the claimed optimality is for the specific map obtained from the λI regularization, scheme dependence would invalidate the claim that the QOOT framework systematically produces the optimal recovery map. The authors should either prove uniqueness of the limit or provide a derivation that avoids applying the QOOT equation outside its domain.","section":"VI A, Eqs. (49)-(52) and (16)"},{"comment":"The stochastic Pauli-Z example uses the same λI regularization for the degenerate eigenvalues of Z. Although the noise is unital and the QOOT well-definedness condition (16) is satisfied, the core equation (34) is singular at λ=0, and the text states only that solving the linear system and taking λ→0 yields Eq. (70). No derivation or uniqueness proof is given for this limiting solution. The recovery property alone fixes only R†(Z); the action on X and Y is determined by the time-reversal equation, so one needs to know that the λ→0 limit is independent of the regularization to conclude that the QOOT construction uniquely defines the optimal map. Please provide a proof of limit uniqueness or an explicit argument that the limiting solution is the unique HPTP extension satisfying the time-reversal equation.","section":"VI B, Eqs. (34)-(38) and (66)-(67)"}],"minor_comments":[{"comment":"The trace constraint for the post-processing map is misstated: Appendix F's calculation gives (1/2)Σ_{kℓ} Tr[X_{kℓ}]|ω_k><ω_ℓ| = O, so the condition {O,R(I)}=2O is equivalent to Tr[X_{kℓ}]=2q_kδ_{kℓ}, not q_kδ_{kℓ} as stated in Sec. IV B and in the final sentence of Appendix F. The examples satisfy the factor-2 version, so this is a typo rather than a substantive error, but it should be corrected.","section":"IV B and Appendix F"},{"comment":"The symbol O is reused for both the reference observable and the operator that anticommutes with it in the condition E(I)=I+O; this is confusing and the second O should be a different symbol, e.g., Δ with {O,Δ}=0.","section":"IV, Eq. (17) and Eq. (23)"},{"comment":"Calling the trace-condition result a 'no-go theorem' is misleading: Eq. (5) provides a universal construction whenever Tr[O]=Tr[E†(O)], so the result is a characterization of when a QOOT exists, not a no-go statement in the usual sense.","section":"II"},{"comment":"The sentence 'The solution to these equations, upon taking λ→0, yields the following recovery map' would benefit from a brief derivation or a reference to an appendix; currently the reader must trust the algebra, especially because the solution is central to the optimality claim.","section":"VI B"},{"comment":"There is a typo in the sentence preceding Eq. (49): 'this condition condition is not satisfied' should read 'this condition is not satisfied'.","section":"IV A"}],"recommendation":"major_revision","confidential_remarks":"The paper's examples are valuable and the comparison with Ref. [23] is convincing. The regularization issue is the key obstacle to the central claim of a systematic construction; a proof of limit uniqueness or a reformulation that avoids the singular limit is needed. The factor-2 error in the trace constraint is a typo but appears in a formal statement and should be fixed. Overall, the manuscript is within the journal's scope and the result is worth publishing after the gap is addressed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know. The QOOT framework is a genuinely new dual of the QSOT formalism, and the two worked examples are correct: the recovery maps satisfy the stated property and the sampling costs match the lower bounds from Ref. [23]. The paper deserves a serious referee. But there is a real gap: the lambda-regularization limit for traceless observables is not justified, and the Appendix F trace constraint has a missing factor of 2.\n\nWhat's actually new: the QOOT operator, the no-go characterization (trace condition), and the time-reversal equations (7) and (11) that define recovery maps implicitly. As far as I can tell these don't appear in the QSOT literature or in Ref. [23]; the latter uses SDP. The Jordan product QOOT is a natural choice and yields closed-form maps. The examples are worked carefully: Choi decompositions, negative eigenvalues, quasi-probability decompositions, and costs. The GAD-X and stochastic-Pauli-Z maps are optimal, matching Ref. [23]. The paper is honest about the fact that recovery maps are non-CP and can still be simulated.\n\nSoft spots, in order of severity. First, Appendix F states Tr[X_kℓ] = q_k δ_kℓ, but the derivation gives 1/2 Tr[X_kℓ] = q_k δ_kℓ, so the correct constraint is Tr[X_kℓ] = 2 q_k δ_kℓ. This is a typo, and the actual maps in Section VI satisfy the correct condition, so the examples stand; it still needs fixing. Second and more important, the lambda→0 regularization. The GAD example takes the reference observable as X+λI and lets λ→0. For λ>0 with non-unital GAD, E(I)=I+αZ and {X+λI, E(I)} ≠ 2(X+λI), so the Jordan QOOT fails its defining marginal condition (16). The paper doesn't address this. The limit is taken across an eigenvalue degeneracy (q1+q2→0), and no argument shows the result is independent of the perturbation direction. A shift like X+λZ would be a different regularization; I haven't checked whether it gives the same limit, but the burden is on the authors. This undercuts the 'systematic construction' claim for traceless observables, though not the arithmetic of the examples. The paper's own conclusion concedes that the non-unital case is not fully resolved, which is candid, but the concession sits uneasily with the GAD example being presented as a systematic output.\n\nBottom line: the formalism is novel, the examples are correct, and the flaws are fixable. The referee should ask the authors to fix the trace factor and either prove the regularization limit is scheme-independent or soften the systematic-construction claim to 'a specific regularization scheme yields...'. This paper deserves peer review, and I'd be happy to discuss it at reading group.","headline":"A genuinely new observable-dual of QSOT with correct optimal examples, but the lambda-regularization for traceless observables is unproven and the Appendix F trace constraint has a missing factor of 2.","tokens_in":18488,"tokens_out":7761,"would_cite":true,"duration_ms":62418,"reading_group":"yes","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 a two-time quantum observable over time can define recovery maps that restore a chosen observable's noiseless expectation value, with optimal sampling overhead in the two worked examples.","keywords":["quantum observables over time","quantum state over time","recovery maps","time-reversal symmetry","quantum error mitigation","probabilistic error cancellation","Jordan product","generalized amplitude damping"],"falsifier":"Compute the recovery map for Pauli X under generalized amplitude damping using two different regularization paths: $O_\\lambda = X+\\lambda I$ and $O_\\lambda = X+\\lambda I+\\mu Z$, sending $\\mu\\to 0$ before or after $\\lambda\\to 0$. If the resulting maps, or their sampling costs $\\gamma$, disagree along different paths, the claimed systematic construction is not well defined for traceless reference observables.","tokens_in":17401,"feed_emoji":"⚛️","tokens_out":11826,"duration_ms":100940,"temperature":0.7,"pith_summary":"Quantum observables over time (QOOT) are operators that jointly describe an observable and its Heisenberg-evolved image across two times, the observable analogue of the quantum state over time. This paper claims that a QOOT exists exactly when the evolution preserves the trace of that observable, and that using the Jordan-product form of the QOOT turns a time-reversal symmetry equation into a linear system whose solution is a recovery map restoring the observable's noiseless expectation value for every state. Because such recovery maps are usually non-physical, the paper decomposes them into physically realizable channels, yielding unbiased estimators of the noiseless expectation value. In the two examples worked out in detail, generalized amplitude damping with reference Pauli X and stochastic Pauli noise with reference Pauli Z, the sampling overhead equals the previously established lower bound and beats probabilistic error cancellation based on the channel inverse.","feed_headline":"Observable-over-time recovery maps hit optimal sampling cost","feed_subtitle":"A symmetry equation for quantum observables produces unbiased error-mitigation maps at the theoretical overhead floor.","key_machinery":"The load-bearing object is the Jordan product quantum observable over time, $E^\\dagger \\star O = \\tfrac{1}{2}\\{O\\otimes I, D[E^\\dagger]\\}$, built from the anti-commutator of the reference observable with the Jamiołkowski state $D[E^\\dagger]=\\sum_{ij} |i\\rangle\\langle j| \\otimes E^\\dagger(|j\\rangle\\langle i|)$. This object converts the abstract time-reversal symmetry equation into solvable linear systems whose solutions are the pre- and post-processing recovery maps, and it supplies the well-definedness condition $\\{O, E(I)\\}=2O$, which at the general QOOT level is equivalent to the trace condition $\\mathrm{Tr}[E^\\dagger(O)]=\\mathrm{Tr}[O]$. The time-reversal map $\\tau$, defined as the conjugate-linear extension of $\\tau(B\\otimes A)=A^\\dagger\\otimes B^\\dagger$, puts the forward and backward joint observables on equal footing. For traceless reference observables the linear systems become singular, and the paper works around this by regularizing $O$ to $O+\\lambda I$ and taking $\\lambda\\to 0$ after solving.","core_discovery":"The paper's central discovery is a systematic route from a joint object, a quantum observable over time, to a recovery map that protects a chosen observable from a known noise channel. The Jordan-product QOOT, $E^\\dagger \\star O = \\tfrac{1}{2}\\{O\\otimes I, D[E^\\dagger]\\}$, is defined by anti-commuting the reference observable with the Jamiołkowski state of the adjoint channel; it automatically yields $E^\\dagger(O)$ as one of its marginals and reproduces $O$ as the other whenever the consistency condition $\\{O, E(I)\\}=2O$ holds. Imposing the time-reversal symmetry $E^\\dagger \\star O = \\tau(P^\\dagger \\star E^\\dagger(O))$ for pre-processing, or $R^\\dagger \\star O = \\tau(E^\\dagger \\star R^\\dagger(O))$ for post-processing, gives explicit linear equations for $P$ and $R$, and any solution automatically satisfies the recovery property $P^\\dagger(E^\\dagger(O))=O$ or $E^\\dagger(R^\\dagger(O))=O$. For the GAD channel with reference $X$ and the stochastic Pauli channel with reference $Z$, the resulting recovery maps are stochastic Pauli maps with negative coefficients, and their sampling costs $\\gamma=1/\\sqrt{1-\\epsilon}$ and $\\gamma=1/|p_0-p_1-p_2+p_3|$ coincide with the lower bounds reported in Ref. [23].","pith_inferences":["The $\\lambda\\to 0$ regularization for traceless observables deserves a direct test: if two different regularizations, say $O+\\lambda I$ and $O+\\lambda I+\\mu Z$, give different recovery maps in the limit, the systematic construction is not canonical for traceless references.","The same machinery should extend to multi-qubit Pauli observables under twirled Pauli noise, with the sampling cost controlled by the spectrum of $E^\\dagger(O)$; this is a natural next test of the optimality pattern.","Because the uncorrelated QOOT already satisfies the recovery property but does not select a unique map, the formalism suggests that choosing an error-mitigation strategy is equivalent to choosing a temporal joint observable, an interpretation the paper does not develop.","The observed optimality in two examples may hint at a general theorem relating QOOT-derived recovery maps to information-recoverability lower bounds; the paper explicitly leaves this as an open question."],"forward_implications":["Whenever the consistency condition is met, the recovery map is obtained by solving a linear system defined by the noise channel and the reference observable, with no optimization over candidate maps.","Because $P^\\dagger(E^\\dagger(O))=O$ or $E^\\dagger(R^\\dagger(O))=O$, the protocol returns the exact noiseless expectation value of the reference observable for every input state, not only for a reference state.","For generalized amplitude damping protecting $X$, the sampling overhead $\\gamma=1/\\sqrt{1-\\epsilon}$ is smaller than the inverse-channel PEC cost for all $p$ and $\\epsilon$.","For stochastic Pauli noise protecting $Z$, $\\gamma=1/|p_0-p_1-p_2+p_3|$, and both examples match the optimal lower bound of Ref. [23].","The construction is not universal: a QOOT exists only when $\\mathrm{Tr}[E^\\dagger(O)]=\\mathrm{Tr}[O]$, and when the noise is unitary the recovery map reduces to the channel inverse."],"supporting_citations":[{"why":"Supplies the time-reversal-symmetry formalism and the quantum Bayes-rule perspective that the QOOT recovery equations adapt from states to observables.","marker":"[5]"},{"why":"Defines probabilistic error cancellation and the unbiased sampling estimator whose overhead is the baseline the protocol is compared against.","marker":"[10]"},{"why":"Introduces the state-over-time joint description that the QOOT is constructed as the observable analogue of.","marker":"[11]"},{"why":"Shows how arbitrary linear maps decompose into physically realizable channels and provides the optimal inverse-channel implementation cost used for comparison.","marker":"[21]"},{"why":"Establishes the information-recoverability lower bounds on sampling overhead that the paper's recovery maps are shown to saturate.","marker":"[23]"},{"why":"Defines the Jamiołkowski state used to build the Jordan product QOOT.","marker":"[24]"}],"fun_headline_variants":["Observables-over-time recovery maps hit optimal sampling cost","Time-reversal symmetry unlocks optimal error-mitigation maps","New recovery maps reach sampling-overhead floor","Quantum joint observables yield unbiased recovery at minimal cost","Optimal sampling cost from time-symmetric recovery maps"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The results for traceless reference observables hinge on the limit of a regularization parameter, $O \\to O+\\lambda I$ followed by $\\lambda \\to 0$, being independent of the regularization scheme, and the paper does not prove that uniqueness.","fun_headline_variants_meta":{"raw":{"variants":["Observables-over-time recovery maps hit optimal sampling cost","Time-reversal symmetry unlocks optimal error-mitigation maps","New recovery maps reach sampling-overhead floor","Quantum joint observables yield unbiased recovery at minimal cost","Optimal sampling cost from time-symmetric recovery maps"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000935,"raw_usage":{"total_tokens":4025,"prompt_tokens":995,"completion_tokens":3030,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":611,"completion_tokens_details":{"reasoning_tokens":2955}},"tokens_in":611,"tokens_out":3030,"duration_ms":20749,"temperature":1.0,"reasoning_tokens":2955,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T14:45:48.127753+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the recovery map for Pauli X under generalized amplitude damping using two different regularization paths: $O_\\lambda = X+\\lambda I$ and $O_\\lambda = X+\\lambda I+\\mu Z$, sending $\\mu\\to 0$ before or after $\\lambda\\to 0$. If the resulting maps, or their sampling costs $\\gamma$, disagree along different paths, the claimed systematic construction is not well defined for traceless reference observables.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines probabilistic error cancellation and the unbiased sampling estimator whose overhead is the baseline the protocol is compared against."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes the information-recoverability lower bounds on sampling overhead that the paper's recovery maps are shown to saturate."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the Jamiołkowski state used to build the Jordan product QOOT."}],"review_version":1}