We determine the minimal experimental resources that ensure a unique solution in the estimation of trace-preserving quantum channels with both direct and convex optimization methods. A convenient parametrization of the constrained set is used to develop a globally converging Newton-type algorithm that ensures a physically admissible solution to the problem. Numerical simulations are provided to support the results, and indicate that the minimal experimental setting is sufficient to guarantee good estimates.We determine the minimal experimental resources that ensure a unique solution in the estimation of trace-preserving quantum channels with both direct and convex optimization methods. A convenient parametrization of the constrained set is used to develop a globally converging Newton-type algorithm that ensures a physically admissible solution to the problem. Numerical simulations are provided to support the results, and indicate that the minimal experimental setting is sufficient to guarantee good estimates.

IEEE Conference on Decision and Control (CDC)Dec 1, 20124 citations

Convex Optimization-Based Parameter Estimation and Experiment Design for Pauli Channels

Gábor Balló, Katalin Mária Hangos, D�nes Petz

In this technical note, we study the problem of parameter estimation for quantum channels, which are (completely positive) maps acting on quantum states. We focus on an important subclass of channels called Pauli channels which are characterized by a certain set of vectors (directions) and a number of scalar parameters. For the case where the directions are known, a special parametrization turns the parameter estimation problem into a convex optimization problem. For the case of unknown directions we give a simple algorithm to estimate the directions for qubit Pauli channels. These results assume that the identification experiment configuration is given, namely, a set of quantum states are given on which the channel acts, and a set of positive measurement (operator)s are fixed from which information is gathered. In the second part of the technical note we consider the problem of determining the experiment design, namely, determining states and measurements for optimal parameter identification of the channels. We formalize this problem as a maximization problem for Fisher information and, assuming known channel directions, prove that this problem is convex. We also prove that the optimal states to be used in experiments are pure and the optimal measurements are extremal. For qubit Pauli channels we prove that both the optimal pure input states and projective measurements should be directed towards the channel directions. We illustrate the results of the technical note with numerical examples and simulations.In this technical note, we study the problem of parameter estimation for quantum channels, which are (completely positive) maps acting on quantum states. We focus on an important subclass of channels called Pauli channels which are characterized by a certain set of vectors (directions) and a number of scalar parameters. For the case where the directions are known, a special parametrization turns the parameter estimation problem into a convex optimization problem. For the case of unknown directions we give a simple algorithm to estimate the directions for qubit Pauli channels. These results assume that the identification experiment configuration is given, namely, a set of quantum states are given on which the channel acts, and a set of positive measurement (operator)s are fixed from which information is gathered. In the second part of the technical note we consider the problem of determining the experiment design, namely, determining states and measurements for optimal parameter identification of the channels. We formalize this problem as a maximization problem for Fisher information and, assuming known channel directions, prove that this problem is convex. We also prove that the optimal states to be used in experiments are pure and the optimal measurements are extremal. For qubit Pauli channels we prove that both the optimal pure input states and projective measurements should be directed towards the channel directions. We illustrate the results of the technical note with numerical examples and simulations.

IEEE Transactions on Automatic ControlJul 19, 201210 citations

Minimum Relative Entropy for Quantum Estimation: Feasibility and General Solution

Mattia Zorzi, Francesco Ticozzi, Augusto Ferrante

We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data, find the maximal common kernel of all admissible states and, whenever necessary, to relax the constraints in order to allow for a physically admissible solution. Building on these results, the variational analysis can be completed ensuring existence and uniqueness of the optimum. The latter can then be computed by efficient standard algorithms for convex optimization, without resorting to approximate methods or restrictive assumptions on its rank.We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data, find the maximal common kernel of all admissible states and, whenever necessary, to relax the constraints in order to allow for a physically admissible solution. Building on these results, the variational analysis can be completed ensuring existence and uniqueness of the optimum. The latter can then be computed by efficient standard algorithms for convex optimization, without resorting to approximate methods or restrictive assumptions on its rank.

arXiv:1301.6658IEEE Transactions on Information TheoryOct 17, 201315 citations

Experiment design and parameter estimation of Pauli channels using convex optimization

Gábor Balló, Katalin Mária Hangos

A unified framework is proposed in this paper for parameter estimation using convex optimization and experiment design applying convex maximization for Pauli channels, that can be extended to generalized Pauli channels, too. In the case of known channel directions, an affine parametrization of the Choi matrix turns the LS parameter estimation into a convex optimization problem also for the generalized Pauli channels. A simple iterative algorithm for estimating the channel directions is also given for qubit Pauli channels. The experiment design was performed by maximizing the trace of the Fisher information matrix of the output quantum system to find optimal input state and measurement POVM for the channel estimation. For the known channel direction case it was found that the optimal input state should be pure and the optimal measurement POVM is extremal. It was also shown that both the input state and the POVM elements in the optimal configuration should be parallel to the channel directions in the qubit Pauli channel case. The proposed methods and algorithms are illustrated by simple numerical examples.A unified framework is proposed in this paper for parameter estimation using convex optimization and experiment design applying convex maximization for Pauli channels, that can be extended to generalized Pauli channels, too. In the case of known channel directions, an affine parametrization of the Choi matrix turns the LS parameter estimation into a convex optimization problem also for the generalized Pauli channels. A simple iterative algorithm for estimating the channel directions is also given for qubit Pauli channels. The experiment design was performed by maximizing the trace of the Fisher information matrix of the output quantum system to find optimal input state and measurement POVM for the channel estimation. For the known channel direction case it was found that the optimal input state should be pure and the optimal measurement POVM is extremal. It was also shown that both the input state and the POVM elements in the optimal configuration should be parallel to the channel directions in the qubit Pauli channel case. The proposed methods and algorithms are illustrated by simple numerical examples.

arXiv:1107.0890Jul 5, 20113 citations

Parameter estimation of quantum processes using convex optimization

Gábor Balló, Katalin Mária Hangos

A convex optimization based method is proposed for quantum process tomography, in the case of known channel model structure, but unknown channel parameters. The main idea is to select an affine parametrization of the Choi matrix as a set of optimization variables, and formulate a semidefinite programming problem with a least squares objective function. Possible convex relations between the optimization variables are also taken into account to improve the estimation. Simulation case studies show, that the proposed method can significantly increase the accuracy of the parameter estimation, if the channel model structure is known. Beside the convex part, the determination of the channel parameters from the optimization variables is a nonconvex step in general. In the case of Pauli channels however, the method reduces to a purely convex optimization problem, allowing to obtain a globally optimal solution.A convex optimization based method is proposed for quantum process tomography, in the case of known channel model structure, but unknown channel parameters. The main idea is to select an affine parametrization of the Choi matrix as a set of optimization variables, and formulate a semidefinite programming problem with a least squares objective function. Possible convex relations between the optimization variables are also taken into account to improve the estimation. Simulation case studies show, that the proposed method can significantly increase the accuracy of the parameter estimation, if the channel model structure is known. Beside the convex part, the determination of the channel parameters from the optimization variables is a nonconvex step in general. In the case of Pauli channels however, the method reduces to a purely convex optimization problem, allowing to obtain a globally optimal solution.

arXiv:1004.5209Apr 29, 20104 citations

Optimal convex approximation of quantum channels based on $α$ -affinityOptimal convex approximation of quantum channels based on $α$-affinity

Liqiang Zhang, Chengling Fu, Liuyong Cheng +2 more

Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum $α$ -affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum $α$-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.

quant-pharXiv:2606.05745Jun 5, 20260 citations

Optimal convex approximation of quantum channels based on

α

-affinity

α

-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.