{\rtf1\ansi\deff0\deftab360 {\fonttbl {\f0\fswiss\fcharset0 Arial} {\f1\froman\fcharset0 Times New Roman} {\f2\fswiss\fcharset0 Verdana} {\f3\froman\fcharset2 Symbol} } {\colortbl; \red0\green0\blue0; } {\info {\author Biblio 7.x}{\operator }{\title Biblio RTF Export}} \f1\fs24 \paperw11907\paperh16839 \pgncont\pgndec\pgnstarts1\pgnrestart A. Munson, Kothakonda, N. Bhavya Tej, Haferkamp, J., Halpern, N. Yunger, Eisert, J., and Faist, P., ?Complexity-constrained quantum thermodynamics?, 2024.\par \par M. Ringbauer, Hinsche, M., Feldker, T., Faehrmann, P. K., Bermejo-Vega, J., Edmunds, C., Postler, L., Stricker, R., Marciniak, C. D., Meth, M., Pogorelov, I., Blatt, R., Schindler, P., Eisert, J., Monz, T., and Hangleiter, D., ?Verifiable measurement-based quantum random sampling with trapped ions?, 2023.\par \par D. Hangleiter and Eisert, J., ?Computational advantage of quantum random sampling?, 2022.\par \par J. Haferkamp, Faist, P., Kothakonda, N. B. T., Eisert, J., and Halpern, N. Yunger, ?Linear growth of quantum circuit complexity?, Nat. Phys., 2022.\par \par A. Deshpande, Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., Hangleiter, D., Fefferman, B., and Dhand, I., ?Quantum computational advantage via high-dimensional Gaussian boson sampling?, Science Advances, vol. 8, p. eabi7894, 2022.\par \par N. Yunger Halpern, Kothakonda, N. B. T., Haferkamp, J., Munson, A., Eisert, J., and Faist, P., ?Resource theory of quantum uncomplexity?, Physical Review A, vol. 106, 2022.\par \par M. Hinsche, Ioannou, M., Nietner, A., Haferkamp, J., Quek, Y., Hangleiter, D., Seifert, J. - P., Eisert, J., and Sweke, R., ?A single T-gate makes distribution learning hard?, 2022.\par \par M. Hinsche, Ioannou, M., Nietner, A., Haferkamp, J., Quek, Y., Hangleiter, D., Seifert, J. - P., Eisert, J., and Sweke, R., ?Learnability of the output distributions of local quantum circuits?, 2021.\par \par D. Hangleiter, Roth, I., Eisert, J., and Roushan, P., ?Precise Hamiltonian identification of a superconducting quantum processor?, 2021.\par \par A. Deshpande, Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., Hangleiter, D., Fefferman, B., and Dhand, I., ?Quantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling?, 2021.\par \par N. Yunger Halpern, Kothakonda, N. B. T., Haferkamp, J., Munson, A., Eisert, J., and Faist, P., ?Resource theory of quantum uncomplexity?, 2021.\par \par I. Roth, Kueng, R., Kimmel, S., Liu, Y. - K., Gross, D., Eisert, J., and Kliesch, M., ?Recovering quantum gates from few average gate fidelities?, Phys. Rev. Lett. , vol. 121, p. 170502, 2018.\par \par S. T. Flammia, Gross, D., Liu, Y. - K., and Eisert, J., ?Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators?, New Journal of Physics, vol. 14, no. 9, p. 095022, 2012.\par \par M. Ohliger, Nesme, V., Gross, D., Liu, Y. - K., and Eisert, J., ?Continuous-variable quantum compressed sensing?, 2011.\par \par 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.\par \par }