A short tutorial on Wirtinger Calculus with applications in quantum information
read the original abstract
The optimization of system parameters is a ubiquitous problem in science and engineering. The traditional approach involves setting to zero the partial derivatives of the objective function with respect to each parameter, in order to extract the optimal solution. However, the system parameters often take the form of complex matrices. In such situations, conventional methods become unwieldy. The `Wirtinger Calculus' provides a relatively simple methodology for such optimization problems. In this tutorial, we provide a pedagogical introduction to Wirtinger Calculus. To illustrate the utility of this framework in quantum information theory, we also discuss a few example applications.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Localization in OFDM Passive Distributed Antenna Systems with Pilots and Unknown Data Payloads: A Marginal Maximum Likelihood Approach
Derives a marginal maximum likelihood estimator that uses both pilot and unknown data symbols for improved localization in OFDM passive distributed antenna systems without requiring data decoding.
-
Hessian-vector products for tensor networks via recursive tangent-state propagation
An analytical Hessian-vector product kernel for arbitrary linear map compositions in tensor networks is derived via recursive tangent-state propagation, enabling scalable Riemannian trust-region optimization with majo...
-
Sufficient and Necessary Conditions for Eckart-Young like Result for Tubal Tensors
Necessary and sufficient conditions are derived for tubal products to satisfy an Eckart-Young theorem for tubal tensor SVD.
-
Complex Stochastic Gradient Descent and Directional Bias in Reproducing Kernel Hilbert Spaces
Complex SGD converges without analyticity constraints and extends real-valued directional bias results to complex RKHS, with demonstrations on Fock and Hardy spaces.
-
Complex Stochastic Gradient Descent and Directional Bias in Reproducing Kernel Hilbert Spaces
Complex SGD using Wirtinger calculus achieves convergence guarantees paralleling the real-valued setting without analyticity assumptions, and directional bias results extend to complex kernel regression.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.