The ongoing conference on quantum information is quite big. The conference promises to have the presence of notable physicists, including the Nobel-laureate David Wineland. For more information about the conference, check out their website http://www.quantum-lab.org/qip2015/index.php.
The conference kicked start today 10/01/2015 with a 2 days tutorial session before the mainstream talks.
I will post updates of the main talks soon.
12/01/2015 – First Day:
I will give a very sketchy summary of today’s talks.
The conference started today with an opening speech from the director of the Quantum Computation and Intelligent Systems(QCIS) at the University of Technology Sydney(UTS). He thanked the organizers and sponsors for their contributions to the success of the programme and the funds which were made available for international students. Among those sponsors are Institute of Quantum Computing(IQC), Journal of Mathematical Physics, Macquarie University, University of Sydney, UTS, University of Queensland and many more.
This was followed by a plenary talk by Ran Raz on “how to delegate quantum computation”. You can view the abstract that talk.
The next speaker on the main talks was Montanaro on “Pattern matching algorithm”. Suppose we are asked to find a certain pattern P in a text T. For example, suppose P=ANT and T=QUANTUM. We want to understand the computational complexity of the algorithm that can identify the pattern(i.e. finding the pattern or its index) in the given text. Can we find efficient quantum algorithm that outperforms the classical one? The speaker showed the analysis and results of this problem and also showed that the problem can be considered in higher dimensions and he further generalized it to find any pattern of bits and not only text. The arxiv address is arXiv:1408.1816.
The next was by Ryan O’Donnell on “Quantum Spectrum Testing” which can simply be described as say given n copies of a mixed state $\rho^{\mathbb(C)\times \mathbb(C)}$, and the goal is to determine whether $\rho$ satisfy some property $\mathcal{P}$ or not and if not, then how far is $\rho$ from those properties.
In fact, there were lots of other talks. It would be difficult to give a complete overview of them all.
It is already late into the night and I have to hit my bed now as my eye hitches me and my body needs some rest. I will hopefully be able to write better tomorrow. :).
P.S: Sorry if those maths expression does not render nice as I haven’t fix latex to be working with my blog.