UTS:QSI has nine talks accepted at QIP 2017
The newly established UTS Centre for Quantum Software and Information (UTS:QSI) has kicked off in the best possible fashion with nine talks accepted for the 20th Annual Conference on Quantum Information Processing. QIP 2017 is being hosted by Microsoft’s Station Q and so researchers from the UTS:QSI will be heading to Seattle in January to present their research.
QIP is the most esteemed conference for theoretical quantum software and information science and is attended by the leading theorists in industry and academia. The conference is well known for its star-studded line up of speakers including Nobel laureates, industry giants and break-through researchers. Accordingly, it maintains stringent reviewing standards with only the biggest breakthroughs typically being accepted. UTS has played significant role in the continuing success of the QIP conferences, QIP 2015 was hosted by the Quantum Computation Laboratory in the UTS Centre for Quantum Computation and Intelligent Systems, the precursor to the new UTS:QSI.
With 9 talks out of the total of 58 that were accepted for QIP 2017, the UTS:QSI has this year firmly established itself as a major international influence in the theoretical quantum information sciences. Even more pleasing is that this success has been shared by early career researchers from the UTS:QSI. The paper “Exponential separation between quantum communication complexity and classical information complexity” by Dr Nengkun Yu and his co-authors from Singapore, Waterloo, and Maryland had the distinction of being chosen as one of only 6 plenary talks. PhD students Xin Wang and Wei Xie, working together with Prof Runyao Duan, had the talks “Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility” and “Semidefinite programming strong converse bounds for quantum channel capacities” accepted. Also noteworthy was Prof Michael Bremner’s joint research project with industrial collaborators at Google, “Characterizing Quantum Supremacy in Near-Term Devices”.
The complete list of UTS:QSI accepted talks is:
- “Characterizing Quantum Supremacy in Near-Term Devices,” Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J. Bremner, John M. Martinis, and Hartmut Neven
- “Semidefinite programming strong converse bounds for classical capacity,” Xin Wang, Wei Xie, Runyao Duan
- “Asymptotic entanglement manipulation under PPT operations: new SDP bounds and irreversibility” Xin Wang and Runyao Duan
- “Round Complexity in the Local Transformations of Quantum and Classical States,” Eric Chitambar and Min-Hsiu Hsieh
- “Zero-knowledge proof systems for QMA,” Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous
- “Compression of Quantum Multi-Prover Interactive Proofs,” Zhengfeng Ji
- “Exponential separation between quantum communication complexity and classical information complexity,” Anurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu
- “Multivariate Trace Inequalities,” David Sutter, Mario Berta, Marco Tomamichel
- “Converse bounds for private communication over quantum channels,” Mark M. Wilde, Marco Tomamichel, Mario Berta
