Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1906.00037 · Numerical Algebra Control and Optimization

Long-step path-following algorithm for quantum information theory: Some numerical aspects and applications

Leonid E. Faybusovich, Cunlu Zhou

Published Jun 4, 2021• 7 citations
arXivHTMLPDF

Abstract

We consider some important computational aspects of the long-step path-following algorithm developed in our previous work and show that a broad class of complicated optimization problems arising in quantum information theory can be solved using this approach. In particular, we consider one difficult optimization problem involving the quantum relative entropy in quantum key distribution and show that our method can solve problems of this type much faster in comparison with (very few) available options.

DOI
10.3934/naco.2021017

Related papers

On Implementation of Long-Step Path-Following Algorithms for Convex Optimization Problems in Quantum Information Theory

Leonid E. Faybusovich, Cunlu Zhou

•May 31, 2019•0 citations

A random walk approach to quantum algorithms

Viv M. Kendon

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.

arXiv:quant-ph/0609035•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 18, 2006•112 citations

Entropy, Optimization and Coding Theory

Cunlu Zhou

Entropy is a central concept in many different disciplines, and many important applications involving entropy can be viewed as entropy optimization problems. In this dissertation we study a class of symmetric (conic) programming problems with nonlinear convex objective functions in the context of Euclidean Jordan algebras, which includes the so-called quantum (von Neumann) entropy optimization as a special case. Quantum entropy optimization plays an important role in many areas such as quantum computing, quantum information theory, machine learning, etc. We develop a long-step path-following algorithm for such optimization problems. The theoretical framework is developed for functions compatible (in the sense of Nesterov and Nemirovski) with the standard barrier function - lndet(x). Complexity estimates similar to the case of a linear-quadratic objective function are established, and the theoretical scheme is implemented for the quantum entropy optimization problem. The Shannon entropy optimization problem can be viewed as a special case of the quantum entropy optimization problem with diagonal matrices. We briefly discuss one application of the Shannon entropy optimization in coding theory, namely evaluating the asymptotic pseudoweight enumerators for protograph-based low-density parity-check (LDPC) codes. In the end we also briefly discuss some future work related to quantum relative entropy optimization.

•Jan 1, 2019•1 citation

Progress and Prospects of Quantum Algorithms

Hang Yang, Bi Wu, Yongbo Xuan +2 more

Quantum computers are designed to outperform standard computers by running quantum algorithms. Fields in which quantum algorithms can be applied include cryptography, search and optimization, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We focus to introduce the development of entire field, and provide a comprehensive and accurate understanding concerning this field, which may be helpful for interested researchers in this area.

World Symposium on Software Engineering (WSSE)•Sep 28, 2022•2 citations

Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems

Kerry He, James Saunderson, Hamza Fawzi

Abstract Quantum relative entropy optimization refers to a class of convex problems in which a linear functional is minimized over an affine section of the epigraph of the quantum relative entropy function. Recently, the self-concordance of a natural barrier function was proved for this set, and various implementations of interior-point methods have been made available to solve this class of optimization problems. In this paper, we show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems using interior-point methods. First, we show that the natural barrier function for the epigraph of the quantum relative entropy composed with positive linear operators is self-concordant, even when these linear operators map to singular matrices. Compared to modeling problems using the full quantum relative entropy cone, this allows us to remove redundant log-determinant expressions from the barrier function and reduce the overall barrier parameter. Second, we show how certain slices of the quantum relative entropy cone exhibit useful properties which should be exploited whenever possible to perform certain key steps of interior-point methods more efficiently. We demonstrate how these methods can be applied to applications in quantum information theory, including quantifying quantum key rates, quantum rate-distortion functions, quantum channel capacities, and the ground state energy of Hamiltonians. 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:2407.00241•Mathematical Programming Computation•Nov 17, 2025•17 citations

Solving a problem in the quantum way

M.P. John

A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than existing classical algorithms or quantum algorithm, which requires O(sqrt(N)) steps.

arXiv:quant-ph/0301153•Jan 28, 2003•0 citations
We consider some important computational aspects of the long-step path-following algorithm developed in our previous work and show that a broad class of complicated optimization problems arising in quantum information theory can be solved using this approach. In particular, we consider one difficult optimization problem involving the quantum relative entropy in quantum key distribution and show that our method can solve problems of this type much faster in comparison with (very few) available options.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.
Entropy is a central concept in many different disciplines, and many important applications involving entropy can be viewed as entropy optimization problems. In this dissertation we study a class of symmetric (conic) programming problems with nonlinear convex objective functions in the context of Euclidean Jordan algebras, which includes the so-called quantum (von Neumann) entropy optimization as a special case. Quantum entropy optimization plays an important role in many areas such as quantum computing, quantum information theory, machine learning, etc. We develop a long-step path-following algorithm for such optimization problems. The theoretical framework is developed for functions compatible (in the sense of Nesterov and Nemirovski) with the standard barrier function - lndet(x). Complexity estimates similar to the case of a linear-quadratic objective function are established, and the theoretical scheme is implemented for the quantum entropy optimization problem. The Shannon entropy optimization problem can be viewed as a special case of the quantum entropy optimization problem with diagonal matrices. We briefly discuss one application of the Shannon entropy optimization in coding theory, namely evaluating the asymptotic pseudoweight enumerators for protograph-based low-density parity-check (LDPC) codes. In the end we also briefly discuss some future work related to quantum relative entropy optimization.
Quantum computers are designed to outperform standard computers by running quantum algorithms. Fields in which quantum algorithms can be applied include cryptography, search and optimization, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We focus to introduce the development of entire field, and provide a comprehensive and accurate understanding concerning this field, which may be helpful for interested researchers in this area.
Abstract Quantum relative entropy optimization refers to a class of convex problems in which a linear functional is minimized over an affine section of the epigraph of the quantum relative entropy function. Recently, the self-concordance of a natural barrier function was proved for this set, and various implementations of interior-point methods have been made available to solve this class of optimization problems. In this paper, we show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems using interior-point methods. First, we show that the natural barrier function for the epigraph of the quantum relative entropy composed with positive linear operators is self-concordant, even when these linear operators map to singular matrices. Compared to modeling problems using the full quantum relative entropy cone, this allows us to remove redundant log-determinant expressions from the barrier function and reduce the overall barrier parameter. Second, we show how certain slices of the quantum relative entropy cone exhibit useful properties which should be exploited whenever possible to perform certain key steps of interior-point methods more efficiently. We demonstrate how these methods can be applied to applications in quantum information theory, including quantifying quantum key rates, quantum rate-distortion functions, quantum channel capacities, and the ground state energy of Hamiltonians. 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.