Sharp support transitions and Gaussian recovery for quantum references

A finite quantum phase reference can restore information lost by counting, but occupied support and phase noise impose different limits. For complementary binomial signals with sublinear cyclic order, we establish these limits and compare designs under a declared resource budget. At critical uniform-dephasing quality, bounded support attains the full coherent error exponent precisely above the bias threshold p* = (1 − 1/√2)/2. At and below it, every fixed support bound leaves a positive gap, while arbitrarily slow support growth suffices. Near the threshold from above, a geometric construction needs only logarithmically many charges in the inverse distance to the threshold. Four charges are necessary and sufficient for 3/10 ≤ p < 1/2. Gaussian recovery also depends on how rapidly the cyclic order grows. Widths decaying as a power faster than the inverse square root of signal size recover the ideal exponent at any fixed span ratio when cyclic order grows slower than the logarithm of that size. When cyclic order grows faster than this logarithm, every fixed polynomial precision loses its exponential advantage. The ideal optimized rate survives logarithmic precision costs and a declared polynomial charge for the largest protected subspace dimension in an occupied block. At a common budget, an explicit four-charge reference outperforms the fully optimized two-charge class. Explicit constructions and converses over all reference states distinguish occupied support, register span and noise as separate resources. Author preprint, version V2.7. The main manuscript, complete proofs, LaTeX sources, computational resource and alternative figure/table descriptions are included. The scientific content and author declarations are preserved; journal-specific packaging and the editorial cover letter are excluded. All files are embargoed until 15 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24223502
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharp support transitions and Gaussian recovery for quantum references

Ahmet Faruk Arapoglu
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Sharp support transitions and Gaussian recovery for quantum references

Ahmet Faruk Arapoglu
preprint en

Abstract

A finite quantum phase reference can restore information lost by counting, but occupied support and phase noise impose different limits. For complementary binomial signals with sublinear cyclic order, we establish these limits and compare designs under a declared resource budget. At critical uniform-dephasing quality, bounded support attains the full coherent error exponent precisely above the bias threshold p* = (1 − 1/√2)/2. At and below it, every fixed support bound leaves a positive gap, while arbitrarily slow support growth suffices. Near the threshold from above, a geometric construction needs only logarithmically many charges in the inverse distance to the threshold. Four charges are necessary and sufficient for 3/10 ≤ p < 1/2. Gaussian recovery also depends on how rapidly the cyclic order grows. Widths decaying as a power faster than the inverse square root of signal size recover the ideal exponent at any fixed span ratio when cyclic order grows slower than the logarithm of that size. When cyclic order grows faster than this logarithm, every fixed polynomial precision loses its exponential advantage. The ideal optimized rate survives logarithmic precision costs and a declared polynomial charge for the largest protected subspace dimension in an occupied block. At a common budget, an explicit four-charge reference outperforms the fully optimized two-charge class. Explicit constructions and converses over all reference states distinguish occupied support, register span and noise as separate resources. Author preprint, version V2.7. The main manuscript, complete proofs, LaTeX sources, computational resource and alternative figure/table descriptions are included. The scientific content and author declarations are preserved; journal-specific packaging and the editorial cover letter are excluded. All files are embargoed until 15 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon