Quantum computation: through the algorithm and complexity theory lens

点击翻译按钮获取中文摘要

This project aims to advance our knowledge of quantum computation through the lens of algorithm and complexity theory. Three core areas of the theory will be examined: interactive computing models, query complexity, and circuit lower bounds. The expected outcomes include: revealing the quantum advantages of interactive computing models; techniques for verifying quantum devices in the cloud and quantum cloud computing in general; sharpening the separation between algorithm performance in quantum and classical query models; establishing both unconditional and conditional hardness results for quantum circuits. This comprehensive understanding will enhance Australia's research portfolio in the theory of quantum computing.