The Quantum Algorithms and Complexity Program, led by Professor Michael Bremner based at the University of Technology, Sydney (UTS), identifies applications for quantum computers that demonstrate power beyond classical computing. We focus on developing quantum computational tasks that are experimentally viable in the near-term and clearly on the pathway to scaling-up to more ambitious long-term quantum computing architectures. Researchers in this program are based at the University of Technology Sydney’s Centre for Quantum Software and Information and they work closely with the Centre’s other theoretical and experimental teams to optimise architectures in silicon and optical systems informed by the latest developments in the theory of quantum algorithms, complexity, and error correction.

Featured publications

view all
Fermion Sampling: A Robust Quantum Computational Advantage Scheme Using Fermionic Linear Optics and Magic Input States Michał Oszmaniec, Ninnat Dangniam, Mauro E.S. Morales, and Zoltán Zimborás PRX Quantum, 3, 020328 (2022)
Entanglement-Induced Barren Plateaus CO Marrero, M Kieferova, N Wiebe PRX Quantum, 2, 040316 (2021)
Cluster Editing with Vertex Splitting FN Abu-Khzam, J Egan, S Gaspers, A Shaw, P Shaw Combinatorial Optimization, 10856, 1-13 (2018)
Quantum sampling problems, BosonSampling and quantum supremacy AP Lund, MJ Bremner, TC Ralph npj Quantum Information, 3, 15 (2017)
Characterizing quantum supremacy in near-term devices S Boixo, SV Isakov, VN Smelyanskiy, R Babbush, N Ding, Z Jiang, MJ Bremner, JM Martinis, N Neven.
Nature Physics, 14, 595 (2018)