Quantum Algorithms and Complexity Program

The Quantum Algorithms and Complexity Program, led by Prof. Michael Bremner based at 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.


Good quantum algorithms are notoriously hard to design. One of our fundamental research problems is to better understand existing methodologies and, more importantly, to come up with completely new frameworks that can assist the design of quantum algorithms.


Prof. Michael  Bremner

Prof. Michael Bremner

Work Package Leader
Mr. Alexis T. Shaw

Mr. Alexis T. Shaw

Post Doctoral Research Associate
Dr. Marika  Kieferova

Dr. Marika Kieferova

Research Fellow
Mr. Mauricio  Morales

Mr. Mauricio Morales

PhD Student

Featured publications

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)
Cluster Editing with Vertex Splitting FN Abu-Khzam, J Egan, S Gaspers, A Shaw, P Shaw Combinatorial Optimization, 10856, 1-13 (2018)
Achieving quantum supremacy with sparse and noisy commuting quantum computations MJ Bremner, A Montanaro and DJ Shepherd Quantum, 1, 8 (2017)
Quantum sampling problems, BosonSampling and quantum supremacy AP Lund, MJ Bremner, TC Ralph npj Quantum Information, 3, 15 (2017)