Abstract

Quantum process tomography is the task of reconstructing unknown quantum channels from measured data. In this work, we introduce compressed sensing-based methods that facilitate the reconstruction of quantum channels of low Kraus rank. Our main contribution is the analysis of a natural measurement model for this task: We assume that data is obtained by sending pure states into the channel and measuring expectation values on the output. Neither ancillary systems nor coherent operations across multiple channel uses are required. Most previous results on compressed process reconstruction reduce the problem to quantum state tomography on the channel's Choi matrix. While this ansatz yields recovery guarantees from an essentially minimal number of measurements, physical implementations of such schemes would typically involve ancillary systems. A priori, it is unclear whether a measurement model tailored directly to quantum process tomography might require more measurements. We establish that this is not the case.Technically, we prove recovery guarantees for three different reconstruction algorithms. The reconstructions are based on a trace, diamond, and ℓ2-norm minimization, respectively. Our recovery guarantees are uniform in the sense that with one random choice of measurement settings all quantum channels can be recovered equally well. Moreover, stability against arbitrary measurement noise and robustness against violations of the low-rank assumption is guaranteed. Numerical studies demonstrate the feasibility of the approach.

Highlights

  • Recent years have seen significant advances in the precise control of quantum systems

  • We consider the task of reconstructing a quantum channel T ∈ completely positive and trace preserving (CPT)(Cn) from measurement data of the form (1): The unknown channel receives pure states |ψi ψi | as input and subsequently expectation values of observables Ai are measured for the output state; see Figure 2 for a pictorial description

  • We have proven that quantum processes can be reconstructed from an essentially optimal number of expectation values without the requirement of ancillary quantum systems

Read more

Summary

Introduction

Recent years have seen significant advances in the precise control of quantum systems. Complex quantum states of systems with an increasing number of degrees of freedom can be prepared and manipulated with high accuracy In this development, it is important to have tools at hand that allow for a complete characterization of state or process that are being realized in a given experimental setup. We note that full quantum process tomography is distinct from certification protocols or coarser characterization schemes like randomized benchmarking (which reports only a single number: a certain error rate). While this makes the latter type of protocols much cheaper to implement, only process tomography allows one to understand in precisely which way a quantum gate deviates from its specification.

Motivation of our measurement model
Our contribution
Related work
Experimental considerations
Notation and terminology
Maps on operators
Spherical and unitary designs
Measurement terminology
Measurement model
Reconstructions
Recovery guarantees I
Stability and robustness
Recovery guarantees II
Numerical example
Pauli measurements
Sample complexity
Applications to fault tolerant quantum computation
Analytical details and proofs
Preliminaries
Notation
Normalization and centralization of the observables
Minimum conic singular value
Tools from representation theory
Our bound on the minimum conic singular value
Upper bound on the mean empirical width Wm
Lower bound on the marginal tail function Qξ
General tensor network bound
Constrained trace norm minimization
Every such matrix satisfies
CPT-fit
Constrained trace and diamond norm minimization
Reconstruction from approximate 4-generic measurements
Bosonic and fermionic linear optical circuits
Conclusion
Outlook
A Semidefinite programs for trace and diamond norm reconstruction
C Linear representation of the symmetric group S4
D Proof of the tensor network bound Proposition 18
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call