scientific article; zbMATH DE number 7561592

DOI10.4230/LIPIcs.ICALP.2019.99MaRDI QIDQ5091260

No author found.

Publication date: 21 July 2022

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

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

zbMATH Keywords

semidefinite programmingquantum algorithmsshadow tomography

Mathematics Subject Classification ID

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

Related Items (3)

Quantum algorithm design: techniques and applications ⋮ Unnamed Item ⋮ Fast quantum subroutines for the simplex method

Cites Work

• Unnamed Item
• Global Optimization with Polynomials and the Problem of Moments
• Lower Bounds on the Size of Semidefinite Programming Relaxations
• Lower bound for quantum phase estimation
• A Combinatorial, Primal-Dual Approach to Semidefinite Programs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A semidefinite programming approach to optimal unambiguous discrimination of quantum states
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Shadow tomography of quantum states
• Optimizing quantum optimization algorithms via faster quantum gradient computation

This page was built for publication: