Quantum algorithms for learning a hidden graph

DOI10.4230/LIPICS.TQC.2022.1MaRDI QIDQ6563762zbMATH OpenFDO

Authors Ashley Montanaro, Changpeng Shao

Publication date 27 June 2024

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

zbMATH Keywords

combinatorial group testinggraphsquantum algorithmsquery complexity

Mathematics Subject Classification ID

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

Cited in

(3)

• Non-adaptive edge counting and sampling via bipartite independent set queries
• Testing multipartite productness is easier than testing bipartite productness
• Quantum spectral method for gradient and Hessian estimation

This page was built for publication: Quantum algorithms for learning a hidden graph

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