Asymptotic magic state distillation with almost linear rate
- URL: http://arxiv.org/abs/2605.30108v1
- Date: Thu, 28 May 2026 15:47:16 GMT
- Title: Asymptotic magic state distillation with almost linear rate
- Abstract summary: Two quantities are closely related in the specific case -- the overhead exponent is zero if and only if the distillation rate is linear.<n>Here, we show that their quantitative relation is generally not robust, by presenting a family of magic state distillation protocols with an overhead exponent not close to zero.<n>This implies that the distillation rate is not constrained by the overhead exponent within the sublinear rate regime.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The overhead exponent -- characterizing the scaling of the number of noisy magic states with respect to the target distillation error -- has been a central quantity to benchmark magic state distillation protocols. On the other hand, a related but less investigated quantity motivated by an information-theoretic viewpoint is the asymptotic distillation rate, the largest ratio of output to input magic states such that error vanishes asymptotically. These two quantities are tightly related in the specific case -- the overhead exponent is zero if and only if the asymptotic distillation rate is linear. However, their relationship in other regimes has been unclear. Here, we show that their quantitative relation is generally not robust, by presenting a family of magic state distillation protocols with an overhead exponent not close to zero -- in fact, larger than one -- that still achieves the asymptotic rate arbitrarily close to the linear rate. This implies that the distillation rate is not constrained by the overhead exponent within the sublinear rate regime. Notably, our protocol is based on error checking by measurements of logical Clifford operators, which underlies the recent magic state cultivation protocol, suggesting the potential of this mechanism for asymptotic magic state distillation.
Related papers
- Graph Diffusion Residuals for Control-Function Instrumental Variables [82.39671985893028]
High-capacity first stages can interpolate treatment and leave too little residual information for the outcome equation.<n>We study Adaptive Anisotropic Instrumental Heat Flow (A-IHF), a deterministic graph-diffusion residual extractor for flexible control functions.<n>A-IHF treats treatment as a signal on a graph of first-stage features, uses pilot diffusion to detect large treatment jumps, attenuates conductance across those jumps, and computes the generated control with a sparse graph resolvent.
arXiv Detail & Related papers (2026-06-12T17:02:53Z) - Non-Local Magic Resources for Fermionic Gaussian States [0.0]
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems.<n>We propose a closed-form expression for the non-local stabilizer entropies of fermionic Gaussian states over local Gaussian unitaries.<n>We apply this framework to characterize fermionic non-local magic across diverse physical regimes.
arXiv Detail & Related papers (2026-04-29T18:00:00Z) - Exponential Analysis for Entanglement Distillation [9.125120975190711]
We study the reliability function of entanglement distillation, which specifies the optimal exponent of the decay of the distillation error.<n>We also extend the framework from the standard setting of known states to a black-box setting, where distillation is performed from a set of possible states.
arXiv Detail & Related papers (2026-01-15T08:46:47Z) - One-shot distillation with constant overhead using catalysts [3.771547570340179]
Minimizing the overhead distillation is crucial for the realization of quantum computation and other technologies.<n>In particular, for magic state distillation our method paves a path for tackling the diverging batch size problem.<n>We extend techniques to dynamical quantum resources and show that mutual information determines one-shot catalytic channel transformation.
arXiv Detail & Related papers (2024-10-18T15:41:52Z) - Rethinking Self-Distillation: Label Averaging and Enhanced Soft Label Refinement with Partial Labels [10.696635172502141]
Multi-round self-distillation effectively performs label averaging among instances with high feature correlations.<n>We introduce a novel, efficient single-round self-distillation method using refined partial labels from the teacher's top two softmax outputs.
arXiv Detail & Related papers (2024-02-16T07:13:12Z) - The coherent measurement cost of coherence distillation [0.0]
We show that distillation exacts a hidden coherent measurement cost.<n>We show that this cost is no smaller than the coherence of measurements saturating the scaling law.
arXiv Detail & Related papers (2023-08-15T11:52:35Z) - Catalytic and asymptotic equivalence for quantum entanglement [44.99833362998488]
Many-copy entanglement manipulation procedures allow for highly entangled pure states from noisy states.<n>We show that using an entangled catalyst cannot enhance the singlet distillation rate of a distillable quantum state.<n>Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and state transformations of entangled states.
arXiv Detail & Related papers (2023-05-05T12:57:59Z) - Statistical Efficiency of Score Matching: The View from Isoperimetry [96.65637602827942]
We show a tight connection between statistical efficiency of score matching and the isoperimetric properties of the distribution being estimated.
We formalize these results both in the sample regime and in the finite regime.
arXiv Detail & Related papers (2022-10-03T06:09:01Z) - Off-policy estimation of linear functionals: Non-asymptotic theory for
semi-parametric efficiency [59.48096489854697]
The problem of estimating a linear functional based on observational data is canonical in both the causal inference and bandit literatures.
We prove non-asymptotic upper bounds on the mean-squared error of such procedures.
We establish its instance-dependent optimality in finite samples via matching non-asymptotic local minimax lower bounds.
arXiv Detail & Related papers (2022-09-26T23:50:55Z) - Data-Driven Influence Functions for Optimization-Based Causal Inference [105.5385525290466]
We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing.
We study the case where probability distributions are not known a priori but need to be estimated from data.
arXiv Detail & Related papers (2022-08-29T16:16:22Z) - Constraints on magic state protocols from the statistical mechanics of
Wigner negativity [0.0]
We develop a statistical framework based on majorization to describe Wigner negative magic states for qudits of odd prime dimension processed under Clifford circuits.
We show that majorization allows us to both quantify disorder in the Wigner representation and derive upper bounds for magic distillation.
arXiv Detail & Related papers (2021-06-29T15:57:24Z) - On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and
Non-Asymptotic Concentration [115.1954841020189]
We study the inequality and non-asymptotic properties of approximation procedures with Polyak-Ruppert averaging.
We prove a central limit theorem (CLT) for the averaged iterates with fixed step size and number of iterations going to infinity.
arXiv Detail & Related papers (2020-04-09T17:54:18Z) - Finite Block Length Analysis on Quantum Coherence Distillation and
Incoherent Randomness Extraction [64.04327674866464]
We introduce a variant of randomness extraction framework where free incoherent operations are allowed before the incoherent measurement.
We show that the maximum number of random bits extractable from a given quantum state is precisely equal to the maximum number of coherent bits that can be distilled from the same state.
Remarkably, the incoherent operation classes all admit the same second order expansions.
arXiv Detail & Related papers (2020-02-27T09:48:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.