{"total":10,"items":[{"citing_arxiv_id":"2605.21457","ref_index":11,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"An Exponential Sample-Complexity Advantage for Coherent Quantum Inference","primary_cat":"quant-ph","submitted_at":"2026-05-20T17:47:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Coherent quantum inference achieves O(1/ε) sample complexity for d-dimensional quantum purity amplification, exponentially better than the Ω(d/ε) required by any incoherent measurement-mediated protocol.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21570","ref_index":35,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs","primary_cat":"quant-ph","submitted_at":"2026-05-20T17:47:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Solves quantum purity amplification for arbitrary n, m, eigenstates, and dimension d, with asymptotic input scaling O(m/(ε D_min²)) independent of d and non-asymptotic bounds from generalized Young diagrams.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.19654","ref_index":134,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Hardness and Approximation for Coloring Digraphs","primary_cat":"cs.DS","submitted_at":"2026-05-19T10:44:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.07518","ref_index":292,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Loop Composition in Quantum Algorithms","primary_cat":"quant-ph","submitted_at":"2026-05-08T09:50:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.13953","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Parallel Algorithms for Group Isomorphism via Code Equivalence","primary_cat":"cs.CC","submitted_at":"2026-04-15T15:04:26+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"AC³ isomorphism tests for coprime Abelian extensions and central-radical groups with elementary Abelian radical, plus an AC circuit bound for arbitrary central-radical groups.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"2 writeG i =H i ⋉φi Ni, whereN i is the direct product of the Abelian normal Sylow subgroups ofG i. Now inL, we may compute the Abelian normal Sylow subgroups ofN i, and test whether each is elementary Abelian [BKLM01]. Similarly, inL, we test whetherH i is elementary Abelian. Finally, inL, we may test whetherN 1 ∼= N2 andH 1 ∼= H2 [BKLM01]. Otherwise, we reject. Fori∈[2], letA i,p ≤N i be the Sylowp-subgroup ofN i (and hence,G i). Letφ i,p :H i →GL(A i,p) be the projection ofφ i ontoA i,p. LetG i,p =H i ⋉φ i,pAi,p. Qiao, Sarma, and Tang [QST11, Section 5.3] established thatG 1 ∼= G2 if and only if, for all primespdividing|N 1|=|N 2|,G 1,p andG 2,p are isomorphic. We have shown that, inFL, we can construct eachG 1,p, G2,p."},{"citing_arxiv_id":"2604.12584","ref_index":4,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Robust Graph Isomorphism, Quadratic Assignment and VC Dimension","primary_cat":"cs.DS","submitted_at":"2026-04-14T11:06:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Additive εn²-approximation for graph edit distance on VC-dimension-d graphs in n^{O(d/ε²)} time, with extensions to quadratic assignment problems and a Weisfeiler-Leman dimension bound for robust graph isomorphism.","context_count":1,"top_context_role":"baseline","top_context_polarity":"baseline","context_text":"the problem has been studied by O'Donnell, Wright, Wu, and Zhou [31], and they obtained various hardness results. It is an open problem whetherε-GI can be solved in polynomial time for every fixedε>0; we remark that O'Donnell et al.'s lower bounds [31] do not yield direct insights for the dense regime. It follows from [1] thatε-GI can be solved in timenO(ε−2logn), slightly improving over Babai's quasi-polynomial isomorphism test [4] (which solves the problem without making use of the promise). More generally, Theorem 1.1 implies thatε-GI can be solved in timenO(ε−2d) on graphs of VC dimension at mostd. Observe that this regime is interesting since the restriction of (exact) graph isomorphism is known to be hard (as hard as the general graph isomorphism problem) for graph classes of bounded expansion and bounded twin width, both of which implies"},{"citing_arxiv_id":"2604.04462","ref_index":89,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Demon that remembers: An agential approach towards quantum thermodynamics of temporal correlations","primary_cat":"quant-ph","submitted_at":"2026-04-06T06:20:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A classical agent extracts more work from quantum temporal correlations via adaptive strategies bounded by the new Time-Ordered Free Energy, while reinforcement learning achieves polylogarithmic dissipation when learning unknown states.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2505.07922","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Homomorphism Indistinguishability Relations induced by Quantum Groups","primary_cat":"quant-ph","submitted_at":"2025-05-12T16:58:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Generalizes homomorphism indistinguishability equivalences induced by orthogonal easy quantum groups, including a classification of (0,0)-intertwiners for graph-theoretic versions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2402.18500","ref_index":64,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Conditional Independence of 1D Gibbs States with Applications to Efficient Learning","primary_cat":"quant-ph","submitted_at":"2024-02-28T17:28:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"1D translation-invariant Gibbs states at positive temperature exhibit superexponential decay of Belavkin-Staszewski conditional mutual information, enabling efficient learning from local measurements and tensor network approximations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"1907.02539","ref_index":26,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs","primary_cat":"cs.CC","submitted_at":"2019-07-04T18:00:04+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Sparse Erdős-Rényi graphs of average degree d have vector chromatic number (1/2)√d + o_d(1).","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}