ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2309.13461
  4. Cited By
Tight bounds on Pauli channel learning without entanglement

Tight bounds on Pauli channel learning without entanglement

23 September 2023
Senrui Chen
Changhun Oh
Sisi Zhou
Hsin-Yuan Huang
Liang Jiang
ArXivPDFHTML

Papers citing "Tight bounds on Pauli channel learning without entanglement"

5 / 5 papers shown
Title
Relation-aware Hierarchical Prompt for Open-vocabulary Scene Graph
  Generation
Relation-aware Hierarchical Prompt for Open-vocabulary Scene Graph Generation
Tao Liu
Rongjie Li
Chongyu Wang
Xuming He
30
0
0
26 Dec 2024
On the sample complexity of purity and inner product estimation
On the sample complexity of purity and inner product estimation
Weiyuan Gong
Jonas Haferkamp
Qi Ye
Zhihan Zhang
16
4
0
16 Oct 2024
Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
Chirag Wadhwa
Mina Doosti
42
1
0
20 May 2024
An optimal tradeoff between entanglement and copy complexity for state
  tomography
An optimal tradeoff between entanglement and copy complexity for state tomography
Sitan Chen
Jungshian Li
Allen Liu
18
7
0
26 Feb 2024
Information-theoretic bounds on quantum advantage in machine learning
Information-theoretic bounds on quantum advantage in machine learning
Hsin-Yuan Huang
R. Kueng
J. Preskill
63
211
0
07 Jan 2021
1