Tailoring randomized-measurement schemes for practical devices

This is a Perspective on "Performance analysis of multi-shot shadow estimation" by You Zhou and Qing Liu, published in Quantum 7, 1044 (2023).

By Pei Zeng (Pritzker School of Molecular Engineering, The University of Chicago, Illinois 60637, USA).

We live in a quantum world, yet, our everyday experiences seem to present themselves in terms of classical information. To examine large quantum systems, we can obtain classical information to tomographically construct a description of the system’s quantum state. However, the number of measurements required to obtain such a description for $N$ qubits scales exponentially with the number of qubits. To avoid this exponential scaling, people have made many efforts to design efficient protocols capable of extracting the relevant properties of a quantum state [1,2,3,4].

In 2020, Huang, Küng, and Preskill proposed a shadow-estimation scheme [5] that can estimate many properties of a quantum state simultaneously using unbiased classical matrix-valued estimators of the state (called classical shadows) generated from randomized measurements (see also [6]). This provides an elegant solution to learning quantum states, as the classical shadows can be stored and reused for different estimation tasks. Thanks to this feature, people can “measure first, ask questions later” [7], making the experiment flexible. Moreover, the recyclability of the classical shadows for learning different properties makes it highly sample-efficient.

However, when it comes to implementation, we need to take many practical device restrictions into account. Previous works have focused on two major practical issues of randomized measurements: noise and feasibility. The noise from random measurements itself can be quite complicated to characterize and mitigate. Meanwhile, the previous shadow estimation scheme based on global random Clifford measurement is challenging to implement with shallow quantum circuits. Owing to the property of randomized measurements, the noise contributions from different random measurements are twirled and mapped to simple models, and can then be effectively mitigated in a robust version of the shadow estimation protocol [8,9]. Additionally, to get rid of the global Clifford measurement, Hu et al. propose a shadow-estimation protocol with shallow local random circuits and construct a recovery map using the measured second Rényi entropy of the input state [10].
They show numerically that the circuit depth can be sublinear in the qubit number of the input state.
Furthermore, Tran et al. recently showed that global random measurements can be realized with a fixed joint Hamiltonian evolution and projective measurements on some ancillary qubits [11], enabling the shadow estimation on an analog quantum simulator.

In recent studies by Zhou and Liu [12] as well as by Helsen and Walter [13], the effect of the switching time between measurement settings on randomized measurements was examined. The original shadow-estimation scheme generated classical-shadow samples from independent and identically distributed settings of randomized measurements, but this “single-shot” randomized measurement is not ideal for many experimental platforms due to the latency involved in circuit compiling and hardware logic. In comparison, the “multi-shot” shadow estimation, where measurements are repeated in a given setting, may be more time-efficient. This has been demonstrated in previous shadow-estimation experiments in optical [14] and superconducting platforms [15] where a shot number of $10^4$ and $10^3$ was chosen, respectively. Recent studies [16,17,18] have also shown that multi-shot random measurements can conserve more samples and measurement settings for the estimation of nonlinear observables, which can be utilized for entanglement quantification.

Zhou and Liu [12] performed a statistical analysis of the multi-shot shadow estimation and showed that the sample complexity is closely related to a new quantity called the cross-shadow norm $\Gamma_2(\rho, O)$ determined by the input state $\rho$ and observable $O$, which characterizes the statistical variance generated by samples with the same measurement setting. For local Pauli measurements and Pauli observables $P$, where $Tr(P\rho)=0$, the estimator variance is proportional to $1/(MK)$, where $M$ and $K$ are the measurement setting and shot number, respectively. In this case, adding the shot number $K$ can suppress the variance as if more measurement settings were added. This property is referred to as shot-efficiency. However, for global Clifford measurements, increasing the number of shots is generally not helpful in suppressing the sample variance. Helsen and Walter [13] proved similar results for global Clifford measurements and showed that introducing unitary $4$-design random unitaries made the shadow-estimation scheme shot-efficient again. However, unitary $4$-design random measurements are not efficient for classical post-processing since they are difficult to simulate classically. As a trade-off between Clifford and unitary $4$-design random measurements, Helsen and Walter studied randomized measurements with a sequence of Clifford gates inserted by $k$ $T$ gates in the middle and provided the optimal shot number $K$ for a given $T$-gate number $k$.

In the future, it would be interesting to study a good randomized measurement schemes that take various practical factors into consideration at the same time. For instance, can global Clifford measurements in multi-shot schemes be replaced with local shallow randomized circuits or Hamiltonian evolution, and can the noise in the shallow measurement circuits be easily mitigated? With smarter protocol designs to bridge the gap between theory and experiment, the shadow estimation and other randomized-measurement protocols will become a powerful toolbox for exploring and understanding the quantum world.

Acknowledgments:
I am grateful to Zhenhuan Liu and Wenjun Yu for helpful discussions during the preparation of this perspective.

► BibTeX data

► References

[1] S. T. Flammia and Y.-K. Liu, Phys. Rev. Lett. 106, 230501 (2011), https:/​/​doi.org/​10.1103/​PhysRevLett.106.230501.
https:/​/​doi.org/​10.1103/​PhysRevLett.106.230501

