2014/04/22 by Charles H. Baldwin, Amir Kalev, Ivan H. Deutsch +1 · 4 citations
Computer Science · Engineering · Physics and Astronomy · #Integrated Circuits and Semiconductor Failure Analysis #Quantum Information and Cryptography #Sparse and Compressive Sensing Techniques #quant-ph
paper · pdf · doi:10.1103/physreva.90.012110
published as Phys. Rev. A 90, 012110 (2014) · 11 pages, 3 figures
arxiv created 2014/04/22 · openalex publication_date 2014/07/17 · arxiv updated 2014/07/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a d-level system is completely characterized by a minimal set of d2+d elements associated with a collection of POVMs, in contrast to the d4\ensuremath-d2 elements required for a general completely positive trace-preserving map. To achieve this lower bound, one must probe the map with particular sets of d pure states. We further compare the performance of different estimators inspired by compressed sensing, to reconstruct a near-unitary process from such data. We find that when we have accurate prior information, an appropriate compressed sensing method reduces the required data needed for high-fidelity estimation, and different estimators applied to the same data are sensitive to different types of noise. Convex optimization inspired by the techniques of compressed sensing can therefore be used both as indicators of error models and to validate the use of the prior assumptions.