Search results
Results: 84
Number of items: 84
-
van Apeldoorn, J., Gribling, S., Li, Y., Nieuwboer, H., Walter, M., & de Wolf, R. (2021). Quantum algorithms for matrix scaling and matrix balancing. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming: ICALP 2021, July 12–16, 2021, Glasgow, Scotland ((Virtual Conference) Article 110 (Leibniz International Proceedings in Informatics; Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.110 -
Linden, N., & de Wolf, R. (2021). Lightweight detection of a small number of large errors in a quantum circuit. Quantum, 5, Article 436. https://doi.org/10.22331/q-2021-04-20-436 -
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020). Quantum SDP-Solvers: Better upper and lower bounds. Quantum - the open journal for quantum science, 4, Article 230. https://doi.org/10.22331/q-2020-02-14-230 -
Arunachalam, S., Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., & de Wolf, R. (2020). Quantum Coupon Collector. In S. T. Flammia (Ed.), 15th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2020, June 9-12, 2020, Riga, Latvia Article 10 (Leibniz International Proceedings in Informatics; Vol. 158). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2020.10 -
Arunachalam, S., Chakraborty, S., Koucký, M., Saurabh, N., & de Wolf, R. (2020). Improved bounds on Fourier entropy and Min-entropy. In C. Paul, & M. Bläser (Eds.), 37th International Symposium on Theoretical Aspects of Computer Science: STACS 2020, March 10-13, 2020, Montpellier, France Article 45 (Leibniz International Proceedings in Informatics; Vol. 154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2020.45 -
van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2020). Convex optimization using quantum oracles. Quantum - the open journal for quantum science, 4, Article 220. https://doi.org/10.22331/q-2020-01-13-220 -
Apers, S., & de Wolf, R. (2020). Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science: FOCS 2020 : proceedings : 16-19 November 2020, virtual conference (pp. 637-648). IEEE. https://doi.org/10.1109/FOCS46700.2020.00065 -
Sinha, M., & de Wolf, R. (2019). Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science: proceedings : 9-12 November, 2019, Baltimore, Maryland (pp. 966-981). (FOCS). IEEE Computer Society. https://doi.org/10.1109/FOCS.2019.00062
Page 2 of 9