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:2512.15831

Optimization Techniques in Quantum Information

Benjamin Desef

quant-phmath.OCSubmitted Dec 17, 2025• Announced Dec 18, 2025• 1 citation
arXivHTMLPDF

Abstract

This thesis focuses on the intersection of mathematical and computational optimization and quantum information. Main contributions are open-source software code: A hybrid approach mixing "traditional" nonconvex and convex methods can make difficult problems more accessible. A demonstration of how to efficiently implement such an algorithm, avoiding interfacial bottlenecks, is provided, finding optimal protocols to establish entanglement through a lossy channel. The central software package developed addresses polynomial optimization problems. Many problems naturally involve only a polynomial objective and constraint polynomials. Such problems can automatically be cast into semidefinite programs that provide a hierarchy of outer approximations. The resulting problems are often so large and scale so unfavorably with respect to the variable number and degree involved that the boundary of the doable is reached quickly. However, technical progress both in hardware and algorithms has pushed this boundary - but software frameworks for polynomial optimization have not followed in the same manner, often now making them the bottleneck that before was the solver. The package PolynomialOptimization.jl developed during this thesis aims to fill the gap and provide a very resource-efficient intermediate layer together with a wide number of algorithms to reduce the problem size, and naturally supporting complex numbers and semidefinite constraints ubiquitous in quantum information problems. Its application on an entanglement distribution problem is demonstrated, showing that even relaxations with semidefinite matrices of three- and four-digit size can be solved conveniently. Finally, a new way to calculate interior-point barriers for the cone of sums-of-squares matrices in a nearly time-optimal way is developed, whose efficient implementation has the potential of further reducing resource consumption.

DOI
10.18725/OPARU-58732
Comments
PhD Thesis

Related papers

Applications of optimization to factorization ranks and quantum information theory

Sander Gribling

Optimization is a fundamental area in mathematics and computer science, with many real-world applications. In this thesis we study the efficiency with which we can solve certain optimization problems from two different perspectives. Firstly, we study it from the perspective of matrix factorization ranks, which comes with connections to quantum information theory. Secondly, we study it from the perspective of quantum computing. This thesis is accordingly divided into two parts, where we take these perspectives. In the first part of this thesis we study several matrix factorization ranks and their connections to quantum information theory. In Chapter 5, we first give a unified approach to lower bounding matrix factorization ranks, using polynomial optimization techniques. In Chapter 6, we exploit the connection between one particular factorization rank, the completely positive semidefinite rank, and quantum correlations to provide an explicit family of matrices with a large completely positive semidefinite factorization rank. In Chapter 8, we use the same connection to study quantum versions of classical graph parameters from the perspective of polynomial optimization (albeit in noncommutative variables). In Chapter 7 we propose and study a new measure for the amount of entanglement needed to realize quantum correlations. We can approximate this new measure using our approach to matrix factorization ranks, i.e., through polynomial optimization in noncommutative variables. In the second part of this thesis we turn our attention to the question: Can we solve optimization problems faster on a quantum computer? First, in Chapter 10, we look at the problem of evaluating a Boolean function. We give a new semidefinite programming characterization of the minimum number of quantum queries to the input that are needed to determine the corresponding function value. In Chapter 11 we revisit the semidefinite programming problem that plays a crucial role in the rest of the thesis; we provide a quantum algorithm for solving semidefinite programs. Finally, in Chapter 12, we study the general problem of solving convex optimization problems in the oracle model. We provide both upper and lower bounds on the efficiency of various reductions in the quantum setting. In particular, we show that quantum computers are more efficient than classical computers for the task of answering separation queries when access to the convex problem is given through membership queries.

Other publications TiSEM•Aug 2, 2019•2 citations

Techniques For Computing and Approximating Large Optimization Problems in Quantum Information

Ankith Mohan

Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the variable dimensions from dL to NL, where d is the Hilbert space dimension, N is the number of candidate states, and L is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced problem from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures whose associated discrimination problems were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.

•Aug 18, 2026•0 citations

Quantum Information Processing: Theory, Algorithms, and Applications

Mohammad Aamir Sohail

Quantum information processing (QIP) studies the representation, manipulation, and transmission of information using quantum systems. By leveraging counterintuitive quantum phenomena such as superposition and entanglement, QIP enables new paradigms for computation, communication, and learning that can surpass classical limits in certain regimes. Foundational tasks in QIP include quantum data compression, quantum communication, and quantum learning and optimization, which together form the basis for scalable quantum technologies. This thesis develops new frameworks and algorithms at the intersection of quantum information theory, quantum learning, and quantum-inspired modeling. The thesis is organized into three parts. The first part studies quantum compression problems; the second addresses quantum communication; and the third develops quantum learning and optimization frameworks with applications to complex systems. In the first part, a new formulation for lossy quantum-classical source coding, termed rate-channel theory, is introduced, replacing the conventional distortion-based formulation with a posterior-channel-based framework under a block-error criterion. The framework is further generalized to incorporate quantum side information at the decoder. A connection between rate-channel theory and classical rate-distortion theory is also established, showing that optimal rate-distortion performance can be recovered under suitable conditions. These results provide a unified and flexible framework for data compression, which is essential for scalable quantum computing infrastructure, enabling efficient storage of quantum data, such as outputs from quantum sensors (e.g., MRI) and information encoded in photonic systems for satellite and optical communication. In the second part, the problem of computing functions of distributed sources over classical-quantum multiple access channels is studied. A new coding framework is developed that combines algebraic structured codes with unstructured random coding techniques, enabling efficient communication of functions without reconstructing individual sources. The resulting achievable conditions, expressed in terms of single-letter quantum information quantities, strictly enlarge the class of sources for which reliable computation is possible. These results contribute to the theoretical foundations of quantum network communication and are directly relevant to deep-space satellite-based quantum communication, distributed quantum computing, and the design of scalable quantum network infrastructures. In the final part, new approaches to quantum learning and optimization are developed. A geometry-aware quantum optimization framework is proposed based on a novel quantum information metric and an unbiased estimator constructed from single-shot measurements. This leads to an optimization method with constant sample complexity per iteration and provable exponential convergence under mild conditions, while avoiding saddle points and local minima. Such advances are particularly relevant for challenging optimization tasks in quantum sensing and quantum computational modeling of many-body systems. Building on this optimization framework, a Hamiltonian learning approach is introduced to infer interaction structures from time-resolved measurement data, with finite-sample guarantees and polynomial scaling with system size. This framework is further extended to develop a quantum-inspired generative model for gene regulatory network inference, where interactions are encoded as a parameterized Hamiltonian evolving over pseudotime. The proposed methods demonstrate strong performance on synthetic benchmarks and reveal biologically meaningful structures in real-world data, with applications to multi-omics integration, cancer genomics, and systems biology. Overall, this thesis advances the theoretical and algorithmic foundations of quantum information processing, with contributions spanning compression, communication, and learning. These developments support the design of resource-efficient and scalable quantum technologies, enabling applications in quantum sensing, quantum networks, distributed quantum computation, and the modeling of complex physical and biological systems.

•Jan 1, 2026•0 citations

Convex Analysis in Quantum Information

Mark Girard

Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.

•Jan 1, 2017•3 citations

Program compilation for large-scale quantum computers

Giulia Meuli

Practical realizations of quantum computers are poised to deliver outstanding computational capabilities far beyond the reach of any classical supercomputer. While classical systems are reliably implemented using CMOS technology, the fabrication of quantum hardware has not yet reached a commercially viable level of maturity. Nowadays, many different technologies are being developed as competing candidates to build the first error-corrected quantum computer. Among the software resources required to operate such a system, quantum compilers translate a high-level description of a quantum algorithm into low-level, technology-dependent quantum instructions. Many quantum algorithms, including Shor's and Grover's algorithms, require to compute some classical logic functions on the quantum computer. The first part of this thesis deals with the problem of compiling quantum circuits that perform such classical Boolean functions, called oracles, into a fault-tolerant set of instructions. Oracle circuits often demand many resources in terms of the number of qubits and gates. The focus is on compiling quantum circuits starting from multi-level logic networks representing large Boolean functions while minimizing the resource footprint of the obtained quantum circuits. At the same time, the trade-off between memory resources and the number of operations typical of such a compilation process is explored. As part of the effort in reducing the resources required to perform a given quantum program, I also present some quantum circuit optimization techniques. The researched algorithms leverage data structures and techniques borrowed and adapted from classical logic synthesis, e.g., SAT solvers, LUT mapping, and multi-level logic networks. I implemented all the compilation algorithms presented in this thesis as part of open-source projects. In particular, I develop and maintain caterpillar---a C++ header-only library dedicated to the quantum compilation of oracles and quantum memory management. The second part of this thesis describes how to equip quantum programming language compilers with automatic accuracy management. Despite the availability of many of such languages, resource estimation of quantum algorithms does not yet support taking approximation errors into account. This general methodology is applicable to any programming language and I demonstrate its integration into the Q# compiler. The technique consists of providing language support to ease the accuracy-aware programming task. The user can define accuracy parameters that will be automatically optimized according to a constraint and a cost function directly generated from the source code. In the presented practical evaluations, the constraint function is the overall allowed accuracy, while the cost function is application-dependent and related to the number of gates. During the optimization process, such functions are evaluated hundreds of times. For this reason, we extract them as (near-)symbolic expressions, whose evaluation time does not depend on the quantum algorithm size. The algorithms and the methodologies presented in this thesis are part of a widespread effort of the research community to build a complete and efficient software stack to program and control the first practical universal quantum computer.

•Jan 1, 2020•1 citation

QICS: Quantum Information Conic Solver

Kerry He, James Saunderson, Hamza Fawzi

We introduce QICS (Quantum Information Conic Solver), an open-source primal-dual interior point solver fully implemented in Python, which is focused on solving optimization problems arising in quantum information theory. QICS has the ability to solve optimization problems involving the quantum relative entropy, noncommutative perspectives of operator convex functions, and related functions. It also includes an efficient semidefinite programming solver which exploits sparsity, as well as support for Hermitian matrices. QICS is also currently supported by the Python optimization modelling software PICOS. This paper aims to document the implementation details of the algorithm and cone oracles used in QICS, and serve as a reference guide for the software. Additionally, we showcase extensive numerical experiments which demonstrate that QICS outperforms state-of-the-art quantum relative entropy programming solvers, and has comparable performance to state-of-the-art semidefinite programming solvers.

