Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination
Summarize this article with:
Quantum Physics arXiv:2603.19911 (quant-ph) [Submitted on 20 Mar 2026] Title:Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination Authors:Zixin Huang, Ludovico Lami, Vishal Singh, Mark M. Wilde View a PDF of the paper titled Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination, by Zixin Huang and 3 other authors View PDF HTML (experimental) Abstract:Discriminating between noisy quantum processes is a central primitive for quantum communication, metrology, and computing. While discrimination limits for finite-dimensional channels are well understood, the continuous-variable setting, particularly under experimentally relevant energy constraints, remains significantly less developed. In this work, we establish an energy-constrained chain rule for the Belavkin-Staszewski channel divergence, which yields a fundamental upper bound on the error exponents achievable by fully adaptive, energy-constrained quantum channel discrimination protocols. We then derive efficiently computable bounds on asymmetric error exponents for energy-constrained discrimination of bosonic dephasing and loss-dephasing channels. Specifically, we show that three operationally relevant quantities -- the measured relative entropy, the Umegaki relative entropy, and the geometric Renyi divergence -- admit semidefinite program (SDP) formulations when the input energy is bounded and the Hilbert space is suitably truncated. Applying these tools, we demonstrate that optimal probes for these channels under energy constraints are Fock-diagonal, and we also enable numerically precise evaluation of bounds on achievable error exponents across discrimination strategies ranging from separable to fully adaptive. The resulting SDPs provide practical benchmarks for quantum-limited sensing in low-energy bosonic platforms. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.19911 [quant-ph] (or arXiv:2603.19911v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.19911 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Zixin Huang [view email] [v1] Fri, 20 Mar 2026 12:50:35 UTC (377 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination, by Zixin Huang and 3 other authorsView PDFHTML (experimental)TeX Source view license Ancillary-file links: Ancillary files (details): Fig_2_dephasing_function_energy.py Fig_3_loss_dephasing_function_energy.py Fig_4_dephasing_function_gamma_E05.py Fig_5_DA.py Fig_6_DA_loss_dephase.py PartialTrace.m PermuteSystems.m RE_loss_dephase_r13.m RE_lower_dephase_only_r13.m RE_lower_loss_dephase_r13_v2.m RE_upper_dephase_only_r13.m RE_upper_loss_dephase_r13_v2.m _Content_Types_.xml bosonic_dephasing_channel.m bosonic_loss_channel.m channel_bdc.m choi_loss_dephasing.m choi_matrix_bdc.m choi_matrix_loss.m choi_matrix_loss_dephase_v2.m ft.m lgwt.m loss_choi_element_2d.m loss_dephase_choi_element_2d.m matlab/document.xml matlab/output.xml measured_loss_dephase_m3k3_sup_op.m measured_m3k3_sup_op.m metadata/coreProperties.xml metadata/mwcoreProperties.xml metadata/mwcorePropertiesExtension.xml metadata/mwcorePropertiesReleaseInfo.xml opt_args.m primal_ell_8_bdc.m primal_ell_8_loss_dephase.m rm.m(31 additional files not shown) You must enabled JavaScript to view entire file list. Current browse context: quant-ph new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)