The parametrized complexity of quantum verification

DOI10.4230/LIPICS.TQC.2022.3MaRDI QIDQ6563764zbMATH OpenFDO

Authors Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman

Publication date 27 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2022.3

zbMATH Keywords

parametrized complexityQMAquantum verification

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cited in

(1)

• Stabilizer testing and magic entropy via quantum Fourier analysis

This page was built for publication: The parametrized complexity of quantum verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563764)