Optimal Universal Quantum Encoding for Statistical Inference

• URL: http://arxiv.org/abs/2404.08172v1
• Date: Fri, 12 Apr 2024 00:39:53 GMT
• Title: Optimal Universal Quantum Encoding for Statistical Inference
• Abstract summary: 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.
• Score: 9.244521717083696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Optimal encoding of classical data for statistical inference using quantum computing is investigated. A universal encoder is sought that is optimal for a wide array of statistical inference tasks. Accuracy of any statistical inference is shown to be upper bounded by a term that is proportional to maximal quantum leakage from the classical data, i.e., the input to the inference model, through its quantum encoding. 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., the 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. An iterative method for numerically computing the optimal universal encoding strategy is presented.

Related papers

• An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles [5.1835624626471875]
  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.
  arXiv  Detail & Related papers  (2026-07-02T00:45:51Z)
• 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)
• 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)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Limitations of Amplitude Encoding on Quantum Classification [4.554538985220175]
  It remains unclear whether quantum machine learning (QML) has real advantages when dealing with practical and meaningful tasks. Amplitude encoding has been widely used owing to its remarkable efficiency in encoding a number of $2n$ classical data into $n$ qubits simultaneously. We show that the average of encoded quantum states via amplitude encoding tends to concentrate towards a specific state.
  arXiv  Detail & Related papers  (2025-03-03T13:52:47Z)
• Quantum superposing algorithm for quantum encoding [5.484168968324708]
  We present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance. Notably, our algorithm has a maximum of 2n-3 controlled-not (CNOT) counts, representing the most optimized result to date.
  arXiv  Detail & Related papers  (2024-09-29T00:49:21Z)
• Empirical Power of Quantum Encoding Methods for Binary Classification [0.2118773996967412]
  We will focus on encoding schemes and their effects on various machine learning metrics. Specifically, we focus on real-world data encoding to demonstrate differences between quantum encoding strategies for several real-world datasets.
  arXiv  Detail & Related papers  (2024-08-23T14:34:57Z)
• Optimization by Decoded Quantum Interferometry [43.55132675053983]
  We introduce a quantum algorithm called Decoded Quantum Interferometry (DQI) For approximating optimal fits to data over finite fields, DQI achieves a better approximation ratio than any time known to us. We demonstrate this by benchmarking on an instance with over 30,000 variables.
  arXiv  Detail & Related papers  (2024-08-15T17:47:42Z)
• Recursive Quantum Relaxation for Combinatorial Optimization Problems [3.3053321430025258]
  We show that some existing quantum optimization methods can be unified into a solver that finds the binary solution that is most likely measured from the optimal quantum state. Experiments on standard benchmark graphs with several hundred nodes in the MAX-CUT problem, conducted in a fully classical manner using a tensor network technique, show that RQRAO outperforms the Goemans--Williamson method and is comparable to state-of-the-art classical solvers.
  arXiv  Detail & Related papers  (2024-03-04T13:48:21Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Concentration of Data Encoding in Parameterized Quantum Circuits [7.534037755267707]
  Variational quantum algorithms have been acknowledged as a leading strategy to realize near-term quantum advantages in meaningful tasks. In this paper, we make progress by considering the common data encoding strategies based on parameterized quantum circuits. We prove that, under reasonable assumptions, the distance between the average encoded state and the maximally mixed state could be explicitly upper-bounded.
  arXiv  Detail & Related papers  (2022-06-16T16:09:40Z)
• 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)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.