Optimal Linear-Rate Conversion of Unknown Mixed Qubit States via SWAP Tests

• URL: http://arxiv.org/abs/2609.17311v1
• Date: Tue, 15 Sep 2026 15:21:03 GMT
• Title: Optimal Linear-Rate Conversion of Unknown Mixed Qubit States via SWAP Tests
• Abstract summary: We determine the maximum linear rate at which qubit states of different purities can be interconverted.<n>The optimal conversion rate is determined by the two eigenvalues of the complex right-logarithmic-derivative (RLD) Fisher information matrix.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: By consuming multiple copies of an unknown qubit state, one can modify its purity while preserving the direction of its Bloch vector. We determine the maximum linear rate at which qubit states of different purities can be interconverted, allowing a nonzero error, quantified, for instance, by the trace distance, provided that it vanishes in the limit of infinitely many copies. Interestingly, the optimal conversion rate is determined by the two eigenvalues of the complex right-logarithmic-derivative (RLD) Fisher information matrix associated with $\mathrm{SU}(2)$ rotations of the qubit state. When the output qubits have higher purity, corresponding to concentration, the optimal rate is given by the ratio of the maximum eigenvalues of the input and output RLD matrices. In contrast, when the output qubits have lower purity, corresponding to dilution, the optimal rate is given by the ratio of their minimum eigenvalues. Remarkably, both concentration and dilution can be implemented using SWAP tests as the only nontrivial two-qubit measurement primitive, together with ancillary qubits initially prepared in maximally mixed states, without requiring any additional two-qubit gates. Our work thus provides a novel operational interpretation of the full complex RLD Fisher information matrix. Crucially, its antisymmetric, purely imaginary part encodes geometric information beyond the statistical distance between density operators and plays an essential role in determining the optimal state-conversion rates.

Related papers

• Overfitting Mitigation via Singular Value Decomposition in Minimum Bayes Risk Decoding [53.9009465845701]
  We introduce SVD-MBR, which frames the pairwise utility matrix as a noisy information signal.<n> Experiments demonstrate that SVD-MBR successfully regularizes decoding, yielding substantial gains across a range of generalized metrics.
  arXiv  Detail & Related papers  (2026-09-01T12:11:29Z)
• LimiX-2M: Mitigating Low-Rank Collapse and Attention Bottlenecks in Tabular Foundation Models [56.999481798138625]
  LimiX-2M is a 2M- parameter model that outperforms larger TabPFN-v2 and TabICL baselines on widely used benchmarks.<n>We present a unified tokenize-and-route framework for strong Tabular foundation models (TFMs)<n>Results highlight value-aware tokenization and readout-aligned routing as key levers for improving the accuracy--efficiency trade-off in TFMs.
  arXiv  Detail & Related papers  (2026-06-03T06:07:33Z)
• WUSH: Near-Optimal Adaptive Transforms for LLM Quantization [52.77441224845925]
  Quantization to low bitwidth is a standard approach for deploying large language models.<n>A few extreme weights and activations stretch the dynamic range and reduce the effective resolution of the quantizer.<n>We derive, for the first time, closed-form optimal linear blockwise transforms for joint weight-activation quantization.
  arXiv  Detail & Related papers  (2025-11-30T16:17:34Z)
• Contrastive Entropy Bounds for Density and Conditional Density Decomposition [6.697324698653934]
  We use Hilbert space and decomposition to address cases where a multiple-output network produces multiple centers defining a Gaussian mixture.<n>We propose an encoder-mixture-decoder architecture whose decoder is multiple-output, producing multiple centers per sample, potentially tightening the bound.
  arXiv  Detail & Related papers  (2025-11-17T02:49:08Z)
• Randomized truncation of quantum states [0.16567880228735354]
  We give efficient algorithms for finding mixtures of sparse states that optimally approximate a given pure state in either trace distance or robustness.<n>These algorithms also yield descriptions of efficiently samplable ensembles of sparse, or less-entangled, states that correspond to these optimal mixed approximations.
  arXiv  Detail & Related papers  (2025-10-09T17:47:07Z)
• Fourier Sliced-Wasserstein Embedding for Multisets and Measures [3.396731589928944]
  We present a novel method to embed multisets and measures over Rd into Euclidean space.<n>We prove that it is impossible to embed distributions over Rd into Euclidean space in a bi-Lipschitz manner.
  arXiv  Detail & Related papers  (2024-05-26T11:04:41Z)
• DB-LLM: Accurate Dual-Binarization for Efficient LLMs [83.70686728471547]
  Large language models (LLMs) have significantly advanced the field of natural language processing. Existing ultra-low-bit quantization always causes severe accuracy drops. We propose a novel Dual-Binarization method for LLMs, namely DB-LLM.
  arXiv  Detail & Related papers  (2024-02-19T09:04:30Z)
• Fast Batch Nuclear-norm Maximization and Minimization for Robust Domain Adaptation [154.2195491708548]
  We study the prediction discriminability and diversity by studying the structure of the classification output matrix of a randomly selected data batch. We propose Batch Nuclear-norm Maximization and Minimization, which performs nuclear-norm on the target output matrix to enhance the target prediction ability. Experiments show that our method could boost the adaptation accuracy and robustness under three typical domain adaptation scenarios.
  arXiv  Detail & Related papers  (2021-07-13T15:08:32Z)
• Range-Net: A High Precision Streaming SVD for Big Data Applications [6.050462414301623]
  In a Big Data setting computing the dominant SVD factors is restrictive due to the main memory requirements. We present Range-Net as an alternative to randomized SVD that satisfies the tail-energy lower bound given by Eckart-Young-Mirsky (EYM) theorem.
  arXiv  Detail & Related papers  (2020-10-27T15:42:59Z)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)

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.