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 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.
Multi-qubit state tomography is a key problem in quantum information technology, which has been studied extensively. In this work, we focus on multi-qubit state tomography based on neural network estimators and typical conventional estimation approaches. For multi-qubit pure states, fully connected neural networks and restricted Boltzmann machine networks are designed, respectively, to carry out state tomography of 2-qubit (low-dimensional) systems and 5-qubit (high-dimensional) systems. Comparisons are made with maximum likelihood estimation and least squares estimation, where performance indicators are selected as reconstruction accuracy, time cost and the number of parameters. Simulation results indicate that intelligent approaches have significant advantages over conventional approaches for state tomography of low-dimensional systems; for high-dimensional systems, however, the conventional approach is still dominant when the measurement is complete, while the restricted Boltzmann machine network can achieve higher reconstruction accuracy when the measurement is incomplete.
In the present work, we present a study on Generative Neural Networks applied to the problem of Quantum State Tomography (QST). Our objective was to gain understanding of the use of various Neural Networks and obtain insights on how to apply them to the QST problem, in order to select an approach with promising application. To achieve this, we investigated various networks and explored two cases: Restricted Boltzmann Machines (RBMs) and Conditional Generative Adversarial Networks (cGANs); RBM was chosen for being a pioneer in the context of QST, while cGAN was selected due to its broad successful applicability in various problems, and having been the subject of a recent study in the field, representing, so far, the only application of this type of network to the QST problem. Our case study involved simulations of a 4-qubit quantum state and real data from an experiment with highly entangled 8-qubits. For the first case, we used a well-known Python package (QuCumber, employing an RBM), and also adapted an existing network (a cGAN) to our specific state, achieving successful reconstruction with relatively low training and processing time. However, in the second case, when applying the cGAN to the 8-qubit data, we did not succeed in the reconstruction, possibly due to the limited expressiveness of the network for this scenario or the high processing time required to train it, since we relied only on a CPU and limited computational resources. In our study, we discuss the relevance of these networks to the QST problem and speculate on the next interesting steps at the intersection between Quantum Information Theory and Machine Learning.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε-approximate ML estimate in O((DlogD)/ε2) iterations with O(D3) per-iteration time complexity, where D denotes the dimension of the unknown quantum state and ε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.
Quantum state tomography is a technique in quantum information science used to reconstruct the density matrix of an unknown quantum state, providing complete information about the quantum state. It is of significant importance in fields such as quantum computation, quantum communication, and quantum simulation. However, as the size of the quantum system increases, the number of measurement settings and sampling requirements for quantum state tomography grow exponentially with the number of qubits. This not only makes experimental design and implementation more complex, but also exacerbates the consumption of experimental resources. These limitations severely hinder the application of state tomography in large-scale quantum systems. To reduce measurement settings and improve sampling efficiency, this study proposes a state tomography method based on auxiliary systems. This method can be implemented through either entanglement between the quantum system to be measured and a quantum auxiliary system or through correlation between the quantum system and a probabilistic classical auxiliary system. Measurements on the entire joint system enable more efficient extraction of information about the quantum state to be measured. This method relies on standard quantum gate operations and requires only two measurement settings, with a total sampling complexity of O(d2), significantly simplifying experimental operations and measurement processes. Additionally, this study provides two schemes for measuring purity based on the proposed circuit, one of which achieves measurement precision at the Heisenberg limit. This study validates the effectiveness of the proposed method through a detailed theoretical analysis, a series of numerical simulations, and experiments.
Quantum state tomography (QST) is a challenging task in intermediate-scale quantum devices. Here, we apply conditional generative adversarial networks (CGANs) to QST. In the CGAN framework, two dueling neural networks, a generator and a discriminator, learn multimodal models from data. We augment a CGAN with custom neural-network layers that enable conversion of output from any standard neural network into a physical density matrix. To reconstruct the density matrix, the generator and discriminator networks train each other on data using standard gradient-based methods. We demonstrate that our QST-CGAN reconstructs optical quantum states with high fidelity, using orders of magnitude fewer iterative steps, and less data, than both accelerated projected-gradient-based and iterative maximum-likelihood estimation. We also show that the QST-CGAN can reconstruct a quantum state in a single evaluation of the generator network if it has been pretrained on similar quantum states.
We explore the impact of quantum algorithms on classical-data problems if quantum algorithms can be implemented on quantum computers. It is underlined in this paper that both state estimator design problems for classical linear systems and quantum state tomography can be considered as classical-data problems. Our recent research indicated that the time complexity of state estimator design problems can be reduced to O(qn) in comparison to the time complexity O(n6) in traditional classical algorithms when quantum states can be efficiently prepared, the system matrix is sparse, and both the condition number κ and the reciprocal of precision ε are small in size O(poly log(n)), where n is the dimension of the state x(t) and q is the dimension of the input u(t). This is in contrast to the further observation that the time complexity of state estimator design problems is O(n2) when quantum states cannot be efficiently prepared. The time complexity of quantum state tomography with dimension d is O(d4) when classical algorithms are adopted. We have demonstrated that if the system matrix is sparse, and both the condition number κ and the reciprocal of precision ε are small in size O(poly log(d)), quantum algorithms can reduce the time complexity of quantum state tomography to O(dpoly log d) or O(d3) when quantum states can or cannot be efficiently prepared. In other words, preparing quantum states efficiently has become a bottleneck constraint for quantum acceleration. Our recent researches can be regarded as a novel attempt of enriching application area of quantum computation.