Robuta

https://arxiv.org/abs/quant-ph/0303169?ref=qmedia.jp [quant-ph/0303169] Quantum query complexity of graph connectivity Abstract page for arXiv paper quant-ph/0303169: Quantum query complexity of graph connectivity quantum query complexityphconnectivity https://arxiv.org/abs/1206.0717 [1206.0717] How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean... Abstract page for arXiv paper 1206.0717: How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?