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

IEEE Conference on Decision and Control (CDC)

Estimation of quantum channels: Identifiability and ML methods

Mattia Zorzi, Francesco Ticozzi, Augusto Ferrante

Published Dec 1, 2012• 4 citations
Publisher

Abstract

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.

DOI
10.1109/cdc.2012.6426789

Related papers

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.

IEEE Transactions on Automatic Control•Jul 19, 2012•10 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.

arXiv:1301.6658•IEEE Transactions on Information Theory•Oct 17, 2013•16 citations

Local solutions of maximum likelihood estimation in quantum state tomography

Douglas Soares Gonçalves, Márcia A. Gomes-Ruggiero, Carlile Lavor +2 more

Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.

arXiv:1103.3682•Quantum Information and Computation•Sep 1, 2012•14 citations

Certifying optimality for convex quantum channel optimization problems

Bryan Coutts, Mark Girard, John Watrous

We identify necessary and sufficient conditions for a quantum channel to be optimal for any convex optimization problem in which the optimization is taken over the set of all quantum channels of a fixed size. Optimality conditions for convex optimization problems over the set of all quantum measurements of a given system having a fixed number of measurement outcomes are obtained as a special case. In the case of linear objective functions for measurement optimization problems, our conditions reduce to the well-known Holevo-Yuen-Kennedy-Lax measurement optimality conditions. We illustrate how our conditions can be applied to various state transformation problems having non-linear objective functions based on the fidelity, trace distance, and quantum relative entropy.

arXiv:1810.13295•Quantum•May 1, 2021•14 citations

Quantum system identification

Maxim Raginsky

We formulate and study, in general terms, the problem of quantum system identification, i.e., the determination (or estimation) of unknown quantum channels through their action on suitably chosen input density operators. We also present a quantitative analysis of the worst-case performance of these schemes.

arXiv:quant-ph/0306008•IEEE International Workshop on Workload Characterization (WWC)•Apr 23, 2004•3 citations

Query complexities of quantum channel discrimination and estimation: A unified approach

Zixin Huang, Johannes Jakob Meyer, Theshani Nuradha +1 more

The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.

quant-pharXiv:2511.10832•Nov 17, 2025•4 citations
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.
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.
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.
Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.
We identify necessary and sufficient conditions for a quantum channel to be optimal for any convex optimization problem in which the optimization is taken over the set of all quantum channels of a fixed size. Optimality conditions for convex optimization problems over the set of all quantum measurements of a given system having a fixed number of measurement outcomes are obtained as a special case. In the case of linear objective functions for measurement optimization problems, our conditions reduce to the well-known Holevo-Yuen-Kennedy-Lax measurement optimality conditions. We illustrate how our conditions can be applied to various state transformation problems having non-linear objective functions based on the fidelity, trace distance, and quantum relative entropy.
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.