QuICS Research Featured in Seven Talks at Quantum Information Conference

January 14, 2019

For the second year running, researchers from the Joint Center for Quantum Information and Computer Science (QuICS) have seven papers accepted for talks at QIP, the annual Conference on Quantum Information Processing.

This year’s meeting is the 22nd installment of QIP, and features talks and poster presentations from many of the world’s leading researchers in theoretical quantum information. The conference runs from Jan. 14–18 at the University of Colorado Boulder.

“Less than five years since QuICS was launched, the center already has a tradition of consistently producing research results that are featured in the top venues in the field,” says Andrew Childs, a professor of computer science and co-director of QuICS.

Childs, one of numerous QuICS researchers with a paper accepted, adds that “[QuICS] can be especially proud of the diversity of top research going on here, from quantum Shannon theory to quantum algorithms and complexity to quantum information as a lens on basic physics.”

Childs, working with Xiaodi Wu, an assistant professor of computer science and QuICS Fellow, as well as QuICS graduate students Shouvanik Chakrabarti and Tongyang Li, submitted work on a new quantum algorithm for convex optimization.

Their paper describes how to use a quantum computer to achieve a quadratic speedup over the leading classical algorithm, and it also proves a lower bound on the minimum number of steps that any quantum algorithm would need to take to solve convex optimization problems in general.

Their conference talk will combine the QuICS work with related work from a group at QuSoft in the Netherlands.

Xin Wang, one of two new QuICS Hartree Postdoctoral Fellows, also had joint work accepted that focused on calculating the amount of entanglement it takes to prepare a quantum state or implement a quantum channel.

“This work solves a question that has remained open since the inception of entanglement theory over two decades ago,” Wang says. It answers that question in the affirmative by introducing the first measure of quantum entanglement that is both efficiently computable and operationally meaningful.

Over the past year, many researchers have worked to find useful tasks for the small, noisy quantum computers that are becoming more readily available, both commercially and in the lab. “Ultimately we want to use quantum computers to solve hard problems, but most quantum programs cannot be run on current or near-term quantum computers because the devices are too error-prone,” says Brian Swingle, an assistant professor of physics and QuICS Fellow who also had a paper accepted at QIP.

Together with a coauthor, Swingle proposed a method for studying interacting quantum many-body systems that makes natural use of quantum computers and, to a degree, resists errors. “Our quantum programs are good candidates for use on near-term quantum devices and may yield results that advance our understanding of physics,” Swingle says.

Several other papers with current and recent QuICS coauthors (bolded below) were accepted for talks at QIP.  

•     Quantum Supremacy and the Complexity of Random Circuit Sampling, Adam Bouland, Bill Fefferman, Chinmay Nirkhe and Umesh V. Vazirani

•     Quantum SDP Solvers: New Input Models, Improved Algorithms, and Applications, Joran van Apeldoorn, Fernando Brandão, Andras Pal Gilyen, Amir KalevTongyang LiCedric Yen-Yu Lin, Krysta M. Svore and Xiaodi Wu

•     Recovering quantum gates from few average gate fidelities, Ingo Roth, Richard Kueng, Shelby KimmelYi-Kai Liu, David Gross, Jens Eisert and Martin Kliesch

•     Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, Andras Pal Gilyen, Yuan Su, Guang Hao Low and Nathan Wiebe

QuICS is a partnership between the University of Maryland and the National Institute of Standards and Technology. It is one of seven major centers in the University of Maryland Institute for Advanced Computer Studies.

—Story by Chris Cesare