A projected gradient method for optimization over density matrices

  title={A projected gradient method for optimization over density matrices},
  author={D. Gonçalves and M. A. Gomes-Ruggiero and C. Lavor},
  journal={Optimization Methods and Software},
  pages={328 - 341}
An ensemble of quantum states can be described by a Hermitian, positive semidefinite and unit trace matrix called density matrix. Thus, the study of methods for optimizing a certain function (energy, entropy) over the set of density matrices has a direct application to important problems in quantum information and computation. We propose a projected gradient method for solving such problems. By exploiting the geometry of the feasible set, which is the intersection of the cone of Hermitian… Expand
An Efficient and Fast Quantum State Estimator With Sparse Disturbance
An efficient and fast inexact alternating direction method of multipliers (I-ADMM), in which the subproblems are solved inexactly and hence have closed-form solutions, is proposed, and the theoretical result provides a guideline for parameter setting. Expand
Accelerated method for optimization over density matrices in quantum state estimation
Abstract In this paper, a class of minimization problems over density matrices arising in the quantum state estimation is investigated. By making use of the Nesterov’s accelerated strategies, weExpand
Fast algorithm of high-dimensional quantum state estimation via low measurement rates
An improved Alternating Direction Multiplier Method (AD-MM) for high-dimensional quantum state reconstruction is proposed that not only greatly reduces the computational complexity and speeds up the convergence, but also has a strong robustness to the noise. Expand
Projected gradient descent algorithms for quantum state tomography
This work presents three tomography algorithms that use projected gradient descent and compares their performance with state-of-the-art alternatives, finding in favour of the general class of projection gradient descent methods due to their speed, applicability to large states, and the range of conditions in which they perform. Expand
Superfast maximum likelihood reconstruction for quantum tomography
Conventional methods for computing maximum-likelihood estimators (MLE) often converge slowly in practical situations, leading to a search for simplifying methods that rely on additional assumptionsExpand
Provable quantum state tomography via non-convex methods
It is proved that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol. Expand
Quantum process tomography via completely positive and trace-preserving projection
We present an algorithm for projecting superoperators onto the set of completely positive, trace-preserving maps. When combined with gradient descent of a cost function, the procedure results in anExpand
Provable compressed sensing quantum state tomography via non-convex methods
This work describes a non-convex algorithm for quantum tomography of almost-pure quantum states that performs much better than convex analogues, as demonstrated on a 13-qubits problem and proves that it constitutes a provable quantum state tomography protocol. Expand
Bayesian inference for quantum state tomography
A Bayesian approach to the problem of estimating density matrices in quantum state tomography, where a study of the convergence of the Monte Carlo Markov Chain algorithm is given, including a comparison with other estimation methods, such as maximum likelihood estimation and linear inversion. Expand
An Efficient Online Estimation Algorithm for Evolving Quantum States
An online optimization algorithm for estimating state density in free evolution quantum systems from noisy continuous weak measurements based on online proximal gradient and alternating direction multiplier method is proposed. Expand


Quantum state tomography with incomplete data: Maximum entropy and variational quantum tomography
Whenever we do not have an informationally complete set of measurements, the estimate of a quantum state can not be uniquely determined. In this case, among the density matrices compatible with theExpand
Maximum-likelihood methods in quantum mechanics
Maximum Likelihood estimation is a versatile tool covering wide range of applications, but its benefits are apparent particularly in the quantum domain. For a given set of measurements, the mostExpand
3 Maximum-Likelihood Methods in Quantum Mechanics
Maximum Likelihood estimation is a versatile tool covering wide range of applications, but its benefits are apparent particularly in the quantum domain. For a given set of measurements, the mostExpand
Generating random density matrices
We study various methods to generate ensembles of random density matrices of a fixed size N, obtained by partial trace of pure states on composite systems. Structured ensembles of random pure states,Expand
Volume of the set of separable states
The question of how many entangled or, respectively, separable states there are in the set of all quantum states is considered. We propose a natural measure in the space of density matrices %Expand
Symmetric informationally complete quantum measurements
It is conjecture that a particular kind of group-covariant SIC–POVM exists in arbitrary dimensions, providing numerical results up to dimension 45 to bolster this claim. Expand
Inexact spectral projected gradient methods on convex sets
A new method is introduced for large-scale convex constrained optimization. The general model algorithm involves, at each iteration, the approximate minimization of a convex quadratic on the feasibleExpand
Efficient projections onto the l1-ball for learning in high dimensions
Efficient algorithms for projecting a vector onto the l1-ball are described and variants of stochastic gradient projection methods augmented with these efficient projection procedures outperform interior point methods, which are considered state-of-the-art optimization techniques. Expand
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Many problems require the ability to find least squares projections onto convex regions. Here it is shown that if the constraint region can be expressed as a finite intersection of simpler convexExpand
Gradient-based stopping rules for maximum-likelihood quantum-state tomography
When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems.Expand