An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles

• URL: http://arxiv.org/abs/2607.01564v1
• Date: Thu, 02 Jul 2026 00:45:51 GMT
• Title: An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles
• Abstract summary: Optimal encoding of classical data for quantum-assisted statistical inference is investigated from an information-theoretic perspective.<n>We prove that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding.<n>This demonstrates that the maximal quantum leakage is a universal measure of the quality of the encoding strategy for statistical inference.
• Score: 5.1835624626471875
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimal encoding of classical data for quantum-assisted statistical inference is investigated from an information-theoretic perspective. We prove that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding, establishing leakage as a universal, task-agnostic quality measure for encoders. This demonstrates that the maximal quantum leakage is a universal measure of the quality of the encoding strategy for statistical inference as it only depends on the quantum encoding of the data and not the inference task itself. The optimal universal encoding strategy, i.e., an encoding strategy that maximizes the maximal quantum leakage, is proved to be attained by pure states. When there are enough qubits, basis encoding is proved to be universally optimal. However, when the dimension of the system is small, phase encoding is optimal. For the latter, any tight frame, any ensemble whose average state is the maximally mixed state, is in fact optimal. Within tight frames, equiangular tight frames (ETFs) are distinguished as the uniquely symmetric optimal encodings, i.e., they saturate the Welch lower bound on pairwise overlaps and possess a self-referential optimal measurement. Prominent special cases are the qubit trine, the regular simplex, and symmetric informationally complete positive operator-valued measures (SIC-POVMs), for which the ETF structure and explicit codeword constructions are provided. Numerical examples are presented to validate the theoretical predictions.

Related papers

• Toward the Goldilocks blind compression of quantum states [5.077782193180541]
  We study blind single-copy compression of quantum states through a $k$-qubit bottleneck.<n>We prove that for every distribution of pure $n$-qubit states, there exists a QAE with exactly $k$ encoder ancillas and $n$ decoder ancillas.
  arXiv  Detail & Related papers  (2026-05-02T05:29:48Z)
• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Efficient and optimal quantum state discrimination via quantum belief propagation [6.445605125467573]
  We present an efficient quantum algorithm for a structured state discrimination problem we call the subspace decoding task.<n>We show that the algorithm enables efficient and optimal decoding of certain families of structured classical linear codes transmitted over binary-input classical-quantum pure-state channels.
  arXiv  Detail & Related papers  (2025-09-23T18:00:07Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Optimal Universal Quantum Encoding for Statistical Inference [9.244521717083696]
  A universal encoder is sought that is optimal for a wide array of statistical inference tasks. An iterative method for computing the optimal universal encoding strategy is presented.
  arXiv  Detail & Related papers  (2024-04-12T00:39:53Z)
• Optimal Generators for Quantum Sensing [0.0]
  We show that the maximal sensitivity using a given quantum state is determined by the largest eigenvalue of the quantum Fisher information matrix (QFIM) Since we optimize the process of parameter encoding rather than focusing on state preparation protocols, our scheme is relevant for any quantum sensor.
  arXiv  Detail & Related papers  (2023-05-24T20:42:38Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
  We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer. We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
  arXiv  Detail & Related papers  (2021-12-12T06:01:10Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.