Operator Relaxation and the Optimal Depth of Classical Shadows

被引:19
|
作者
Ippoliti, Matteo [1 ]
Li, Yaodong [1 ]
Rakovszky, Tibor [1 ]
Khemani, Vedika [1 ]
机构
[1] Stanford Univ, Dept Phys, Stanford, CA 94305 USA
关键词
Expectation values - Heisenberg time - Local unitary - Optimal depth - Pauli operators - Property - Quantum state - Randomisation - Sample complexity - Variable depth;
D O I
10.1103/PhysRevLett.130.230403
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Classical shadows are a powerful method for learning many properties of quantum states in a sampleefficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via "shallow shadows," a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. We show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing ("twirling") circuit- namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t & SIM; log(k), guarantees an exponential gain in sample complexity over the t = 0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.
引用
收藏
页数:7
相关论文
共 50 条
  • [21] Accurate shadows by depth complexity sampling
    Forest, Vincent
    Barthe, Loic
    Paulin, Mathias
    COMPUTER GRAPHICS FORUM, 2008, 27 (02) : 663 - 674
  • [22] Quantum Error Mitigated Classical Shadows
    Jnane, Hamza
    Steinberg, Jonathan
    Cai, Zhenyu
    Nguyen, H. Chau
    Koczor, Balint
    PRX QUANTUM, 2024, 5 (01):
  • [23] Finding optimal shadows of polytopes
    Burger, T
    Gritzmann, P
    DISCRETE & COMPUTATIONAL GEOMETRY, 2000, 24 (2-3) : 219 - 239
  • [24] Finding Optimal Shadows of Polytopes
    T. Burger
    P. Gritzmann
    Discrete & Computational Geometry, 2000, 24 : 219 - 240
  • [25] Learning quantum states from their classical shadows
    Huang, Hsin-Yuan
    NATURE REVIEWS PHYSICS, 2022, 4 (02) : 81 - 81
  • [26] Fermionic Partial Tomography via Classical Shadows
    Zhao, Andrew
    Rubin, Nicholas C.
    Miyake, Akimasa
    PHYSICAL REVIEW LETTERS, 2021, 127 (11)
  • [27] Experimental Quantum State Measurement with Classical Shadows
    Zhang, Ting
    Sun, Jinzhao
    Fang, Xiao-Xu
    Zhang, Xiao-Ming
    Yuan, Xiao
    Lu, He
    PHYSICAL REVIEW LETTERS, 2021, 127 (20)
  • [28] Learning quantum states from their classical shadows
    Hsin-Yuan Huang
    Nature Reviews Physics, 2022, 4 : 81 - 81
  • [29] Avoiding Barren Plateaus Using Classical Shadows
    Sack, Stefan H.
    Medina, Raimel A.
    Michailidis, Alexios A.
    Kueng, Richard
    Serbyn, Maksym
    PRX QUANTUM, 2022, 3 (02):
  • [30] GENERATING SOFT SHADOWS WITH A DEPTH BUFFER ALGORITHM
    BROTMAN, LS
    BADLER, NI
    IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1984, 4 (10) : 5 - 12