I am a fourth year computer science Ph.D. student at The University of Texas at Austin co-advised by David Soloveichik and Scott Aaronson. I am broadly interested in theoretical computer science with a focus on (1) time-space lower bounds for classical and quantum computation and (2) constructions, algorithms and impossibility results for quantum, reversible, molecular, and other kinds of unconventional computational models.
My primary non-academic interests include eurogames, competitive card games, and hiking.
You can reach me at nielskorneruputexas.edu.
Quantum Time-Space Tradeoffs for Matrix Problems [arXiv]
Paul Beame, Niels Kornerup, Michael Whitmeyer arXiv preprint arXiv:2401.05321 (2024).
-- Accepted to STOC 2024
Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements [arXiv]
Niels Kornerup, Jonathan Sadun, and David Soloveichik. arXiv preprint arXiv:2110.08973 (2024).
-- Appeared as a poster at QIP 2022
Harvesting Brownian Motion: Zero Energy Computational Sampling [arXiv]
David Doty, Niels Kornerup, Austin Luchsinger, Leo Orshansky, David Soloveichik, and Damien Woods. arXiv preprint arXiv:2309.06957 (2023).
-- Best poster/presentation award DNA29
Cumulative Memory Lower Bounds for Randomized and Quantum Computation [ICALP 2023] [full paper]
Paul Beame and Niels Kornerup. 50th International Colloquium on Automata, Languages, and Programming (2023).
Composable Rate-Independent Computation in Continuous Chemical Reaction Networks [link] [undergraduate thesis] [arXiv]
Cameron Chalk, Niels Kornerup, Wyatt Reeves, and David Soloveichik. IEEE/ACM Transactions on Computational Biology and Bioinformatics (2021).
-- Best paper award CMSB 2018, best undergraduate thesis award at the University of Texas at Austin 2020
Review of a Quantum Algorithm for Betti Numbers [arXiv]
Sam Gunn and Niels Kornerup. arXiv preprint arXiv:1906.07673 (2019).