arXiv:2410.17803•Oct 23, 2024•25 citations
This thesis focuses on the intersection of mathematical and computational optimization and quantum information. Main contributions are open-source software code: A hybrid approach mixing "traditional" nonconvex and convex methods can make difficult problems more accessible. A demonstration of how to efficiently implement such an algorithm, avoiding interfacial bottlenecks, is provided, finding optimal protocols to establish entanglement through a lossy channel. The central software package developed addresses polynomial optimization problems. Many problems naturally involve only a polynomial objective and constraint polynomials. Such problems can automatically be cast into semidefinite programs that provide a hierarchy of outer approximations. The resulting problems are often so large and scale so unfavorably with respect to the variable number and degree involved that the boundary of the doable is reached quickly. However, technical progress both in hardware and algorithms has pushed this boundary - but software frameworks for polynomial optimization have not followed in the same manner, often now making them the bottleneck that before was the solver. The package PolynomialOptimization.jl developed during this thesis aims to fill the gap and provide a very resource-efficient intermediate layer together with a wide number of algorithms to reduce the problem size, and naturally supporting complex numbers and semidefinite constraints ubiquitous in quantum information problems. Its application on an entanglement distribution problem is demonstrated, showing that even relaxations with semidefinite matrices of three- and four-digit size can be solved conveniently. Finally, a new way to calculate interior-point barriers for the cone of sums-of-squares matrices in a nearly time-optimal way is developed, whose efficient implementation has the potential of further reducing resource consumption.
Optimization is a fundamental area in mathematics and computer science, with many real-world applications. In this thesis we study the efficiency with which we can solve certain optimization problems from two different perspectives. Firstly, we study it from the perspective of matrix factorization ranks, which comes with connections to quantum information theory. Secondly, we study it from the perspective of quantum computing. This thesis is accordingly divided into two parts, where we take these perspectives. In the first part of this thesis we study several matrix factorization ranks and their connections to quantum information theory. In Chapter 5, we first give a unified approach to lower bounding matrix factorization ranks, using polynomial optimization techniques. In Chapter 6, we exploit the connection between one particular factorization rank, the completely positive semidefinite rank, and quantum correlations to provide an explicit family of matrices with a large completely positive semidefinite factorization rank. In Chapter 8, we use the same connection to study quantum versions of classical graph parameters from the perspective of polynomial optimization (albeit in noncommutative variables). In Chapter 7 we propose and study a new measure for the amount of entanglement needed to realize quantum correlations. We can approximate this new measure using our approach to matrix factorization ranks, i.e., through polynomial optimization in noncommutative variables. In the second part of this thesis we turn our attention to the question: Can we solve optimization problems faster on a quantum computer? First, in Chapter 10, we look at the problem of evaluating a Boolean function. We give a new semidefinite programming characterization of the minimum number of quantum queries to the input that are needed to determine the corresponding function value. In Chapter 11 we revisit the semidefinite programming problem that plays a crucial role in the rest of the thesis; we provide a quantum algorithm for solving semidefinite programs. Finally, in Chapter 12, we study the general problem of solving convex optimization problems in the oracle model. We provide both upper and lower bounds on the efficiency of various reductions in the quantum setting. In particular, we show that quantum computers are more efficient than classical computers for the task of answering separation queries when access to the convex problem is given through membership queries.
Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the variable dimensions from dL to NL, where d is the Hilbert space dimension, N is the number of candidate states, and L is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced problem from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures whose associated discrimination problems were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.
Quantum information processing (QIP) studies the representation, manipulation, and transmission of information using quantum systems. By leveraging counterintuitive quantum phenomena such as superposition and entanglement, QIP enables new paradigms for computation, communication, and learning that can surpass classical limits in certain regimes. Foundational tasks in QIP include quantum data compression, quantum communication, and quantum learning and optimization, which together form the basis for scalable quantum technologies. This thesis develops new frameworks and algorithms at the intersection of quantum information theory, quantum learning, and quantum-inspired modeling. The thesis is organized into three parts. The first part studies quantum compression problems; the second addresses quantum communication; and the third develops quantum learning and optimization frameworks with applications to complex systems. In the first part, a new formulation for lossy quantum-classical source coding, termed rate-channel theory, is introduced, replacing the conventional distortion-based formulation with a posterior-channel-based framework under a block-error criterion. The framework is further generalized to incorporate quantum side information at the decoder. A connection between rate-channel theory and classical rate-distortion theory is also established, showing that optimal rate-distortion performance can be recovered under suitable conditions. These results provide a unified and flexible framework for data compression, which is essential for scalable quantum computing infrastructure, enabling efficient storage of quantum data, such as outputs from quantum sensors (e.g., MRI) and information encoded in photonic systems for satellite and optical communication. In the second part, the problem of computing functions of distributed sources over classical-quantum multiple access channels is studied. A new coding framework is developed that combines algebraic structured codes with unstructured random coding techniques, enabling efficient communication of functions without reconstructing individual sources. The resulting achievable conditions, expressed in terms of single-letter quantum information quantities, strictly enlarge the class of sources for which reliable computation is possible. These results contribute to the theoretical foundations of quantum network communication and are directly relevant to deep-space satellite-based quantum communication, distributed quantum computing, and the design of scalable quantum network infrastructures. In the final part, new approaches to quantum learning and optimization are developed. A geometry-aware quantum optimization framework is proposed based on a novel quantum information metric and an unbiased estimator constructed from single-shot measurements. This leads to an optimization method with constant sample complexity per iteration and provable exponential convergence under mild conditions, while avoiding saddle points and local minima. Such advances are particularly relevant for challenging optimization tasks in quantum sensing and quantum computational modeling of many-body systems. Building on this optimization framework, a Hamiltonian learning approach is introduced to infer interaction structures from time-resolved measurement data, with finite-sample guarantees and polynomial scaling with system size. This framework is further extended to develop a quantum-inspired generative model for gene regulatory network inference, where interactions are encoded as a parameterized Hamiltonian evolving over pseudotime. The proposed methods demonstrate strong performance on synthetic benchmarks and reveal biologically meaningful structures in real-world data, with applications to multi-omics integration, cancer genomics, and systems biology. Overall, this thesis advances the theoretical and algorithmic foundations of quantum information processing, with contributions spanning compression, communication, and learning. These developments support the design of resource-efficient and scalable quantum technologies, enabling applications in quantum sensing, quantum networks, distributed quantum computation, and the modeling of complex physical and biological systems.
Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.
Practical realizations of quantum computers are poised to deliver outstanding computational capabilities far beyond the reach of any classical supercomputer. While classical systems are reliably implemented using CMOS technology, the fabrication of quantum hardware has not yet reached a commercially viable level of maturity. Nowadays, many different technologies are being developed as competing candidates to build the first error-corrected quantum computer. Among the software resources required to operate such a system, quantum compilers translate a high-level description of a quantum algorithm into low-level, technology-dependent quantum instructions. Many quantum algorithms, including Shor's and Grover's algorithms, require to compute some classical logic functions on the quantum computer. The first part of this thesis deals with the problem of compiling quantum circuits that perform such classical Boolean functions, called oracles, into a fault-tolerant set of instructions. Oracle circuits often demand many resources in terms of the number of qubits and gates. The focus is on compiling quantum circuits starting from multi-level logic networks representing large Boolean functions while minimizing the resource footprint of the obtained quantum circuits. At the same time, the trade-off between memory resources and the number of operations typical of such a compilation process is explored. As part of the effort in reducing the resources required to perform a given quantum program, I also present some quantum circuit optimization techniques. The researched algorithms leverage data structures and techniques borrowed and adapted from classical logic synthesis, e.g., SAT solvers, LUT mapping, and multi-level logic networks. I implemented all the compilation algorithms presented in this thesis as part of open-source projects. In particular, I develop and maintain caterpillar---a C++ header-only library dedicated to the quantum compilation of oracles and quantum memory management. The second part of this thesis describes how to equip quantum programming language compilers with automatic accuracy management. Despite the availability of many of such languages, resource estimation of quantum algorithms does not yet support taking approximation errors into account. This general methodology is applicable to any programming language and I demonstrate its integration into the Q# compiler. The technique consists of providing language support to ease the accuracy-aware programming task. The user can define accuracy parameters that will be automatically optimized according to a constraint and a cost function directly generated from the source code. In the presented practical evaluations, the constraint function is the overall allowed accuracy, while the cost function is application-dependent and related to the number of gates. During the optimization process, such functions are evaluated hundreds of times. For this reason, we extract them as (near-)symbolic expressions, whose evaluation time does not depend on the quantum algorithm size. The algorithms and the methodologies presented in this thesis are part of a widespread effort of the research community to build a complete and efficient software stack to program and control the first practical universal quantum computer.
We introduce QICS (Quantum Information Conic Solver), an open-source primal-dual interior point solver fully implemented in Python, which is focused on solving optimization problems arising in quantum information theory. QICS has the ability to solve optimization problems involving the quantum relative entropy, noncommutative perspectives of operator convex functions, and related functions. It also includes an efficient semidefinite programming solver which exploits sparsity, as well as support for Hermitian matrices. QICS is also currently supported by the Python optimization modelling software PICOS. This paper aims to document the implementation details of the algorithm and cone oracles used in QICS, and serve as a reference guide for the software. Additionally, we showcase extensive numerical experiments which demonstrate that QICS outperforms state-of-the-art quantum relative entropy programming solvers, and has comparable performance to state-of-the-art semidefinite programming solvers.