(photo credit: John Whittle, CC license)
(photo credit:
John Whittle,
CC license)
NEW: I'm teaching CS138 Computer Algorithms in Spring 2009.
I am a postdoctoral researcher at the Institute for Quantum Information at Caltech. I am working on quantum computation, in particular, quantum algorithms and complexity. I'm also generally interested in theoretical computer science and machine learning. You can reach me via e-mail at: yikailiu (at) caltech (dot) edu
I am supported by an NSF Mathematical Sciences Postdoctoral Research Fellowship. (Thank you, NSF!)
This page was last updated on: Sept. 20, 2009.
Also, you can still visit my old home page.
N-representability is QMA-complete (joint work with M. Christandl and F. Verstraete), Workshop on Quantum Marginals and Density Matrices, Fields Institute, July 2009.
Quantum Algorithms Using the Curvelet Transform, STOC 2009.
D. Gross, Y.-K. Liu, S.T. Flammia, S. Becker and J. Eisert, "Quantum state tomography via compressed sensing," ArXiv:0909.3304.
Y.-K. Liu, "Quantum Algorithms Using the Curvelet Transform," Proc. ACM Symposium on Theory of Computing (STOC), pp.391-400, 2009. ArXiv:0810.4968.
Y.-K. Liu, "The Local Consistency Problem for Stoquastic and 1-D Quantum Systems," submitted. ArXiv:0712.1388.
PhD thesis: Y.-K. Liu, "The Complexity of the Consistency and N-representability Problems for Quantum States," ArXiv:0712.3041.
Y.-K. Liu, M. Christandl and F. Verstraete, "N-representability is QMA-complete," Phys. Rev. Lett. 98, 110503 (2007) [link]; Arxiv preprint: quant-ph/0609125.
Y.-K. Liu, "Consistency of Local Density Matrices is QMA-complete," Proc. RANDOM 2006, pp.438-449; Arxiv preprint: quant-ph/0604166.
Y.-K. Liu, V. Lyubashevsky and D. Micciancio, "On Bounded Distance Decoding for General Lattices," Proc. RANDOM 2006, pp.450-461.
Y.-K. Liu, "Gibbs States and the Consistency of Local Density
Matrices," Arxiv preprint:
quant-ph/0603012.
Previously presented as a poster
at the SQuInT workshop, Albuquerque, NM, Feb. 17-19, 2006.
K. Levchenko and Y.-K. Liu, "Counting Solutions of Polynomial Equations"
[pdf].
A note, pointing out an error in the paper: "Improved Range-Summable
Random Variable Construction Algorithms," by A. R. Calderbank et al,
SODA 2005.
A. Blanc, Y.-K. Liu and A. Vahdat, "Designing Incentives for
Peer-to-Peer Routing," Proc. INFOCOM 2005, pp.374-385
[pdf].
A preliminary version appeared in P2PEcon 2004
[link]
(but we recommend the INFOCOM paper, which has more results and a better
discussion section).
Undergraduate senior thesis: original version or revised version (Aug. 26, 2002).
IQI Seminars
Physics
Research Conference
CS Theory
Seminar
IST Seminars
Technique (campus guide)