Optimal Universal Quantum Encoding for Statistical Inference
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning
Efficient quantum compiling tactics greatly enhance the capability of quantum computers to execute complicated quantum algorithms. Due to its fundamental importance, a plethora of quantum compilers has been designed in p…
Deep Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning (RL)Benchmarking data encoding methods in Quantum Machine Learning
Data encoding plays a fundamental and distinctive role in Quantum Machine Learning (QML). While classical approaches process data directly as vectors, QML may require transforming classical data into quantum states throu…
BenchmarkingQuantum Machine LearningThe effect of data encoding on the expressive power of variational quantum machine learning models
Quantum computers can be used for supervised learning by treating parametrised quantum circuits as models that map data inputs to predictions. While a lot of work has been done to investigate practical implications of th…
BIG-bench Machine LearningQuantum Machine LearningRe-uploading quantum data: a universal function approximator for quantum inputs
Quantum data re-uploading has proved powerful for classical inputs, where repeatedly encoding features into a small circuit yields universal function approximation. Extending this idea to quantum inputs remains underexpl…
Quantum Machine LearningEncoding-dependent generalization bounds for parametrized quantum circuits
A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical…
Generalization BoundsLearning TheoryModel Selection