Back to News
quantum-computing

On Shor's conjecture on the accessible information of quantum dichotomies

Khac Duc An Thai, Michele Dall'Arno
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Khac Duc An Thai and Michele Dall’Arno challenge a 25-year-old open conjecture by Peter Shor, which claims von Neumann measurements maximize classical information extraction from binary quantum systems. Their work disproves a previously assumed monotonic relationship between accessible information and guessing probability in qubit systems, which had been proposed as a potential resolution to Shor’s conjecture. The study introduces a state-dependent generalization of measurement extremality, refining how optimal quantum measurements are characterized for qubit dichotomies under varying conditions. By leveraging quantum majorization and Lorenz curve analysis, the authors tighten existing bounds on accessible information, offering new tools to address Shor’s longstanding problem. The findings suggest progress toward resolving the conjecture, though a full proof remains elusive, marking a critical step in quantum information theory.
AI Audio Summary
0:00 / 0:00
Click to play
8eaedf23-5eba-49d5-9b8a-62223a528def.jpeg
Quantum News · Media Library

Quantum Physics arXiv:2512.11233 (quant-ph) [Submitted on 12 Dec 2025] Title:On Shor's conjecture on the accessible information of quantum dichotomies Authors:Khac Duc An Thai, Michele Dall'Arno View a PDF of the paper titled On Shor's conjecture on the accessible information of quantum dichotomies, by Khac Duc An Thai and Michele Dall'Arno View PDF HTML (experimental) Abstract:Around the turn of the century, Shor formulated his well-known and still-open conjecture stating that the accessible information of any quantum dichotomy, that is the maximum amount of classical information that can be decoded from a binary quantum encoding, is attained by a von Neumann measurement. A quarter of a century later, new developments on the Lorenz curves of quantum dichotomies in the field of quantum majorization and statistical comparison may provide the key to unlock such a longstanding open problem. Here, we first investigate the tradeoff relations between accessible information and guessing probability in the binary case, thus disproving the claimed monotonicity of the former quantity in the latter that, if true, would have settled Shor's problem in the qubit case. Our second result is to provide a state-dependent generalization of extremality for quantum measurements, to characterize state-dependent extremality for qubit dichotomies, and to apply such results to tighten previous results on the accessible information of qubit dichotomies. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2512.11233 [quant-ph] (or arXiv:2512.11233v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.11233 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Michele Dall'Arno [view email] [v1] Fri, 12 Dec 2025 02:32:55 UTC (44 KB) Full-text links: Access Paper: View a PDF of the paper titled On Shor's conjecture on the accessible information of quantum dichotomies, by Khac Duc An Thai and Michele Dall'ArnoView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-12 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?)

Read Original

Tags

partnership
quantum-algorithms
quantum-hardware

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.