scientific article; zbMATH DE number 7561520

DOI10.4230/LIPIcs.ICALP.2019.27MaRDI QIDQ5091176

Xiaodi Wu, Fernando G. S. L. Brandão, Krysta M. Svore, Tongyang Li, Cedric Yen-Yu Lin, A. Kalev

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1710.02581

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationquantum algorithmssemidefinite program

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (4)

Decay of quantum conditional mutual information for purely generated finitely correlated states ⋮ Quantum science and quantum technology ⋮ Quantum algorithm design: techniques and applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower Bounds on the Size of Semidefinite Programming Relaxations
• Information Theory and Statistical Mechanics
• The learnability of quantum states
• Sequential measurements, disturbance and property testing
• A quantum-inspired classical algorithm for recommendation systems
• Shadow tomography of quantum states
• Logarithmic Regret Algorithms for Online Convex Optimization
• Efficient quantum tomography
• Sample-optimal tomography of quantum states
• QIP = PSPACE
• Online learning of quantum states

This page was built for publication: