We propose a learning method for estimating unknown pure quantum states. The basic idea of our method is to learn a unitary operation $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ that transforms a given unknown state $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ to a known fiducial state $|f\ensuremath{\rangle}$. Then, after completion of the learning process, we can estimate and reproduce $|{\ensuremath{\psi}}_{\ensuremath{\tau}}\ensuremath{\rangle}$ based on the learned $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{U}$ and $|f\ensuremath{\rangle}$. To realize this idea, we cast a random-based learning algorithm, called ``single-shot measurement learning,'' in which the learning rule is based on an intuitive and reasonable criterion: the greater the number of success (or failure), the less (or more) changes are imposed. Remarkably, the learning process occurs by means of a single-shot measurement outcome. We demonstrate that our method works effectively, i.e., the learning is completed with a finite number, say
N, of unknown-state copies. Most surprisingly, our method allows the maximum statistical accuracy to be achieved for large
N, namely $\ensuremath{\simeq}O({N}^{\ensuremath{-}1})$ scales of average infidelity. It highlights a nontrivial message, that is, a random-based strategy can potentially be as accurate as other standard statistical approaches.
The increasing success of classical generative adversarial networks (GANs) has inspired several quantum versions of GANs. Fully quantum mechanical applications of such quantum GANs have been limited to one- and two-qubit systems. In this paper, we investigate the entangling quantum GAN (EQ-GAN) for multiqubit learning. We show that the EQ-GAN can learn a circuit more efficiently compared with a swap test. We also consider the EQ-GAN for learning eigenstates that are variational quantum eigensolver (VQE) approximated and find that it generates excellent overlap matrix elements when learning VQE states of small molecules. However, this does not directly translate into a good estimate of the energy due to a lack of phase estimation. Finally, we consider random state learning with the EQ-GAN for up to six qubits, using different two-qubit gates, and show that it is capable of learning completely random quantum states, something which could be useful in quantum state loading.
Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. While various tomographic methods, such as classical shadow and matrix product state (MPS) tomography have shown promise in characterizing a wide class of quantum states, they face unique limitations in detecting topologically ordered two-dimensional states. To address this problem, we implement and study a heuristic tomographic method that combines variational optimization on tensor networks with randomized measurement techniques. Using this approach, we demonstrate its ability to learn the ground state of the surface-code Hamiltonian as well as an experimentally realizable quantum spin liquid state. In particular, we perform numerical experiments using MPS ansätze and systematically investigate the sample complexity required to achieve high fidelities for systems with sizes of up to 48 qubits. In addition, we provide theoretical insights into the scaling of our learning algorithm by analyzing the statistical properties of maximum-likelihood estimation. Notably, our method is sample-efficient and experimentally friendly, only requiring snapshots of the quantum state measured randomly in the X or Z bases. Using this subset of measurements, our approach can effectively learn any real pure states represented by tensor networks, and we rigorously prove that random- X Z measurements are tomographically complete for such states.