Yi-Kai Liu

yi-kai-liu's picture
Adjunct Associate Professor
yi-kai.liu@nist.gov
3100J Atlantic Building
(301) 314-1850
Website

Yi-Kai Liu is an Adjunct Associate Professor in the University of Maryland Institute for Advanced Computer Studies (UMIACS) and a staff scientist in the Applied and Computational Mathematics Division at the National Institutes of Standards and Technology (NIST). Liu's research centers on quantum computation, in particular, quantum algorithms and complexity, quantum state tomography and cryptography. He also works on related topics in compressed sensing and machine learning. He received his doctorate in computer science from the University of California, San Diego in 2007.

Publications

2010

M. Cramer, Plenio, M. B., Flammia, S. T., Gross, D., Bartlett, S. D., Somma, R., Landon-Cardinal, O., Liu, Y. - K., and Poulin, D., “Efficient quantum state tomography”, Nature Communications, vol. 1, no. 9, p. 149, 2010.
A. Ambainis, Childs, A. M., and Liu, Y. - K., “Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010.
D. Gross, Liu, Y. - K., Flammia, S. T., Becker, S., and Eisert, J., “Quantum state tomography via compressed sensing”, Physical Review Letters, vol. 105, no. 15, 2010.
O. Landon-Cardinal, Liu, Y. - K., and Poulin, D., “Efficient Direct Tomography for Matrix Product States”, 2010.

2009

Y. - K. Liu, “Quantum Algorithms Using the Curvelet Transform”, Proc. ACM Symposium on Theory of Computing (STOC), pp. 391-400, 2009.

2007

Y. - K. Liu, “The Complexity of the Consistency and N-representability Problems for Quantum States”, 2007.
Y. - K. Liu, “The Local Consistency Problem for Stoquastic and 1-D Quantum Systems”, 2007.
Y. - K. Liu, Christandl, M., and Verstraete, F., “N-representability is QMA-complete”, Phys. Rev. Lett., vol. 98, no. 11, 2007.

2006

Y. - K. Liu, “Consistency of Local Density Matrices is QMA-complete”, Proc. RANDOM , pp. 438-449, 2006.
Y. - K. Liu, “Gibbs States and the Consistency of Local Density Matrices”, 2006.
Y. - K. Liu, Lyubashevsky, V., and Micciancio, D., “On Bounded Distance Decoding for General Lattices”, Proc. RANDOM, pp. 450-461, 2006.

2005

A. Blanc, Liu, Y. - K., and Vahda, A., “Designing Incentives for Peer-to-Peer Routing”, Proc. INFOCOM, pp. 374-385, 2005.