Pages that link to "Item:Q3508097"
From MaRDI portal
The following pages link to The learnability of quantum states (Q3508097):
Displaying 34 items.
- Quantum learning algorithms for quantum measurements (Q691917) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Self-guided quantum state learning for mixed states (Q2101509) (← links)
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- Demonstration of a measurement-based adaptation protocol with quantum reinforcement learning on the IBM Q experience platform (Q2677229) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly (Q2828212) (← links)
- Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem (Q2969052) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- (Q3166196) (← links)
- Quantum bootstrapping via compressed quantum Hamiltonian learning (Q3387622) (← links)
- Optimal, reliable estimation of quantum states (Q4594493) (← links)
- (Q4614114) (← links)
- Efficient quantum tomography II (Q4978038) (← links)
- Correlation between concurrence and mutual information (Q5043087) (← links)
- (Q5091176) (← links)
- Shadow Tomography of Quantum States (Q5130848) (← links)
- Quantum learning: asymptotically optimal classification of qubit states (Q5135186) (← links)
- Robust online Hamiltonian learning (Q5137742) (← links)
- Optimal Universal Learning Machines for Quantum State Discrimination (Q5211418) (← links)
- Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
- Shadow tomography of quantum states (Q5230300) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- Sparse Approximate Solutions to Semidefinite Programs (Q5458538) (← links)
- Online learning of quantum states (Q5854122) (← links)
- Inapproximability of positive semidefinite permanents and quantum state tomography (Q6088302) (← links)
- Learning quantum finite automata with queries (Q6149966) (← links)
- Quantum continual learning of quantum data realizing knowledge backward transfer (Q6158899) (← links)
- (Q6161142) (← links)
- Error regions in quantum state tomography: computational complexity caused by geometry of quantum states (Q6172400) (← links)
- Quantum process tomography on cloud-accessible quantum computing platforms (Q6544392) (← links)
- Classical shadows meet quantum optimal mass transport (Q6619658) (← links)
- Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes (Q6629283) (← links)
