Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck
- URL: http://arxiv.org/abs/2311.11188v2
- Date: Fri, 12 Jan 2024 05:31:16 GMT
- Title: Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck
- Authors: Masahito Hayashi and Geng Liu
- Abstract summary: We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
- Score: 55.22418739014892
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
(IEEE Trans. IT, 67, 946 (2021)) to a function defined over a set of density
matrices with linear constraints so that our algorithm can be applied to
optimizations of quantum operations. This algorithm has wider applicability.
Hence, we apply our algorithm to the quantum information bottleneck with three
quantum systems, which can be used for quantum learning. We numerically compare
our obtained algorithm with the existing algorithm by Grimsmo and Still (Phys.
Rev. A, 94, 012338 (2016)). Our numerical analysis shows that our algorithm is
better than their algorithm.
Related papers
- The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications [8.8400072344375]
We propose two quantum algorithms for solving quantum linear systems of equations with coherent superposition.
The two quantum algorithms can both compute the rank and general solution by one measurement.
Our analysis indicates that the proposed algorithms are mainly suitable for conducting attacks against lightweight symmetric ciphers.
arXiv Detail & Related papers (2024-05-11T03:03:14Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Iterative Quantum Algorithms for Maximum Independent Set: A Tale of
Low-Depth Quantum Algorithms [0.0]
We study a new class of hybrid approaches to quantum optimization, termed Iterative Maximum Quantum Algorithms.
We show that for QAOA with depth $p=1$, this algorithm performs exactly the same operations and selections as the classical greedy algorithm for MIS.
arXiv Detail & Related papers (2023-09-22T18:00:03Z) - Limitations for Quantum Algorithms to Solve Turbulent and Chaotic
Systems [0.5735035463793008]
We investigate the limitations of quantum computers for solving nonlinear dynamical systems.
We provide a significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector.
arXiv Detail & Related papers (2023-07-13T11:06:02Z) - Quantum speedup of leverage score sampling and its application [0.0]
In this paper, we propose a quantum algorithm to accelerate the computation of leverage scores.
As an application, we propose a new quantum algorithm for rigid regression problems with vector solution outputs.
arXiv Detail & Related papers (2023-01-15T14:40:18Z) - Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms.
We exploit quantum phenomena to speed up the computation of distances.
We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum Algorithm For Estimating Eigenvalue [0.0]
We provide a quantum algorithm for estimating the largest eigenvalue in magnitude of a given Hermitian matrix.
Our quantum procedure can also yield exponential speedup compared to classical algorithms that solve the same problem.
arXiv Detail & Related papers (2022-11-11T13:02:07Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35: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.