Shadow process tomography of quantum channels

Published on Oct 7, 2021in arXiv: Quantum Physics
Jonathan Kunjummen2
Estimated H-index: 2
(UMD: University of Maryland, College Park),
Minh C. Tran12
Estimated H-index: 12
+ 1 AuthorsJacob M. Taylor60
Estimated H-index: 60
Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scale exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. We make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.
📖 Papers frequently viewed together
#1Daiwei ZhuH-Index: 8
#2Ze-Pei Cian (UMD: University of Maryland, College Park)H-Index: 5
Last. Nhung Hong NguyenH-Index: 7
view all 17 authors...
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound...
#1Dinh Van HuynhH-Index: 12
#2S. K. JainH-Index: 1
Last. S. R. López-PermouthH-Index: 1
view all 3 authors...
Cited By0
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.