Semidefinite optimization of the quantum relative entropy of channels

• URL: http://arxiv.org/abs/2410.16362v1
• Date: Mon, 21 Oct 2024 18:00:01 GMT
• Title: Semidefinite optimization of the quantum relative entropy of channels
• Authors: Gereon Koßmann, Mark M. Wilde,
• Abstract summary: This paper introduces a method for calculating the quantum relative entropy of channels. It provides efficiently computable upper and lower bounds that sandwich the true value with any desired precision.
• Score: 3.9134031118910264
• License:
• Abstract: This paper introduces a method for calculating the quantum relative entropy of channels, an essential quantity in quantum channel discrimination and resource theories of quantum channels. By building on recent developments in the optimization of relative entropy for quantum states [Kossmann and Schwonnek, arXiv:2404.17016], we introduce a discretized linearization of the integral representation for the relative entropy for states, enabling us to handle maximization tasks of the relative entropy of a channel over input states. Our approach here extends previous work on minimizing relative entropy to the more complicated domain of maximization. It also provides efficiently computable upper and lower bounds that sandwich the true value with any desired precision, leading to a practical method for computing the relative entropy of channels.

Related papers

• Generalized quantum asymptotic equipartition [11.59751616011475]
  We prove that all operationally relevant divergences converge to the quantum relative entropy between two sets of quantum states. In particular, both the smoothed min-relative entropy between two sequential processes of quantum channels can be lower bounded by the sum of the regularized minimum output channel divergences. We apply our generalized AEP to quantum resource theories and provide improved and efficient bounds for entanglement distillation, magic state distillation, and the entanglement cost of quantum states and channels.
  arXiv  Detail & Related papers  (2024-11-06T16:33:16Z)
• Exploiting Structure in Quantum Relative Entropy Programs [6.281229317487581]
  We show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• Semi-definite optimization of the measured relative entropies of quantum states and channels [3.9134031118910264]
  We show that measured relative entropies of quantum states and channels can be calculated efficiently by means of semi-definite programming. Not only do the programs output the optimal values of the measured relative entropies of states and channels, but they also provide numerical characterizations of optimal strategies for achieving them.
  arXiv  Detail & Related papers  (2024-06-27T10:20:56Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions [0.0]
  We present an information geometric characterization of quantum driving schemes specified by su (2;C) time-dependent Hamiltonians. We evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency.
  arXiv  Detail & Related papers  (2021-07-23T16:18:11Z)
• Optimized quantum f-divergences [6.345523830122166]
  I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality. One benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for the Petz--Renyi and sandwiched Renyi relative entropies.
  arXiv  Detail & Related papers  (2021-03-31T04:15:52Z)

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.