1. Research
  2. Publications

Publications

Journal Article
M. Coudron and Menda, S., “Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)”, Accepted to the Symposium on the Theory of Computing (STOC) 2020 conference, 2020.
A. Singh Arora, Bharti, K., Cojocaru, A., and Coladangelo, A., “A computational test of quantum contextuality, and even simpler proofs of quantumness”, FOCS 2024 Accepted Paper, 2024.
H. Fu, Wang, D., and Zhao, Q., “Computational self-testing of multi-qubit states and measurements”, 2022.
J. Bermejo-Vega, Lin, C. Yen- Yu, and Van den Nest, M., “The computational power of normalizer circuits over black-box groups”, 2014.
D. J. Brod and Childs, A. M., “The computational power of matchgates and the XY interaction on arbitrary graphs”, Quantum Information and Computation, vol. 14, no. 11-12, pp. 901-916, 2014.
Y. - H. Chen, Chung, K. - M., Lai, C. - Y., Vadhan, S. P., and Wu, X., “Computational Notions of Quantum Min-Entropy”, 2017.
D. Hangleiter and Eisert, J., “Computational advantage of quantum random sampling”, 2022.
A. Seif, Hafezi, M., and Liu, Y. - K., “Compressed Sensing Measurement of Long-Range Correlated Noise”, 2021.
M. Gullans, Caranti, M., Mills, A. R., and Petta, J. R., “Compressed gate characterization for quantum devices with time-correlated noise”, 2023.
A. Munson, Kothakonda, N. Bhavya Tej, Haferkamp, J., Halpern, N. Yunger, Eisert, J., and Faist, P., “Complexity-constrained quantum thermodynamics”, 2024.
N. Maskara, Deshpande, A., Tran, M. C., Ehrenberg, A., Fefferman, B., and Gorshkov, A. V., “Complexity phase diagram for interacting and long-range bosonic Hamiltonians”, 2019.
A. M. Childs, Gosset, D., and Webb, Z., “Complexity of the XY antiferromagnet at fixed magnetization”, Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
Y. - K. Liu, “The Complexity of the Consistency and N-representability Problems for Quantum States”, 2007.
A. Deshpande, Fefferman, B., Foss-Feig, M., and Gorshkov, A. V., “Complexity of sampling as an order parameter”, 2017.
O. Shtanko, Deshpande, A., Julienne, P. S., and Gorshkov, A. V., “Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing”, PRX Quantum, vol. 2, 2021.
J. Yi, Ye, W., Gottesman, D., and Liu, Z. - W., “Complexity and order in approximate quantum error-correcting codes”, Nature Physics, 2024.
B. Fefferman and Lin, C. Yen- Yu, “A Complete Characterization of Unitary Quantum Space”, 2016.
C. Figgatt, Maslov, D., Landsman, K. A., Linke, N. M., Debnath, S., and Monroe, C., “Complete 3-Qubit Grover Search on a Programmable Quantum Computer”, Nature Communications, accepted, 2017.
F. J. Marmolejo-Cossío, Brigham, E., Sela, B., and Katz, J., “Competing (Semi)-Selfish Miners in Bitcoin”, 2019.
D. Carney, Müller, H., and Taylor, J. M., “Comment on "Using an atom interferometer to infer gravitational entanglement generation''”, 2021.
J. Chen, Ji, Z., Ruskai, M. Beth, Zeng, B., and Zhou, D. - L., “Comment on some results of Erdahl and the convex structure of reduced density matrices”, Journal of Mathematical Physics, vol. 53, no. 7, p. 072203, 2012.
Z. - X. Gong and Duan, L. - M., “Comment on "Foundation of Statistical Mechanics under Experimentally Realistic Conditions" ”, 2011.
S. Guo, Koh, S. M., Fritsch, A. R., Spielman, I. B., and Zwolak, J. P., “Combining machine learning with physics: A framework for tracking and sorting multiple dark solitons”, Phys. Rev. Research, vol. 4, p. 023163 , 2022.
M. P. Zaletel, Lukin, M., Monroe, C., Nayak, C., Wilczek, F., and Yao, N. Y., “Colloquium: Quantum and Classical Discrete Time Crystals”, 2023.
J. P. Zwolak and Taylor, J. M., “Colloquium: Advances in automation of quantum dot devices control”, Reviews of Modern Physics, vol. 95, 2023.