Congratulations to A/Prof Michael Bremner who had a paper accepted at the prestigious QIP 2016 to be held in Jan at Banff, Canada. QIP is the premiere meeting for theoretical quantum information research and is attended by the leading theorists in industry and academia. The conference is well known for it's star-studded line up of speakers including Nobel laureats, industry giants and break-through researchers. Accordingly, it maintains stringent reviewing standards with typically less than 20% of papers accepted.
A/Prof Bremner's paper explores the central problem of quantum computational complexity. In lay terms, that is whether quantum computers are more powerful than traditional ones. Despite a common belief that quantum computers will dramatically outstrip our current technology, a comprehensive proof has yet to be found. In one of the most rigorous arguments on this problem, to date, A /Prof Bremner and his collaborators connect quantum computational complexity to a generalisation of P vs NP . Their work will open up new methods of exploration for proving this long-time open problem in quantum computing.
Details of the paper are:
Michael J Bremner, Ashley Montanaro, Dan J Shepherd
Average-case complexity versus approximate simulation of commuting quantum computations
Details of the conference can be found at: http://ucalgary.ca/qip2016/