Real-valued functions of complex arguments violate the Cauchy-Riemann conditions and, consequently, do not have Taylor series expansion. Therefore, optimization methods based on derivatives cannot be directly applied to this class of functions. This is circumvented by mapping the problem to the field of the real numbers by considering real and imaginary parts of the complex arguments as the new independent variables. We introduce a stochastic optimization method that works within the field of the complex numbers. This has two advantages: Equations on complex arguments are simpler and easy to analyze and the use of the complex structure leads to performance improvements. The method produces a sequence of estimates that converges asymptotically in mean to the optimizer. Each estimate is generated by evaluating the target function at two different randomly chosen points. Thereby, the method allows the optimization of functions with unknown parameters. Furthermore, the method exhibits a large performance enhancement. This is demonstrated by comparing its performance with other algorithms in the case of quantum tomography of pure states. The method provides solutions which can be two orders of magnitude closer to the true minima or achieve similar results as other methods but with three orders of magnitude less resources.
Real-valued functions of complex arguments violate the Cauchy-Riemann conditions and, consequently, do not have Taylor series expansion. Therefore, optimization methods based on derivatives cannot be directly applied to this class of functions. This is circumvented by mapping the problem to the field of the real numbers by considering real and imaginary parts of the complex arguments as the new independent variables. We introduce a stochastic optimization method that works within the field of the complex numbers. This has two advantages: Equations on complex arguments are simpler and easy to analyze and the use of the complex structure leads to performance improvements. The method produces a sequence of estimates that converges asymptotically in mean to the optimizer. Each estimate is generated by evaluating the target function at two different randomly chosen points. Thereby, the method allows the optimization of functions with unknown parameters. Furthermore, the method exhibits a large performance enhancement. This is demonstrated by comparing its performance with other algorithms in the case of quantum tomography of pure states. The method provides solutions which can be two orders of magnitude closer to the true minima or achieve similar results as other methods but with three orders of magnitude less resources.
Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of noisy intermediate-scale quantum computers. These methods use an optimization algorithm executed in a classical computer, fed with values of the objective function obtained in a quantum processor. A proper choice of optimization algorithm is essential to achieve good performance. Here, we review the use of first-order, second-order, and quantum natural gradient stochastic optimization methods, which are defined in the field of real numbers, and propose stochastic algorithms defined in the field of complex numbers. The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation. In general, complex number optimization algorithms perform best, with first-order complex algorithms consistently achieving the best performance, closely followed by complex quantum natural algorithms, which do not require expensive hyperparameter calibration. In particular, the scalar formulation of the complex quantum natural algorithm allows to achieve good performance with low classical computational cost.
Abstract Recent studies have extended the use of the stochastic Hamilton-Jacobi-Bellman (HJB) equation to include complex variables for deriving quantum mechanical equations. However, these studies often assume that it is valid to apply the HJB equation directly to complex numbers, an approach that overlooks the fundamental problem of comparing complex numbers when finding optimal controls. This paper explores the application of the HJB equation in the context of complex variables. It provides an in-depth investigation of the stochastic movement of quantum particles within the framework of stochastic optimal control theory. We obtain the complex diffusion coefficient in the stochastic equation of motion using the Cauchy-Riemann theorem, considering that the particle’s stochastic movement is described by two perfectly correlated real and imaginary stochastic processes. During the development of the covariant form of the HJB equation, we demonstrate that if the temporal stochastic increments of the two processes are perfectly correlated, then the spatial stochastic increments must be perfectly anti-correlated, and vice versa. The diffusion coefficient we derive has a form that enables the linearization of the HJB equation. The method for linearizing the HJB equation, along with the subsequent derivation of the Dirac equation, was developed in our previous work [V. Yordanov, Scientific Reports 14, 6507 (2024)]. These insights deepen our understanding of quantum dynamics and enhance the application of stochastic optimal control theory to quantum mechanics.
Quantum computing shows promise for addressing computationally intensive problems but is constrained by the exponential resource requirements of general quantum state tomography (QST), which fully characterizes quantum states through parameter estimation. We introduce the QST with Chebyshev polynomials, an approximate tomography method for pure quantum states encoding complex-valued functions. This method reformulates tomography as the estimation of Chebyshev expansion coefficients, expressed as inner products between the target quantum state and Chebyshev basis functions, measured using the Hadamard test circuit. By treating the truncation order of the Chebyshev polynomials as a controllable parameter, the method provides a practical balance between efficiency and accuracy. For quantum states encoding functions dominated by large-scale features, such as those representing fluid flow fields, appropriate truncation enables faithful reconstruction of the dominant components via quantum circuits with linear depth, while keeping both measurement repetitions and post-processing independent of qubit count, in contrast to the exponential scaling of full measurement-based QST methods. Validation on analytic functions and numerically generated flow-field data demonstrates accurate reconstruction and effective extraction of large-scale features, indicating the method's suitability for systems governed by macroscopic dynamics.
Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science and becomes especially challenging for high-dimensional complex structure problems. One specific issue is that of quantum process tomography, in which the goal is to retrieve the underlying quantum process based on a given set of measurement data. In this paper, we introduce a modified version of stochastic gradient descent on a Riemannian manifold that integrates recent advancements in numerical methods for Riemannian optimization. This approach inherently supports the physically driven constraints of a quantum process, takes advantage of state-of-the-art large-scale stochastic objective optimization, and has superior performance to traditional approaches such as maximum likelihood estimation and projected least squares. The data-driven approach enables accurate, order-of-magnitude faster results, and works with incomplete data. We demonstrate our approach on simulations of quantum processes and in hardware by characterizing an engineered process on quantum computers.
Quantum state tomography refers to the process of estimating the density matrix of an unknown system after obtaining data through a series of quantum measurements. Quantum state tomography can be divided into two processes: quantum measurement and reconstruction algorithm. From these two processes, different schemes can be designed, and they also have their own advantages and disadvantages. At the same time, quantum tomography is mainly concerned with two factors: estimation accuracy and complexity. High-precision quantum tomography is a necessary condition for quantum computing and other quantum technologies, and the scarcity of quantum resources forces us to find more effective methods to reduce estimation errors. The complexity problem of quantum tomography grows with the dimensionality of the quantum system. I simulate the behavior of a linear optics quantum computing circuit that performs the quantum Fourier transform. We investigated the possibility of using k-means clustering algorithm to predict the output of the quantum computer and compare its performance with the conditional generative adversarial network (CGAN), shadow tomography, maximum likelihood estimation. Using this simulated data, I apply the various algorithms to the order-finding problem to determine the trade-off between the required number of measurements and the accuracy. The result shows that k-means clustering can take a polynomial number of samples to access the result of the order-finding problem with more than 90 percent accuracy. The comparison of all four methods is analyzed.
Quantum tomography has become a key tool for the assessment of quantum states, processes, and devices. This drives the search for tomographic methods that achieve greater accuracy. In the case of mixed states of a single 2-dimensional quantum system adaptive methods have been recently introduced that achieve the theoretical accuracy limit deduced by Hayashi and Gill and Massar. However, accurate estimation of higher-dimensional quantum states remains poorly understood. This is mainly due to the existence of incompatible observables, which makes multiparameter estimation difficult. Here we present an adaptive tomographic method and show through numerical simulations that, after a few iterations, it is asymptotically approaching the fundamental Gill-Massar lower bound for the estimation accuracy of pure quantum states in high dimension. The method is based on a combination of stochastic optimization on the field of the complex numbers and statistical inference, exceeds the accuracy of any mixed-state tomographic method, and can be demonstrated with current experimental capabilities. The proposed method may lead to new developments in quantum metrology.