[2] S. Aaronson, in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Association for Computing Machinery, New York, NY, USA, 2018), STOC 2018, p. pages325–338, ISBN isbn9781450355599, https:/​/​doi.org/​10.1145/​3188745.3188802.
https:/​/​doi.org/​10.1145/​3188745.3188802

[3] A. Elben, B. Vermersch, M. Dalmonte, J. I. Cirac, and P. Zoller, Phys. Rev. Lett. 120, 050406 (2018), https:/​/​doi.org/​10.1103/​PhysRevLett.120.050406.
https:/​/​doi.org/​10.1103/​PhysRevLett.120.050406

[4] J. Cotler and F. Wilczek, Phys. Rev. Lett. 124, 100401 (2020), https:/​/​doi.org/​10.1103/​PhysRevLett.124.100401.
https:/​/​doi.org/​10.1103/​PhysRevLett.124.100401

[5] H.-Y. Huang, R. Kueng, and J. Preskill, Nat. Phys. 16, 1050 (2020), https:/​/​doi.org/​10.1038/​s41567-020-0932-7.
https:/​/​doi.org/​10.1038/​s41567-020-0932-7

[6] M. Paini, A. Kalev, D. Padilha, and B. Ruck, Quantum 5, 413 (2021), https:/​/​doi.org/​10.22331/​q-2021-03-16-413.
https:/​/​doi.org/​10.22331/​q-2021-03-16-413

[7] A. Elben, S. T. Flammia, H.-Y. Huang, R. Kueng, J. Preskill, B. Vermersch, and P. Zoller, Nat. Rev. Phys. 5, 9 (2023), https:/​/​doi.org/​10.1038/​s42254-022-00535-2.
https:/​/​doi.org/​10.1038/​s42254-022-00535-2

[8] S. Chen, W. Yu, P. Zeng, and S. T. Flammia, PRX Quantum 2, 030348 (2021), https:/​/​doi.org/​10.1103/​PRXQuantum.2.030348.
https:/​/​doi.org/​10.1103/​PRXQuantum.2.030348

[9] D. E. Koh and S. Grewal, Quantum 6, 776 (2022), https:/​/​doi.org/​10.22331/​q-2022-08-16-776.
https:/​/​doi.org/​10.22331/​q-2022-08-16-776

[10] H.-Y. Hu, S. Choi, and Y.-Z. You, Phys. Rev. Res. 5, 023027 (2023), https:/​/​doi.org/​10.1103/​PhysRevResearch.5.023027.
https:/​/​doi.org/​10.1103/​PhysRevResearch.5.023027

[11] M. C. Tran, D. K. Mark, W. W. Ho, and S. Choi, Phys. Rev. X 13, 011049 (2023), https:/​/​doi.org/​10.1103/​PhysRevX.13.011049.
https:/​/​doi.org/​10.1103/​PhysRevX.13.011049

[12] Y. Zhou and Q. Liu, Performance analysis of multi-shot shadow estimation, Quantum 7, 1044 (2023),arXiv:2212.11068, https:/​/​doi.org/​10.22331/​q-2023-06-29-1044.
https:/​/​doi.org/​10.22331/​q-2023-06-29-1044
arXiv:2212.11068

[13] J. Helsen and M. Walter, Thrifty shadow estimation: re-using quantum circuits and bounding tails, arXiv:2212.06240 (2022), https:/​/​arxiv.org/​abs/​2212.06240.
arXiv:2212.06240

[14] G. Struchalin, Y. A. Zagorovskii, E. Kovlakov, S. Straupe, and S. Kulik, PRX Quantum 2, 010307 (2021), https:/​/​doi.org/​10.1103/​PRXQuantum.2.010307.
https:/​/​doi.org/​10.1103/​PRXQuantum.2.010307

[15] W. J. Huggins, B. A. O’Gorman, N. C. Rubin, D. R. Reichman, R. Babbush, and J. Lee, Nature 603, 416 (2022), https:/​/​doi.org/​10.1038/​s41586-021-04351-z.
https:/​/​doi.org/​10.1038/​s41586-021-04351-z

[16] A. Elben, R. Kueng, H.-Y. R. Huang, R. van Bijnen, C. Kokail, M. Dalmonte, P. Calabrese, B. Kraus, J. Preskill, P. Zoller, and B. Vermersch, Phys. Rev. Lett. 125, 200501 (2020), https:/​/​doi.org/​10.1103/​PhysRevLett.125.200501.
https:/​/​doi.org/​10.1103/​PhysRevLett.125.200501

[17] Y. Zhou, P. Zeng, and Z. Liu, Phys. Rev. Lett. 125, 200502 (2020), https:/​/​doi.org/​10.1103/​PhysRevLett.125.200502.
https:/​/​doi.org/​10.1103/​PhysRevLett.125.200502

[18] Z. Liu, Y. Tang, H. Dai, P. Liu, S. Chen, and X. Ma, Phys. Rev. Lett. 129, 260501 (2022), https:/​/​doi.org/​10.1103/​PhysRevLett.129.260501.
https:/​/​doi.org/​10.1103/​PhysRevLett.129.260501

Cited by

On Crossref's cited-by service no data on citing works was found (last attempt 2024-04-15 08:18:33). On SAO/NASA ADS no data on citing works was found (last attempt 2024-04-15 08:18:33).