{"total":11,"items":[{"citing_arxiv_id":"2606.26034","ref_index":15,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Estimating Fidelity to a Reference Quantum State","primary_cat":"quant-ph","submitted_at":"2026-06-24T17:09:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Sample complexity for fidelity estimation to a rank-r reference state is O(r²/ε²) with lower bound Ω(r/ε²); O(r²/ε⁴) when unknown state also has rank ≤r.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.07425","ref_index":154,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Tomography of quantum states with bounded extent","primary_cat":"quant-ph","submitted_at":"2026-06-05T16:19:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21457","ref_index":8,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"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.08082","ref_index":48,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Advances in quantum learning theory with bosonic systems","primary_cat":"quant-ph","submitted_at":"2026-05-08T17:59:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A concise review of sample complexities and methods for tomography and learning in continuous-variable quantum systems, with emphasis on Gaussian versus non-Gaussian states.","context_count":1,"top_context_role":"background","top_context_polarity":"use_method","context_text":"resolved for squeezing-free Gaussian states, i.e.,passive Gaussian states[22]. In that setting, Gaussian operations still requireΘ(n3/ε2)copies [22], whereas anon-Gaussianprotocol achieves ˜Θ(n2/ε2)copies [22], giving a provable polynomial advantage of non-Gaussian algorithms over Gaussianones. Thekeyingredientbehindthisnon-Gaussianalgorithmistherandom purification channel[48, 9, 49], a recently introduced tool originally developed in the finite-dimensional setting. Informally, it is a channel that takesNi.i.d. copies of a mixed state and outputs a uniform convex combination ofNi.i.d. copies of one of its purifications. This idea was later adapted to the passive Gaussian setting [46, 47], yielding a channel that transformsN"},{"citing_arxiv_id":"2605.03975","ref_index":25,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Quantum metrology of mixed states via purification","primary_cat":"quant-ph","submitted_at":"2026-05-05T16:59:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"New purification-based reformulations of QCRB and HCRB connect mixed-state metrology bounds to those of purified states, enabling asymptotic attainment of HCRB or 2×QCRB via random channels and individual measurements.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.03685","ref_index":38,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Quantum Multi-Level Estimation of Functionals of Discrete Distributions","primary_cat":"quant-ph","submitted_at":"2026-05-05T12:25:17+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A quantum multi-level framework achieves near-optimal query complexity for q-Tsallis entropy estimation for q>1 and a speedup for q<1 over classical methods.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.26900","ref_index":32,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Strict Hierarchy for Quantum Channel Certification to Unitary","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:10:34+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.17369","ref_index":22,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition","primary_cat":"quant-ph","submitted_at":"2026-04-19T10:51:10+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Quantum channel tomography query complexity transitions from Heisenberg scaling Θ(r d1 d2 / ε) at dilation rate τ=1 to classical scaling Θ(r d1 d2 / ε²) for τ ≥ 1+Ω(1).","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"Treating|V⟩ ⟩as a bipartite vector in (H A ⊗ HB)⊗ H anc and according to Theorem 3.11, we have |V⟩ ⟩⊗n =L λ⊢sn |IPλ⟩ ⟩ ⊗ |Vλ⟩for|I Pλ⟩ ⟩ ∈ PAB,λ ⊗ Panc,λ and|V λ⟩ ∈ Q d1d2 AB,λ ⊗ Qr anc,λ. Thus, tranc(|V⟩ ⟩ ⟨ ⟨V|⊗n) = tranc   M λ,µ⊢sn |IPλ⟩ ⟩ ⟨ ⟨IPµ| ⊗ |Vλ⟩ ⟨Vµ|   = M λ⊢sn trPanc,λ \u0010 |IPλ⟩ ⟩ ⟨ ⟨IPλ| \u0011 ⊗tr Qr anc,λ \u0010 |Vλ⟩ ⟨Vλ| \u0011 = M λ⊢sn IPAB,λ ⊗tr Qr anc,λ \u0010 |Vλ⟩ ⟨Vλ| \u0011 ,(22) in which tranc(·) denotes the partial trace on all ancilla systems Nn j=1 Hanc,j. Also, we can see C⊗n E = M λ⊢d1d2 n IPAB,λ ⊗C E,λ ,(23) for certainC E,λ ∈ L(Q d1d2 AB,λ). Comparing Equation (22) with Equation (23), we find that trQr anc,λ(|Vλ⟩ ⟨Vλ|) = CE,λ forλ⊢ s n, and alsoC E,λ = 0 for thoseλwith more thansrows. This means, eTi ⋆ C ⊗n E = tr"},{"citing_arxiv_id":"2604.06325","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Probabilistic and approximate universal quantum purification machines","primary_cat":"quant-ph","submitted_at":"2026-04-07T18:01:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibit a dimension-dependent trade-off between pure-output and append-environment maps.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"circuits cannot control unknown operations, New J. Phys. 16, 093026 (2014), arXiv:1309.7976 [quant-ph]. [16] Z. Gavorová, M. Seidel, and Y. Touati, Topological ob- structions to quantum computation with unitary or- acles, Phys. Rev. A109, 032625 (2024), arXiv:2011.10031 [quant-ph]. [17] E. Tang, J. Wright, and M. Zhandry, Conjugate queries can help (2025), arXiv:2510.07622 [quant-ph]. [18] S. Yoshida, R. Niwa, and M. Murao, Random dilation superchannel (2025), arXiv:2512.21260 [quant-ph]. [19] G. Chiribella, G. M. D'Ariano, and P. Perinotti, Quantum circuit architecture, Phys. Rev. Lett.101, 060401 (2008), arXiv:0712.1325 [quant-ph]. [20] G. Chiribella, G. M. D'Ariano, and P. Perinotti, Trans- forming quantum operations: Quantum supermaps, EPL"},{"citing_arxiv_id":"2512.21260","ref_index":5,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Random dilation superchannel","primary_cat":"quant-ph","submitted_at":"2025-12-24T16:09:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.20599","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Random Stinespring superchannel: converting channel queries into dilation isometry queries","primary_cat":"quant-ph","submitted_at":"2025-12-23T18:46:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Introduces the random Stinespring superchannel to convert channel queries into isometry queries, yielding a channel analogue of Uhlmann's theorem and proving optimal channel learning query complexity of Θ(d_A d_B r).","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}