An Improved Sample Complexity Lower Bound for (Fidelity) Quantum State Tomography

被引：0
|
作者：
Yuen, Henry [1 ]
机构：
[1] Columbia Univ, New York, NY 10027 USA
来源：
QUANTUM | 2023年 / 7卷
关键词：
OPTIMAL CLONING;
D O I：
暂无
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
We show that 11(rd/is an element of) copies of an unknown rank -r, dimension -d quantum mixed state are necessary in order to learn a classical description with 1 - is an element of fidelity. This improves upon the tomography lower bounds obtained by Haah et al. and Wright (when closeness is measured with respect to the fidelity function).
引用
收藏
页码：1 / 4
页数：4
相关论文
共 50 条
  • [41] Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
    Gong, Weiyuan
    Zhou, Shuo
    Li, Tongyang
    QUANTUM, 2024, 8
  • [42] On the learnability of quantum state fidelity
    Norhan Elsayed Amer
    Walid Gomaa
    Keiji Kimura
    Kazunori Ueda
    Ahmed El-Mahdy
    EPJ Quantum Technology, 2022, 9
  • [43] On the learnability of quantum state fidelity
    Amer, Norhan Elsayed
    Gomaa, Walid
    Kimura, Keiji
    Ueda, Kazunori
    El-Mahdy, Ahmed
    EPJ QUANTUM TECHNOLOGY, 2022, 9 (01)
  • [44] AN IMPROVED BL LOWER BOUND
    BROWN, DJ
    INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 37 - 39
  • [45] Improved bound for complexity of matrix multiplication
    Davie, A. M.
    Stothers, A. J.
    PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS, 2013, 143 (02) : 351 - 369
  • [46] Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
    Flammia, Steven T.
    Gross, David
    Liu, Yi-Kai
    Eisert, Jens
    NEW JOURNAL OF PHYSICS, 2012, 14
  • [47] LOWER-BOUND STUDY ON INTERCONNECT COMPLEXITY OF THE DECOMPOSED FINITE-STATE MACHINES
    YANG, WL
    OWENS, RM
    IRWIN, MJ
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1995, 142 (05): : 332 - 336
  • [48] Improved bounds on the sample complexity of learning
    Li, Y
    Long, PM
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (03) : 516 - 527
  • [49] Improved bounds on the sample complexity of learning
    Li, Y
    Long, PM
    Srinivasan, A
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 309 - 318
  • [50] AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
    Gartner, Bernd
    Jaggi, Martin
    Maria, Clement
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2012, 3 (01) : 168 - 195
12345