Florian Speelman

50 papers A* 2A 7Journal 32Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	A Quantum Cloning Game with Applications to Quantum Position Verification. TQC Léo Colisson Palais, Llorenç Escolà-Farràs, Florian Speelman
2025	A*	`conf`	Enhancing Position Verification in Multi-Node Quantum Networks. INFOCOM Ziyan Zhang, Florian Speelman, Paola Grosso
2025	J	`jnl`	Fine-Grained Complexity via Quantum Natural Proofs. CoRR Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2025	A	`conf`	Fully Characterizing Lossy Catalytic Computation. ITCS Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker
2025	J	`jnl`	Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography. Quantum Llorenç Escolà-Farràs, Florian Speelman
2025	A	`conf`	QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More. APPROX/RANDOM Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2025	—	`conf`	Quantum Catalytic Space. TQC Harry Buhrman, Marten Folkertsma, Ian Mertz, Florian Speelman, Sergii Strelchuk, Sathyawageeswar Subramanian, Quinten Tupker
2024	J	`jnl`	A Quantum Computing Approach for Multi-robot Coverage Path Planning. CoRR Poojith U. Rao, Florian Speelman, Balwinder Sodhi, Sachin Kinge
2024	J	`jnl`	An efficient combination of quantum error correction and authentication. IACR Commun. Cryptol. Yfke Dulek, Garazi Muguruza, Florian Speelman
2024	J	`jnl`	Fully Characterizing Lossy Catalytic Computation. CoRR Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker
2024	J	`jnl`	Fully Characterizing Lossy Catalytic Computation. Electron. Colloquium Comput. Complex. Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker
2024	J	`jnl`	Port-Based State Preparation and Applications. Quantum Garazi Muguruza, Florian Speelman
2024	J	`jnl`	Relating non-local quantum computation to information theoretic cryptography. Quantum Rene Allerstorfer, Harry Buhrman, Alex May, Florian Speelman, Philip Verduyn Lunel
2024	J	`jnl`	Toward Complete Quantum Network Stacks: A Survey. IEEE Netw. Ziyan Zhang, Chrysa Papagianni, Florian Speelman, Paola Grosso
2023	—	`conf`	Oblivious Transfer from Zero-Knowledge Proofs - Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. ASIACRYPT (8) Léo Colisson, Garazi Muguruza, Florian Speelman
2023	J	`jnl`	Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. CoRR Léo Colisson, Garazi Muguruza, Florian Speelman
2023	J	`jnl`	Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. IACR Cryptol. ePrint Arch. Léo Colisson, Garazi Muguruza, Florian Speelman
2023	J	`jnl`	QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more. CoRR Yanlin Chen, Yilei Chen, Rajendra Kumar, Subhasree Patro, Florian Speelman
2022	J	`jnl`	An efficient combination of quantum error correction and authentication. CoRR Yfke Dulek, Garazi Muguruza, Florian Speelman
2022	A	`conf`	Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. ITCS Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2022	J	`jnl`	Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture. CoRR Andris Ambainis, Harry Buhrman, Koen Leijnse, Subhasree Patro, Florian Speelman
2022	—	`conf`	Memory Compression with Quantum Random-Access Gates. TQC Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2022	J	`jnl`	Memory Compression with Quantum Random-Access Gates. CoRR Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2022	J	`jnl`	Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum Jordi R. Weggemans, Alexander Urech, Alexander Rausch, Robert J. C. Spreeuw, Richard J. Boucherie, Florian Schreck, Kareljan Schoutens, Jirí Minár, Florian Speelman
2021	A	`conf`	A Framework of Quantum Strong Exponential-Time Hypotheses. STACS Harry Buhrman, Subhasree Patro, Florian Speelman
2021	J	`jnl`	A Guide for New Program Committee Members at Theoretical Computer Science Conferences. CoRR Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Florian Speelman, Ronald de Wolf
2021	J	`jnl`	Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. CoRR Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman
2021	J	`jnl`	Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks. CoRR Andreas Bluhm, Matthias Christandl, Florian Speelman
2019	J	`jnl`	The Quantum Strong Exponential-Time Hypothesis. CoRR Harry Buhrman, Subhasree Patro, Florian Speelman
2018	J	`jnl`	Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2018	—	`conf`	Quantum Ciphertext Authentication and Key Recycling with the Trap Code. TQC Yfke Dulek, Florian Speelman
2018	J	`jnl`	Quantum Homomorphic Encryption for Polynomial-Size Circuits. Theory Comput. Yfke Dulek, Christian Schaffner, Florian Speelman
2018	J	`jnl`	Quantum ciphertext authentication and key recycling with the trap code. CoRR Yfke Dulek, Florian Speelman
2018	J	`jnl`	Round elimination in exact communication complexity. CoRR Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
2017	J	`jnl`	Quantum Fully Homomorphic Encryption With Verification. CoRR Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman
2017	—	`conf`	Quantum Fully Homomorphic Encryption with Verification. ASIACRYPT (1) Gorjan Alagic, Yfke Dulek, Christian Schaffner, Florian Speelman
2016	A	`conf`	Catalytic Space: Non-determinism and Hierarchy. STACS Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2016	—	`conf`	Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits. TQC Florian Speelman
2016	—	`conf`	Quantum Homomorphic Encryption for Polynomial-Sized Circuits. CRYPTO (3) Yfke Dulek, Christian Schaffner, Florian Speelman
2016	J	`jnl`	Quantum homomorphic encryption for polynomial-sized circuits. CoRR Yfke Dulek, Christian Schaffner, Florian Speelman
2016	J	`jnl`	Quantum homomorphic encryption for polynomial-sized circuits. IACR Cryptol. ePrint Arch. Yfke Dulek, Christian Schaffner, Florian Speelman
2016	J	`jnl`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin
2015	—	`conf`	Round Elimination in Exact Communication Complexity. TQC Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman
2014	J	`jnl`	Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2014	A*	`conf`	Computing with a full memory: catalytic space. STOC Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2013	A	`conf`	The garden-hose model. ITCS Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman
2013	A	`conf`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin
2012	J	`jnl`	Position-Based Quantum Cryptography and the Garden-Hose Game CoRR Florian Speelman
2012	J	`jnl`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2011	J	`jnl`	The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography CoRR Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman