Log-Sobolev inequality and proof of Hypothesis of the Gaussian Maximizers for the capacity of quantum noisy homodyning

• URL: http://arxiv.org/abs/2204.10626v3
• Date: Wed, 17 Aug 2022 13:02:20 GMT
• Title: Log-Sobolev inequality and proof of Hypothesis of the Gaussian Maximizers for the capacity of quantum noisy homodyning
• Authors: A. S. Holevo
• Abstract summary: We give proof that the information-transmission capacity of the approximate position measurement with the oscillator energy constraint is attained on Gaussian encoding. We hope that this method should work also for other models lying out of the scope of the "threshold condition" ensuring that the upper bound for the capacity as a difference between the maximum and the minimum output entropies is attainable.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the present paper we give proof that the information-transmission capacity of the approximate position measurement with the oscillator energy constraint, which underlies noisy Gaussian homodyning in quantum optics, is attained on Gaussian encoding. The proof is based on general principles of convex programming. Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality. We hope that this method should work also for other models lying out of the scope of the "threshold condition" ensuring that the upper bound for the capacity as a difference between the maximum and the minimum output entropies is attainable.

Related papers

• Universal coding, intrinsic volumes, and metric complexity [3.4392739159262145]
  We study the sequential probability assignment in the Gaussian setting, where the goal is to predict, or equivalently, a sequence of real-valued observations. As part of our analysis, we also describe the minimax for a general set. We finally relate our findings with classical results in information theory.
  arXiv  Detail & Related papers  (2023-03-13T16:54:04Z)
• Quantization-Based Optimization: Alternative Stochastic Approximation of Global Optimization [0.0]
  We propose a global optimization algorithm based on quantizing the energy level of an objective function in an NP-hard problem. Numerical experiments show that the proposed algorithm outperforms conventional learning methods in solving NP-hard optimization problems.
  arXiv  Detail & Related papers  (2022-11-08T03:01:45Z)
• Proof of the Gaussian maximizers conjecture for the communication capacity of noisy heterodyne measurements [0.0]
  We provide a proof for a conjecture on optimality of Gaussian encondings for the ultimate communication rate. Results generalize previous ones and show a drastic difference in the structure of the optimal encoding.
  arXiv  Detail & Related papers  (2022-06-05T09:13:43Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
  We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation. By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
  arXiv  Detail & Related papers  (2022-03-07T13:27:26Z)
• Stochastic Learning Equation using Monotone Increasing Resolution of Quantization [0.0]
  We show that the learning equation with monotonically increasing quantization resolution converges weakly as the distribution viewpoint. The analysis of this paper shows that global optimization is possible for a domain that satisfies the Lipschitz condition instead of local convergence properties such as the Hessian constraint of the objective function.
  arXiv  Detail & Related papers  (2021-12-24T09:36:50Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• On the classical capacity of quantum Gaussian measurement [0.0]
  We prove Gaussianity of the average state of the optimal ensemble in general. We discuss the Hypothesis of Gaussian Maximizers concerning the structure of the ensemble.
  arXiv  Detail & Related papers  (2021-01-02T11:11:22Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04: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.