No Arabic abstract
This review serves as a concise introductory survey of modern compressive tomography developed since 2019. These are schemes meant for characterizing arbitrary low-rank quantum objects, be it an unknown state, a process or detector, using minimal measuring resources (hence compressive) without any emph{a priori} assumptions (rank, sparsity, eigenbasis, emph{etc}.) about the quantum object. This article contains a reasonable amount of technical details for the quantum-information community to start applying the methods discussed here. To facilitate the understanding of formulation logic and physics of compressive tomography, the theoretical concepts and important numerical results (both new and cross-referenced) shall be presented in a pedagogical manner.
We present a compressive quantum process tomography scheme that fully characterizes any rank-deficient completely-positive process with no a priori information about the process apart from the dimension of the system on which the process acts. It uses randomly-chosen input states and adaptive output von Neumann measurements. Both entangled and tensor-product configurations are flexibly employable in our scheme, the latter which naturally makes it especially compatible with many-body quantum computing. Two main features of this scheme are the certification protocol that verifies whether the accumulated data uniquely characterize the quantum process, and a compressive reconstruction method for the output states. We emulate multipartite scenarios with high-order electromagnetic transverse modes and optical fibers to positively demonstrate that, in terms of measurement resources, our assumption-free compressive strategy can reconstruct quantum processes almost equally efficiently using all types of input states and basis measurement operations, operations, independent of whether or not they are factorizable into tensor-product states.
Quantum state tomography is both a crucial component in the field of quantum information and computation, and a formidable task that requires an incogitably large number of measurement configurations as the system dimension grows. We propose and experimentally carry out an intuitive adaptive compressive tomography scheme, inspired by the traditional compressed-sensing protocol in signal recovery, that tremendously reduces the number of configurations needed to uniquely reconstruct any given quantum state without any additional a priori assumption whatsoever (such as rank information, purity, etc) about the state, apart from its dimension.
We provide a detailed analysis of the question: how many measurement settings or outcomes are needed in order to identify a quantum system which is constrained by prior information? We show that if the prior information restricts the system to a set of lower dimensionality, then topological obstructions can increase the required number of outcomes by a factor of two over the number of real parameters needed to characterize the system. Conversely, we show that almost every measurement becomes informationally complete with respect to the constrained set if the number of outcomes exceeds twice the Minkowski dimension of the set. We apply the obtained results to determine the minimal number of outcomes of measurements which are informationally complete with respect to states with rank constraints. In particular, we show that 4d-4 measurement outcomes (POVM elements) is enough in order to identify all pure states in a d-dimensional Hilbert space, and that the minimal number is at most 2 log_2(d) smaller than this upper bound.
The exact reconstruction of many-body quantum systems is one of the major challenges in modern physics, because it is impractical to overcome the exponential complexity problem brought by high-dimensional quantum many-body systems. Recently, machine learning techniques are well used to promote quantum information research and quantum state tomography has been also developed by neural network generative models. We propose a quantum state tomography method, which is based on Bidirectional Gated Recurrent Unit neural network (BiGRU), to learn and reconstruct both easy quantum states and hard quantum states in this paper. We are able to use fewer measurement samples in our method to reconstruct these quantum states and obtain high fidelity.
We perform several numerical studies for our recently published adaptive compressive tomography scheme [D. Ahn et al. Phys. Rev. Lett. 122, 100404 (2019)], which significantly reduces the number of measurement settings to unambiguously reconstruct any rank-deficient state without any a priori knowledge besides its dimension. We show that both entangled and product bases chosen by our adaptive scheme perform comparably well with recently-known compressed-sensing element-probing measurements, and also beat random measurement bases for low-rank quantum states. We also numerically conjecture asymptotic scaling behaviors for this number as a function of the state rank for our adaptive schemes. These scaling formulas appear to be independent of the Hilbert space dimension. As a natural development, we establish a faster hybrid compressive scheme that first chooses random bases, and later adaptive bases as the scheme progresses. As an epilogue, we reiterate important elements of informational completeness for our adaptive scheme.