Phase Retrieval Using Unitary 2-Designs
arXiv:1510.08887 · doi:10.1109/SAMPTA.2017.8024414
Abstract
We consider a variant of the phase retrieval problem, where vectors are replaced by unitary matrices, i.e., the unknown signal is a unitary matrix U, and the measurements consist of squared inner products |Tr(C*U)|^2 with unitary matrices C that are chosen by the observer. This problem has applications to quantum process tomography, when the unknown process is a unitary operation. We show that PhaseLift, a convex programming algorithm for phase retrieval, can be adapted to this matrix setting, using measurements that are sampled from unitary 4- and 2-designs. In the case of unitary 4-design measurements, we show that PhaseLift can reconstruct all unitary matrices, using a near-optimal number of measurements. This extends previous work on PhaseLift using spherical 4-designs. In the case of unitary 2-design measurements, we show that PhaseLift still works pretty well on average: it recovers almost all signals, up to a constant additive error, using a near-optimal number of measurements. These 2-design measurements are convenient for quantum process tomography, as they can be implemented via randomized benchmarking techniques. This is the first positive result on PhaseLift using 2-designs.
arXiv comment21 pages; v3: minor revisions, to appear at SampTA 2017; v2: rewritten to focus on phase retrieval, with new title, improved error bounds, and numerics; v1: original version, titled "Quantum Compressed Sensing Using 2-Designs"
References in corpus (23)
- Quantum state tomography via compressed sensing
- The foundations of statistical mechanics from entanglement: Individual states vs. averages
- Randomized Benchmarking of Quantum Gates
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Robust randomized benchmarking of quantum processes
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Recovering low-rank matrices from few coefficients in any basis
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Quantum Data Hiding
- Self-Consistent Quantum Process Tomography
- Symmetrised Characterisation of Noisy Quantum Processes
- Efficient measurement of quantum dynamics via compressive sensing
- Optimizing quantum process tomography with unitary 2-designs
- Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
- A Partial Derandomization of PhaseLift using Spherical Designs
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Decoupling with unitary approximate two-designs
- Large Deviation Bounds for k-designs
- Self-consistent tomography of the state-measurement Gram matrix
- Demonstration of Robust Quantum Gate Tomography via Randomized Benchmarking
Cited by in corpus (11)
- Exact emergent quantum state designs from quantum chaotic dynamics
- Recovering quantum gates from few average gate fidelities
- Guaranteed recovery of quantum processes from few measurements
- Estimating gate-set properties from random sequences
- Efficient unitary designs and pseudorandom unitaries from permutations
- Efficient Unitary T-designs from Random Sums
- Semi-device-dependent blind quantum tomography
- Projective toric designs, quantum state designs, and mutually unbiased bases
- Non-Clifford Cost of Random Unitaries
- On Computational Complexity of Unitary and State Design Properties
- Quantum Codes and Irreducible Products of Characters