Search results
Results: 24
Number of items: 24
-
Cornelissen, A., Jeffery, S., Ozols, M., & Piedrafita, A. (2020). Span programs and quantum time complexity. In J. Esparza, & D. Král' (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science: MFCS 2020, August 25–26, 2020, Prague, Czech Republic Article 26 (Leibniz International Proceedings in Informatics; Vol. 170). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.26 -
Peng, T., Harrow, A. W., Ozols, M., & Wu, X. (2020). Simulating large quantum circuits on a small quantum computer. Physical Review Letters, 125(15), Article 150504. https://doi.org/10.48550/arXiv.1904.00102, https://doi.org/10.1103/PhysRevLett.125.150504 -
Bouland, A., & Ozols, M. (2018). Trading inverses for an irrep in the Solovay-Kitaev theorem. In S. Jeffery (Ed.), 13th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2018, July 16-18, 2018, Sydney, Australia Article 6 (Leibniz International Proceedings in Informatics; Vol. 111). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2018.6 -
Bausch, J., Cubitt, T., & Ozols, M. (2017). The complexity of translationally invariant spin chains with low local dimension. Annales Henri Poincaré, 18(11), 3449-3513. https://doi.org/10.48550/arXiv.1605.01718, https://doi.org/10.1007/s00023-017-0609-7
Page 3 of 3