Arunachalam, Srinivasan; Briët, Jop; Palazuelos, Carlos Quantum query algorithms are completely bounded forms. (English) Zbl 1422.68077 SIAM J. Comput. 48, No. 3, 903-925 (2019). MSC: 68Q12 46L06 46L07 47A07 47L25 PDFBibTeX XMLCite \textit{S. Arunachalam} et al., SIAM J. Comput. 48, No. 3, 903--925 (2019; Zbl 1422.68077) Full Text: DOI arXiv
Arunachalam, Srinivasan; Briët, Jop; Palazuelos, Carlos Quantum query algorithms are completely bounded forms. (English) Zbl 1462.68059 Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 3, 21 p. (2018). MSC: 68Q12 PDFBibTeX XMLCite \textit{S. Arunachalam} et al., LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 3, 21 p. (2018; Zbl 1462.68059) Full Text: DOI