Pith. sign in

REVIEW 2 major objections 3 minor 67 references

One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization

T0 review · 2 major / 3 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A qubit can beat a classical bit in one-bit model quantization when contexts demand different signs.

desk verdict The separation proof is real but only against no-bias signed per-row one-bit baselines, not the affine one-bit class the paper itself identifies, so the 'one qubit beats one bit' headline overreaches. read the letter →

arxiv 2608.05240 v1 pith:DN546QSE submitted 2026-08-05 quant-ph cs.AIcs.LG

Yuma Ichikawa , Moeto Mishima This is my paper · ORCID
classification quant-phcs.AIcs.LG
keywords post-trainingquantizationone-bitquantumrandomaccesscodemeasurementincompatibilitycontext-dependentweightsignsshared-signconstraintreconstructionriskshotnoise
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks whether one logical qubit per weight can outperform one classical bit in the most extreme form of model compression: storing each weight only as a sign. It introduces Quantum Random Access Quantization (QRAQ), which encodes several context-specific sign matrices into one quantum state and retrieves the sign for the current deployment context by choosing a matching Pauli measurement. For signed per-row scales, the paper proves that ideal QRAQ attains the average of the context-wise binary optima, while any classical one-bit quantizer must commit to a single sign vector shared across all contexts. The row-wise reconstruction-risk gap is strictly positive exactly when the context-wise optimal sign sets have no common representative, and it survives finite shots and depolarizing noise when the ideal margin exceeds an explicit variance inflation. The result identifies measurement incompatibility, rather than quantization error alone, as a resource that could be used if future hardware supports calibrated re-preparation of qubit states.

What carries the argument

The central object is a quantum random-access code (QRAC) used as a memory cell per weight entry. For two contexts, the cell is a single qubit in state $\rho_{ij} = (I + B^{(1)}_{ij} X/\sqrt{2} + B^{(2)}_{ij} Z/\sqrt{2})/2$, whose $X$ and $Z$ measurements return the two possible signs in expectation; for $K$ contexts, the construction uses $n = \lceil(K-1)/2\rceil$ qubits and a Jordan–Wigner family of pairwise anticommuting Pauli observables, with Bloch radius $1/\sqrt{K}$ tight for positivity. The mechanism: a context label selects the matched Pauli observable, and averaging $S$ fresh-copy readouts yields an unbiased estimate of the context-specific sign with an explicit shot-noise term $\nu_K(\eta)/S$, where $\nu_K(\eta) = K/\eta^2 - 1$. The proof machinery is the bias–variance decomposition of the layer-wise quadratic reconstruction risk, reduced row-wise to a comparison of 'min after summing' versus 'sum of mins.'

What would settle it

On the two-context symmetric covariance family with $w=(1,0)$, $S=1$, and $\eta=1$, compute the row risk of a physical single-qubit QRAQ implementation and compare to the one-bit shared-sign baseline; the paper predicts a strictly lower QRAQ risk exactly for anisotropy $r$ in $((\sqrt{5}-1)/2, 1)$. If the measured risk gap is non-positive in that interval, or if the gap fails to vanish below that threshold, the central separation is refuted. Alternatively, run the same comparison on real attention-head activation covariances and verify that rows with positive ideal gap correspond to empty intersection of per-context sign optima.

Watch

Extended reading notes

Core claim

At the heart of the paper is a row-wise comparison. For a weight row $w$ and context covariance $\Sigma_\tau$, the best one-bit fit to a sign vector $b$ is $J^*_\tau(b) = w \Sigma_\tau w^T - (b \Sigma_\tau w^T)^2/(b \Sigma_\tau b^T)$. The classical shared-sign row risk is $\min_{c \in \{\pm1\}^M} \sum_\tau \pi_\tau J^*_\tau(c)$, while ideal QRAQ attains $\sum_\tau \pi_\tau \min_b J^*_\tau(b)$. The paper proves (Theorem C.7) that the difference $\Delta_\infty = \min_{c} \sum_\tau \pi_\tau J^*_\tau(c) - \sum_\tau \pi_\tau \min_b J^*_\tau(b)$ is nonnegative, and strictly positive exactly when the per-context optimal sign sets $\mathcal{M}_\tau = \arg\min_b J^*_\tau(b)$ have empty intersection modulo the global sign symmetry $b \sim -b$. For finite shots, QRAQ's unbiased estimate of each context sign carries variance $\mu^2/S \cdot (K/\eta^2 - 1)$ under depolarizing noise, so the strict row-wise separation survives when $S$ exceeds the explicit inflation ratio in Eq. (16). The result turns the shared-sign constraint of one-bit PTQ into a quantifiable gap that can be certified from calibration data.

Load-bearing premise

All claims of one-qubit memory advantage rely on the fresh-copy readout model (Assumption 4.1): each measurement shot needs a newly prepared copy of the same QRAC state; if a physical device cannot re-prepare or parallel-instantiate states, the one-qubit-per-weight memory saving evaporates.

Editorial extensions

If this is right

  • Under signed per-row scales, the ideal QRAQ row risk never exceeds the shared-sign classical optimum, and it is strictly lower precisely when the per-context optimal sign sets for that row have empty intersection modulo global sign symmetry.
  • The finite-shot separation is governed by a computable threshold: a row keeps its advantage when the shot count $S$ exceeds the variance inflation $\nu_K(\eta) \sum_\tau \pi_\tau T_\tau (\mu^*_\tau)^2 / \Delta_\infty^i$, with $\nu_K(\eta) = K/\eta^2 - 1$.
  • For scale classes coarser than or equal to signed per-row scaling, the separation transfers automatically; for per-column, row-times-column, or group scaling, no universal gap exists and the margin must be certified directly on the instance.
  • In the resource-fair comparison (one qubit versus one classical bit, $S = 1$), quantum advantage persists in the two-context symmetric covariance family when the anisotropy $r$ exceeds $(\sqrt{5}-1)/2$ for $w = (1,0)$.
  • Empirical gap certificates: with bounded activations and nondegenerate denominators, sample sizes satisfying $M \varepsilon_\Sigma \le \lambda_0/2$ certify a positive population gap with probability at least $1-\delta$ via the stated confidence radius.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The advertised one-qubit-per-weight memory claim is conditional on the fresh-copy readout model: without re-preparation or parallel instantiation, serving $K$ contexts or $S$ shots consumes $K$ or $S$ physical qubit copies per weight, which the paper itself lists as a limitation.
  • The method requires the encoder to know the context-wise sign optima at calibration time, so it compresses information that a classical device could also store as $K$ sign bits; the quantum advantage is a reconstruction-risk statement under a fixed memory cell count, not a communication advantage.
  • A practical deployment path suggested by the certificate is to evaluate the sign-disagreement margin on calibration data first and spend shot budget only on rows where the ideal gap clears the noise threshold, making the advantage testable before any quantum hardware exists.
  • If confirmed on real attention-head or mixture-of-experts activation statistics, the result would reframe one-bit PTQ as a measurement-selection problem over a fixed quantum memory, connecting quantization to quantum memory design.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper introduces Quantum Random Access Quantization (QRAQ), a scheme in which each weight entry stores one logical QRAC register and the deployment context selects a Pauli measurement, producing an unbiased context-dependent sign estimate with an explicit shot-noise penalty. The main formal result (Theorem C.7) proves that, for signed per-row scales and no zero-point, ideal QRAQ per-row risk is never worse than the best shared-sign classical one-bit risk, and is strictly better exactly when the context-wise optimal sign sets have no common representative modulo global sign. Finite-shot and depolarizing-noise thresholds are derived, and the sign-disagreement condition is shown necessary for any finite-shot advantage. The paper also provides a scale-granularity boundary, a finite-sample certificate, extensions to multi-qubit QRACs, correlated noise, and general Pauli noise, together with simulator experiments that match the closed-form predictions.

Significance. Within the deliberately narrow class of no-bias signed per-row shared-sign one-bit quantizers, the formal results are sound and clearly presented. The proofs are self-contained, the shot-noise and noise thresholds are explicit, and the finite-sample certificate is a practically useful addition. The use of measurement incompatibility as the operative resource is articulated well, and the experimental section is honest simulator validation rather than an overclaimed hardware benchmark. However, the headline claim that one qubit beats one bit is not supported against affine one-bit quantizers with a zero-point, a class that the paper's own Theorem C.5 identifies as the classical simulation of non-symmetric fixed-readout decoders; in the two-dimensional case that affine class attains zero classical risk while ideal QRAQ has positive risk. The fresh-copy readout model also makes the one-qubit-per-weight memory claim conditional in a way the title does not convey. The contribution is therefore a valid separation result for a well-defined subclass, but it is substantially narrower than advertised.

