Cedric Lin | QuICS

Hartree Postdoctoral Fellow (2015-2017)

cedricl@umiacs.umd.edu

3100N Atlantic Building

(301) 314-1844

Cedric Lin was a QuICS Hartree Postdoctoral Fellow in quantum information. His research was in quantum algorithms and quantum complexity. Lin seeked to understand the circumstances that allow quantum computers to outperform classical ones. He has studied restricted models of quantum computation, such as the bomb query model and the normalizer circuit model. By focusing on particular aspects of quantum computation, these models have lead to better understanding of current quantum algorithms, and insight in designing future ones. Lin received his doctoral degree in physics from MIT in 2015. After QuICS, he continued on as a software engineer at Google.

Publications

2018

F. G. S. L. Brandão, Kalev, A., Li, T., Lin, C. Yen- Yu, Svore, K. M., and Wu, X., “Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning”, To appear at the 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), 2018.

2017

F. G. S. L. Brandão, Kalev, A., Li, T., Lin, C. Yen- Yu, Svore, K. M., and Wu, X., “Exponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning”, 2017.

S. Kimmel, Lin, C. Yen- Yu, Low, G. Hao, Ozols, M., and Yoder, T. J., “Hamiltonian Simulation with Optimal Sample Complexity”, npj Quantum Information, vol. 13, no. 3, 2017.

A. W. Harrow, Lin, C. Yen- Yu, and Montanaro, A., “Sequential measurements, disturbance and property testing”, Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 1598-1611, 2017.

2016

C. Yen- Yu Lin and Lin, H. - H., “Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester”, Theory of Computing, vol. 12, no. 18, pp. 1-35, 2016.

B. Fefferman, Kobayashi, H., Lin, C. Yen- Yu, Morimae, T., and Nishimura, H., “Space-Efficient Error Reduction for Unitary Quantum Computations”, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 14:1--14:14, 2016.

B. Fefferman and Lin, C. Yen- Yu, “A Complete Characterization of Unitary Quantum Space”, 2016.

C. Yen- Yu Lin and Zhu, Y., “Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree”, 2016.

B. Fefferman and Lin, C. Yen- Yu, “Quantum Merlin Arthur with Exponentially Small Gap”, 2016.

2015

S. Kimmel, Lin, C. Yen- Yu, and Lin, H. - H., “Oracles with Costs”, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015), vol. 44, pp. 1-26, 2015.

2014

J. Bermejo-Vega, Lin, C. Yen- Yu, and Van den Nest, M., “The computational power of normalizer circuits over black-box groups”, 2014.

J. Bermejo-Vega, Lin, C. Yen- Yu, and Van den Nest, M., “Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems ”, 2014.

E. Crosson, Farhi, E., Lin, C. Yen- Yu, Lin, H. - H., and Shor, P., “Different Strategies for Optimization Using the Quantum Adiabatic Algorithm ”, 2014.