49 citations · 49 across the 3 of their papers we have counts for
3 papers
cs.PL2026
Emulation-Completeness of Programming Languages
Gregory Morse, Tamás Kozsik
We study when a programming language can emulate programs written in that same language without delegating the guest program back to the host evaluator or compiler. We call this pr…
quant-ph2021
Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
Ágoston Kaposi, Zoltán Kolarovszki, Tamás Kozsik +2
Evaluating the Torontonian function is a central computational challenge in the simulation of Gaussian Boson Sampling (GBS) with threshold detection. In this work, we propose a rec…
quant-ph2020★ 49 cited
Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
Zsolt Tabi, Kareem H. El-Safty, Zsófia Kallus +4
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We…