major comments (2)
  1. [Theorem C.7; Eq. (56); Corollary C.9, Eq. (73)] The central separation is stated only against shared-sign signed per-row scales with no zero-point, yet Theorem C.5 explicitly introduces affine one-bit quantizers with a context-dependent zero-point as the classical simulation of non-symmetric fixed-readout decoders. The affine class is therefore within the paper's own logical landscape and is a natural one-bit PTQ baseline. For M=2 and K=2, choose the shared sign c=(1,-1); for any row w=(w1,w2) and any context tau, the scalars alpha_tau=(w1-w2)/2 and beta_tau=(w1+w2)/2 satisfy alpha_tau c + beta_tau 1 = w, so the affine shared-sign baseline attains zero reconstruction risk in every context. In the same two-dimensional symmetric-covariance setting, Corollary C.9 gives positive ideal QRAQ risk whenever r>r0, for example w=(1,3) and r=0.8 gives ideal QRAQ risk 1. Thus the unqualified claim in the title and abstract that one qubit beats one bit is false for the affine class, and no theorem in the paper bounds that class. The claims should be restated relative to the no-bias signed per-row subclass, or a separate treatment of the affine baseline should be added.
  2. [Assumption 4.1; Section 7] The fresh-copy readout model is load-bearing for the 'one qubit per weight' resource claim. If state re-preparation is unavailable, serving S shots or K contexts requires S or K physical qubit preparations per weight, which erases the one-qubit memory advantage. If re-preparation is available, the device must have access to the calibrated context-specific sign matrices B^(tau) to prepare each QRAC state; that is exactly the information QRAQ is claimed to compress. The paper acknowledges this in Assumption 4.1 and Section 7, but the title, abstract, and main-takeaway box do not condition the advantage claim on this model. The abstract and conclusion should state that the result is a per-query logical readout separation under the fresh-copy/re-preparation model, not a physical memory-size advantage.
minor comments (3)
  1. [Assumption 4.1] The phrase 'or equivalently on a device that can re-prepare the same QRAC state before each shot' is statistically equivalent but not operationally or resource equivalent; consider replacing 'equivalently' with 'alternatively' and explicitly discussing the resource difference.
  2. [Section 7, Limitations] The limitations list should include the affine zero-point per-row class as a class over which QRAQ has no certified advantage; the current list mentions per-entry scales but omits the affine one-bit class highlighted by Theorem C.5.
  3. [Corollary C.10] The observation that the sufficient threshold of Corollary C.8 can never certify advantage at S=1 in the symmetric two-context family is interesting and would be more visible if mentioned near Eq. (16) in the main text rather than only in the appendix.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main separation is a self-contained optimization result; the affine-baseline concern is a scope/correctness issue, not circularity.

full rationale

The central formal claim is Theorem C.7, which compares two explicitly defined optimization problems: the classical shared-sign signed-per-row risk (Eq. 56) and the QRAQ per-context signed-per-row risk (Eq. 10 with per-context signs). The ideal gap is expressed in Eq. (15) as min_c sum_tau pi_tau J*_tau(c) - sum_tau pi_tau min_b J*_tau(b), and the sign-disagreement criterion (D1) is a genuine mathematical characterization of when this gap is positive, proved by finite enumeration in Appendix C.7. The finite-shot threshold (D2) and the noise-robust variants are derived independently from bias-variance decompositions and concentration arguments, not fitted to the data they purport to predict. The QRAC encoding uses standard externally cited QRAC results (Ambainis et al., Nayak), and no uniqueness theorem or ansatz is imported from the authors' own prior work. The only self-citation (Arai and Ichikawa 2025) concerns a heuristic ADMM solver for the classical baseline and is not load-bearing for the separation theorems. The skeptic's point that an affine one-bit baseline with a context-dependent zero-point can beat QRAQ for M=2 is a scope/correctness objection to the unqualified title: the paper's formal statement explicitly restricts the classical side to signed per-row scales, and Theorem C.5 itself acknowledges that non-symmetric fixed-readout quantum decoders are classically simulable by affine one-bit quantizers with zero-points. The paper also states this limitation in Section 7. Such an omitted-baseline concern is not a circular reduction of the derivation to its inputs, so it does not increase the circularity score.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No numerical constants are fitted to data. The theoretical results optimize over signs and scales, and simulation parameters such as Gaussian weights, Wishart covariances, and depolarizing eta are chosen to instantiate the model, not to make the separation appear. The load-bearing assumptions are the fresh-copy readout model, the context covariance model, the Pauli QRAC construction, and the restriction of the classical baseline to shared-sign with signed per-row scales.

assumptions (5)
  • domain assumption Independent identically prepared copies of each QRAC state can be produced before every shot (Assumption 4.1).
    Required for the S-shot variance formula and for the claim that one logical qubit serves all contexts; re-preparation needs the calibration data and is not costed in the memory comparison.
  • standard math K pairwise anticommuting self-inverse observables exist on n = ceil((K-1)/2) qubits with state positivity at c = 1/sqrt(K) (Lemma C.1, Jordan-Wigner family).
    Standard Pauli and Clifford algebra; verified in Appendix A.4 and Lemma C.1.
  • domain assumption Depolarizing noise with parameter eta is the default hardware noise model.
    All finite-shot thresholds depend on nu_K(eta) = K/eta^2 - 1; other noise models are treated only as extensions.
  • domain assumption Deployment contexts are known in advance and have accurate activation covariances Sigma_tau and prior pi.
    Certificates are computed from these covariances; mis-specified contexts invalidate the gap.
  • ad hoc to paper The classical baseline is restricted to shared-sign one-bit PTQ with signed per-row scales, with no zero-points and no stochastic context-dependent decoders.
    The separation is proven relative to this class; Theorem C.5 shows a more general affine one-bit classical simulator exists, so this choice narrows the comparison in favor of QRAQ.

how reviews work

0 comments
Cite this review

Pith. "Pith review of One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization." pith.science (2026). https://pith.science/paper/DN546QSE

@misc{pith2026260805240,
  author       = {Pith},
  title        = {Pith review of: One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DN546QSE}},
  note         = {Machine review of arXiv:2608.05240}
}
read the original abstract

One-bit post-training quantization represents each weight using only its sign, requiring all deployment contexts to share the same binary weight matrix even when their activation statistics favor different sign patterns. We study this shared-sign constraint and introduce Quantum Random Access Quantization (QRAQ). This framework encodes context-dependent signs in a quantum random-access code and retrieves them via context-matched Pauli measurements. Under an explicit fresh-copy logical readout model, QRAQ produces an unbiased, context-specific binary surrogate with a tractable shot-noise penalty. We prove a row-wise separation from shared-sign one-bit PTQ with signed per-row scales. When the optimal context-wise signs are incompatible, QRAQ achieves a strictly lower ideal reconstruction risk. We also derive finite-shot and calibrated-noise conditions under which this separation is retained. Fixed-readout quantum schemes are classically simulable, so the relevant resource in this model is measurement incompatibility rather than quantization alone. Finally, we characterize the role of scale granularity, provide finite-sample certificates, and evaluate the predicted ideal, finite-shot, noisy, and multi-context regimes in simulator experiments.

Figures

Figures reproduced from arXiv: 2608.05240 by the authors.

Figure 1
Figure 1. QRAQ workflow for two contexts. Each weight entry stores one qubit whose [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Simulator validation of QRAQ. Panel a shows the ideal relative gap versus inter-context [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Resource-fair comparison on the two-context symmetric covariance family [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Bloch-sphere representation of the two-context QRAC state for a single qubit. Each [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: Additional scaling sweeps. Panels show the [PITH_FULL_IMAGE:figures/full_fig_p039_5.png]
Figure 6
Figure 6. Figure 6: Large-K scaling on the shared-factor Wishart model. The relative population gap grows from K = 2 to K = 15 and then begins to saturate in the tested regime. Large-K scaling. Theorem C.15 guarantees representability for K ≤ 2n + 1, but it does not imply that the gap mus…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

67 extracted references · 41 canonical work pages

  1. [1]

    Dense quantum coding and quantum finite automata

    Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, and Umesh Vazirani. Dense quantum coding and quantum finite automata. Journal of the ACM, 49 0 (4): 0 496--511, 2002. doi:10.1145/581771.581773. URL https://doi.org/10.1145/581771.581773

    arXiv 2002

  2. [3]

    Quantization error propagation: Revisiting layer-wise post-training quantization

    Yamato Arai and Yuma Ichikawa. Quantization error propagation: Revisiting layer-wise post-training quantization. In Advances in Neural Information Processing Systems 38, 2025. URL https://openreview.net/forum?id=a3l3K9khbL

    work page 2025

  3. [4]

    Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan Alistarh, Torsten Hoefler, and James Hensman

    Saleh Ashkboos, Amirkeivan Mohtashami, Maximilian L. Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan Alistarh, Torsten Hoefler, and James Hensman. QuaRot : Outlier-free 4-bit inference in rotated LLMs . In Advances in Neural Information Processing Systems 37, pages 100213--100240, 2024. doi:10.5555/3737916.3741096. URL https://proceedings.neurips.cc/pap...

    work page arXiv 2024

  4. [5]

    Distributed optimization and statistical learning via the alternating direction method of multipliers

    Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3 0 (1): 0 1--122, 2011. doi:10.1561/2200000016. URL https://doi.org/10.1561/2200000016

    doi:10.1561/2200000016 2011

  5. [6]

    Quantum random access codes and incompatibility of measurements

    Claudio Carmeli, Teiko Heinosaari, and Alessandro Toigo. Quantum random access codes and incompatibility of measurements. EPL (Europhysics Letters), 130 0 (5): 0 50001, 2020. doi:10.1209/0295-5075/130/50001. URL https://doi.org/10.1209/0295-5075/130/50001

    doi:10.1209/0295-5075/130/50001 2020

  6. [7]

    QuIP : 2-bit quantization of large language models with guarantees

    Jerry Chee, Yaohui Cai, Volodymyr Kuleshov, and Christopher De Sa. QuIP : 2-bit quantization of large language models with guarantees. In Advances in Neural Information Processing Systems 36, 2023. URL https://proceedings.neurips.cc/paper_files/paper/2023/hash/0df38cd13520747e1e64e5b123a78ef8-Abstract-Conference.html

    work page 2023

  7. [8]

    Incompatibility robustness of quantum measurements: A unified framework

    S \'e bastien Designolle, M \'a t \'e Farkas, and Jedrzej Kaniewski. Incompatibility robustness of quantum measurements: A unified framework. New Journal of Physics, 21 0 (11): 0 113053, 2019. doi:10.1088/1367-2630/ab61c4. URL https://doi.org/10.1088/1367-2630/ab61c4

    work page doi:10.1088/1367-2630/ab61c4 2019

  8. [9]

    LLM .int8() : 8-bit matrix multiplication for transformers at scale

    Tim Dettmers, Mike Lewis, Younes Belkada, and Luke Zettlemoyer. LLM .int8() : 8-bit matrix multiplication for transformers at scale. In Advances in Neural Information Processing Systems 35, pages 30318--30332, 2022. URL https://proceedings.neurips.cc/paper_files/paper/2022/hash/c3ba4962c05c49636d4c6206a97e9c8a-Abstract-Conference.html

    work page 2022

Show all 67 references
  1. [10]

    Esser, Jeffrey L

    Steven K. Esser, Jeffrey L. McKinstry, Deepika Bablani, Rathinakumar Appuswamy, and Dharmendra S. Modha. Learned step size quantization. In The Eighth International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id=rkgO66VKDS

    2020

  2. [11]

    Simple and general bounds on quantum random access codes

    M \'a t \'e Farkas, Nikolai Miklin, and Armin Tavakoli. Simple and general bounds on quantum random access codes. Quantum, 9: 0 1643, 2025. doi:10.22331/q-2025-02-25-1643. URL https://doi.org/10.22331/q-2025-02-25-1643

    2025 doi

  3. [12]

    GPTQ : Accurate post-training quantization for generative pre-trained transformers

    Elias Frantar, Saleh Ashkboos, Torsten Hoefler, and Dan Alistarh. GPTQ : Accurate post-training quantization for generative pre-trained transformers. In The Eleventh International Conference on Learning Representations, 2023. URL https://openreview.net/forum?id=tcbBPnfwxS

    2023

  4. [16]

    An invitation to quantum incompatibility

    Teiko Heinosaari, Takayuki Miyadera, and M \'a rio Ziman. An invitation to quantum incompatibility. Journal of Physics A: Mathematical and Theoretical, 49 0 (12): 0 123001, 2016. doi:10.1088/1751-8113/49/12/123001. URL https://doi.org/10.1088/1751-8113/49/12/123001

    2016 doi

  5. [17]

    Probability inequalities for sums of bounded random variables

    Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58 0 (301): 0 13--30, 1963. doi:10.1080/01621459.1963.10500830. URL https://doi.org/10.1080/01621459.1963.10500830

    1963

  6. [18]

    Information-theoretic bounds on quantum advantage in machine learning

    Hsin-Yuan Huang, Richard Kueng, and John Preskill. Information-theoretic bounds on quantum advantage in machine learning. Physical Review Letters, 126 0 (19): 0 190505, 2021. doi:10.1103/PhysRevLett.126.190505. URL https://doi.org/10.1103/PhysRevLett.126.190505

    2021 doi

  7. [19]

    Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R. McClean. Quantum advantage in learning from experiments. Science, 376 0 (6598): 0 1182--1186, 2022. doi:10.1126/sci...

    2022 doi

  8. [20]

    BiLLM : Pushing the limit of post-training quantization for LLMs

    Wei Huang, Yangdong Liu, Haotong Qin, Ying Li, Shiming Zhang, Xianglong Liu, Michele Magno, and Xiaojuan Qi. BiLLM : Pushing the limit of post-training quantization for LLMs . In Proceedings of the 41st International Conference on Machine Learning, volume 235 of Proceedings of...

    2024

  9. [21]

    Binarized neural networks

    Itay Hubara, Matthieu Courbariaux, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio. Binarized neural networks. In Advances in Neural Information Processing Systems 29, pages 4107--4115, 2016. URL https://proceedings.neurips.cc/paper/2016/hash/d8330f857a17c53d217014ee776bfd50-Ab...

    2016

  10. [22]

    Quantization and training of neural networks for efficient integer-arithmetic-only inference

    Benoit Jacob, Skirmantas Kligys, Bo Chen, Menglong Zhu, Matthew Tang, Andrew Howard, Hartwig Adam, and Dmitry Kalenichenko. Quantization and training of neural networks for efficient integer-arithmetic-only inference. In Proceedings of the IEEE/CVF Conference on Computer Visio...

    2018

  11. [23]

    U ber das paulische \

    Pascual Jordan and Eugene Wigner. \"U ber das paulische \"a quivalenzverbot. Zeitschrift f \"u r Physik , 47 0 (9--10): 0 631--651, 1928. doi:10.1007/BF01331938. URL https://doi.org/10.1007/BF01331938

    1928 doi

  12. [24]

    Extremely low bit neural network: Squeeze the last bit out with ADMM

    Cong Leng, Zesheng Dou, Hao Li, Shenghuo Zhu, and Rong Jin. Extremely low bit neural network: Squeeze the last bit out with ADMM . In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, pages 3466--3473, 2018. doi:10.1609/aaai.v32i1.11713. URL https://...

    2018 doi

  13. [25]

    GPTAQ : Efficient finetuning-free quantization for asymmetric calibration

    Yuhang Li, Ruokai Yin, Donghyun Lee, Shiting Xiao, and Priyadarshini Panda. GPTAQ : Efficient finetuning-free quantization for asymmetric calibration. In Proceedings of the 42nd International Conference on Machine Learning, volume 267 of Proceedings of Machine Learning Researc...

    2025

  14. [28]

    AWQ : Activation-aware weight quantization for on-device LLM compression and acceleration

    Ji Lin, Jiaming Tang, Haotian Tang, Shang Yang, Wei-Ming Chen, Wei-Chen Wang, Guangxuan Xiao, Xingyu Dang, Chuang Gan, and Song Han. AWQ : Activation-aware weight quantization for on-device LLM compression and acceleration. In Proceedings of Machine Learning and Systems, volum...

    2024

  15. [31]

    Optimal lower bounds for quantum automata and random access codes

    Ashwin Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pages 369--376. IEEE, 1999. doi:10.1109/SFFCS.1999.814608. URL https://doi.org/10.1109/SFFCS.1999.814608

    1999

  16. [33]

    XNOR-Net : ImageNet classification using binary convolutional neural networks

    Mohammad Rastegari, Vicente Ordonez, Joseph Redmon, and Ali Farhadi. XNOR-Net : ImageNet classification using binary convolutional neural networks. In Computer Vision -- ECCV 2016, volume 9908 of Lecture Notes in Computer Science, pages 525--542. Springer, 2016. doi:10.1007/97...

    2016 doi

  17. [35]

    QuIP \# : Even better LLM quantization with hadamard incoherence and lattice codebooks

    Albert Tseng, Jerry Chee, Qingyao Sun, Volodymyr Kuleshov, and Christopher De Sa. QuIP \# : Even better LLM quantization with hadamard incoherence and lattice codebooks. In Proceedings of the 41st International Conference on Machine Learning, volume 235 of Proceedings of Machi...

    2024

  18. [38]

    OneBit : Towards extremely low-bit large language models

    Yuzhuang Xu, Xu Han, Zonghan Yang, Shuo Wang, Qingfu Zhu, Zhiyuan Liu, Weidong Liu, and Wanxiang Che. OneBit : Towards extremely low-bit large language models. In Advances in Neural Information Processing Systems 37, pages 66357--66382, 2024. doi:10.5555/3737916.3740038. URL h...

    2024

  19. [39]

    PB-LLM : Partially binarized large language models

    Zhihang Yuan, Yuzhang Shang, and Zhen Dong. PB-LLM : Partially binarized large language models. In The Twelfth International Conference on Learning Representations, 2024. URL https://openreview.net/forum?id=BifeBRhikU

    2024

  20. [41]

    Journal of the ACM , volume =

    Dense Quantum Coding and Quantum Finite Automata , author =. Journal of the ACM , volume =. 2002 , doi =

    2002

  21. [42]

    Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS) , pages =

    Optimal Lower Bounds for Quantum Automata and Random Access Codes , author =. Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS) , pages =. 1999 , doi =

    1999

  22. [43]

    arXiv preprint arXiv:0810.2937 , year =

    Quantum Random Access Codes with Shared Randomness , author =. arXiv preprint arXiv:0810.2937 , year =. doi:10.48550/arXiv.0810.2937 , url =

    doi arXiv

  23. [44]

    EPL (Europhysics Letters) , volume =

    Quantum Random Access Codes and Incompatibility of Measurements , author =. EPL (Europhysics Letters) , volume =. 2020 , doi =

    2020

  24. [45]

    Quantum , volume =

    Simple and General Bounds on Quantum Random Access Codes , author =. Quantum , volume =. 2025 , doi =

    2025

  25. [46]

    arXiv preprint arXiv:2506.01903 , year =

    Getting Almost All the Bits from a Quantum Random Access Code , author =. arXiv preprint arXiv:2506.01903 , year =. doi:10.48550/arXiv.2506.01903 , url =

    doi arXiv

  26. [47]

    Journal of Physics A: Mathematical and Theoretical , volume =

    An Invitation to Quantum Incompatibility , author =. Journal of Physics A: Mathematical and Theoretical , volume =. 2016 , doi =

    2016

  27. [48]

    New Journal of Physics , volume =

    Incompatibility Robustness of Quantum Measurements: A Unified Framework , author =. New Journal of Physics , volume =. 2019 , doi =

    2019

  28. [49]

    Physical Review Letters , volume =

    Information-Theoretic Bounds on Quantum Advantage in Machine Learning , author =. Physical Review Letters , volume =. 2021 , doi =

    2021

  29. [50]

    Science , volume =

    Quantum Advantage in Learning from Experiments , author =. Science , volume =. 2022 , doi =

    2022

  30. [51]

    arXiv preprint arXiv:2302.13971 , year =

    Touvron, Hugo and Lavril, Thibaut and Izacard, Gautier and Martinet, Xavier and Lachaux, Marie-Anne and Lacroix, Timoth. arXiv preprint arXiv:2302.13971 , year =. doi:10.48550/arXiv.2302.13971 , url =

    doi arXiv

  31. [52]

    Grattafiori, Aaron and Dubey, Abhimanyu and Jauhri, Abhinav and Pandey, Abhinav and Kadian, Abhishek and Al-Dahle, Ahmad and Letman, Aiesha and Mathur, Akhil and Schelten, Alan and Vaughan, Alex and Yang, Amy and Fan, Angela and Goyal, Anirudh and Hartshorn, Anthony and Yang, ...

    2024 doi arXiv

  32. [53]

    arXiv preprint arXiv:2409.16694 , year =

    A Survey of Low-Bit Large Language Models: Basics, Systems, and Algorithms , author =. arXiv preprint arXiv:2409.16694 , year =. doi:10.48550/arXiv.2409.16694 , url =

    doi

  33. [54]

    2023 , archiveprefix =

    Frantar, Elias and Ashkboos, Saleh and Hoefler, Torsten and Alistarh, Dan , booktitle =. 2023 , archiveprefix =. 2210.17323 , primaryclass =

    2023 arXiv

  34. [55]

    2024 , url =

    Lin, Ji and Tang, Jiaming and Tang, Haotian and Yang, Shang and Chen, Wei-Ming and Wang, Wei-Chen and Xiao, Guangxuan and Dang, Xingyu and Gan, Chuang and Han, Song , booktitle =. 2024 , url =

    2024

  35. [56]

    2023 , url =

    Chee, Jerry and Cai, Yaohui and Kuleshov, Volodymyr and De Sa, Christopher , booktitle =. 2023 , url =

    2023

  36. [57]

    2024 , url =

    Tseng, Albert and Chee, Jerry and Sun, Qingyao and Kuleshov, Volodymyr and De Sa, Christopher , booktitle =. 2024 , url =

    2024

  37. [58]

    and Li, Bo and Cameron, Pashmina and Jaggi, Martin and Alistarh, Dan and Hoefler, Torsten and Hensman, James , booktitle =

    Ashkboos, Saleh and Mohtashami, Amirkeivan and Croci, Maximilian L. and Li, Bo and Cameron, Pashmina and Jaggi, Martin and Alistarh, Dan and Hoefler, Torsten and Hensman, James , booktitle =. 2024 , doi =

    2024

  38. [59]

    Advances in Neural Information Processing Systems 38 , year =

    Quantization Error Propagation: Revisiting Layer-Wise Post-Training Quantization , author =. Advances in Neural Information Processing Systems 38 , year =

  39. [60]

    2025 , url =

    Li, Yuhang and Yin, Ruokai and Lee, Donghyun and Xiao, Shiting and Panda, Priyadarshini , booktitle =. 2025 , url =

    2025

  40. [61]

    2026 , archiveprefix =

    Zhang, Shihao and Zhang, Haoyu and Colbert, Ian and Saab, Rayan , booktitle =. 2026 , archiveprefix =. 2505.11695 , primaryclass =

    2026

  41. [62]

    2025 , archiveprefix =

    Lin, Li and Wan, Xiaojun , journal =. 2025 , archiveprefix =. doi:10.48550/arXiv.2509.06297 , url =. 2509.06297 , primaryclass =

    2025 doi

  42. [63]

    2022 , url =

    Dettmers, Tim and Lewis, Mike and Belkada, Younes and Zettlemoyer, Luke , booktitle =. 2022 , url =

    2022

  43. [64]

    Advances in Neural Information Processing Systems 29 , pages =

    Binarized Neural Networks , author =. Advances in Neural Information Processing Systems 29 , pages =. 2016 , url =

    2016

  44. [65]

    2016 , doi =

    Rastegari, Mohammad and Ordonez, Vicente and Redmon, Joseph and Farhadi, Ali , booktitle =. 2016 , doi =

    2016

  45. [66]

    2023 , archiveprefix =

    Wang, Hongyu and Ma, Shuming and Dong, Li and Huang, Shaohan and Wang, Huaijie and Ma, Lingxiao and Yang, Fan and Wang, Ruiping and Wu, Yi and Wei, Furu , journal =. 2023 , archiveprefix =. doi:10.48550/arXiv.2310.11453 , url =. 2310.11453 , primaryclass =

    2023 doi arXiv

  46. [67]

    The Era of 1-Bit

    Ma, Shuming and Wang, Hongyu and Ma, Lingxiao and Wang, Lei and Wang, Wenhui and Huang, Shaohan and Dong, Li and Wang, Ruiping and Xue, Jilong and Wei, Furu , journal =. The Era of 1-Bit. 2024 , archiveprefix =. doi:10.48550/arXiv.2402.17764 , url =. 2402.17764 , primaryclass =

    2024 doi arXiv

  47. [68]

    2024 , url =

    Huang, Wei and Liu, Yangdong and Qin, Haotong and Li, Ying and Zhang, Shiming and Liu, Xianglong and Magno, Michele and Qi, Xiaojuan , booktitle =. 2024 , url =

    2024

  48. [69]

    2024 , doi =

    Xu, Yuzhuang and Han, Xu and Yang, Zonghan and Wang, Shuo and Zhu, Qingfu and Liu, Zhiyuan and Liu, Weidong and Che, Wanxiang , booktitle =. 2024 , doi =

    2024

  49. [70]

    2024 , archiveprefix =

    Li, Zhiteng and Yan, Xianglong and Zhang, Tianao and Qin, Haotong and Xie, Dong and Tian, Jiang and Shi, Zhongchao and Kong, Linghe and Zhang, Yulun and Yang, Xiaokang , journal =. 2024 , archiveprefix =. doi:10.48550/arXiv.2410.03129 , url =. 2410.03129 , primaryclass =

    2024 doi

  50. [71]

    2024 , archiveprefix =

    Yuan, Zhihang and Shang, Yuzhang and Dong, Zhen , booktitle =. 2024 , archiveprefix =. 2310.00034 , primaryclass =

    2024 arXiv

  51. [72]

    Foundations and Trends in Machine Learning , volume =

    Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , author =. Foundations and Trends in Machine Learning , volume =. 2011 , doi =

    2011

  52. [73]

    Extremely Low Bit Neural Network: Squeeze the Last Bit Out with

    Leng, Cong and Dou, Zesheng and Li, Hao and Zhu, Shenghuo and Jin, Rong , booktitle =. Extremely Low Bit Neural Network: Squeeze the Last Bit Out with. 2018 , doi =

    2018

  53. [74]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages =

    Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference , author =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages =. 2018 , doi =

    2018

  54. [75]

    The Eighth International Conference on Learning Representations , year =

    Learned Step Size Quantization , author =. The Eighth International Conference on Learning Representations , year =

  55. [76]

    2010 , isbn =

    Quantum Computation and Quantum Information: 10th Anniversary Edition , author =. 2010 , isbn =. doi:10.1017/CBO9780511976667 , url =

    2010 doi

  56. [77]

    2018 , isbn =

    The Theory of Quantum Information , author =. 2018 , isbn =. doi:10.1017/9781316848142 , url =

    2018 doi

  57. [78]

    2012 , isbn =

    The Mathematical Language of Quantum Theory: From Uncertainty to Entanglement , author =. 2012 , isbn =. doi:10.1017/CBO9781139031103 , url =

    2012 doi

  58. [79]

    1928 , doi =

    Jordan, Pascual and Wigner, Eugene , journal =. 1928 , doi =

    1928

  59. [80]

    Journal of the American Statistical Association , volume =

    Probability Inequalities for Sums of Bounded Random Variables , author =. Journal of the American Statistical Association , volume =. 1963 , doi =

    1963

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.