Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption

Wei-Kai Lin, Zhenghao Lu, Hong-Sheng Zhou

Published Dec 1, 2025• 2 citations
Publisher
DOI
10.1007/978-3-032-12287-2_3

Related papers

Pseudorandom Correlation Functions for Garbled Circuits

Geoffroy Couteau, Srinivas Devadas, Alexander Koch +1 more

Lecture notes in computer science•Dec 1, 2025•0 citations

Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts

David Heath, Vladimir Kolesnikov, Lucien K. L. Ng

Lecture notes in computer science•Jan 1, 2024•14 citations

Combining Oblivious Pseudorandom Functions

Sebastian Faller, Marc Fischlin, Julius Hardt +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions

Rajiv Krishnakumar, Mathias Soeken, Martin Roetteler +1 more

In this paper, we present Q# implementations for arbitrary single-variabled fixed-point arithmetic op-erations for a gate-based quantum computer based on lookup tables (LUTs). In general, this is an inefficent way of implementing a function since the number of inputs can be large or even infinite. However, if the input domain can be bounded and there can be some error tolerance in the output (both of which are often the case in practical use-cases), the quantum LUT implementation of certain quantum arithmetic functions can be more efficient than their corresponding reversible arithmetic implementations. We discuss the implementation of the LUT using Q# and its approximation errors. We then show examples of how to use the LUT to implement quantum arithmetic functions and compare the resources required for the implementation with the current state-of-the-art bespoke implementations of some commonly used arithmetic functions. The implementation of the LUT is designed for use by practitioners to use when implementing end-to-end quantum algorithms. In addition, given its well-defined approximation errors, the LUT implementation makes for a clear benchmark for evaluating the efficiency of bespoke quantum arithmetic circuits.

arXiv:2210.11786•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2022•4 citations

Pseudorandomness with Proof of Destruction and Applications

Amit Behera, Zvika Brakerski, Or Sattath +1 more

Lecture notes in computer science•Jan 1, 2023•14 citations

Composable Oblivious Pseudo-random Functions via Garbled Circuits

Sebastian Faller, Astrid Ottenhues, Johannes Ottenhues

Lecture notes in computer science•Jan 1, 2023•17 citations
In this paper, we present Q# implementations for arbitrary single-variabled fixed-point arithmetic op-erations for a gate-based quantum computer based on lookup tables (LUTs). In general, this is an inefficent way of implementing a function since the number of inputs can be large or even infinite. However, if the input domain can be bounded and there can be some error tolerance in the output (both of which are often the case in practical use-cases), the quantum LUT implementation of certain quantum arithmetic functions can be more efficient than their corresponding reversible arithmetic implementations. We discuss the implementation of the LUT using Q# and its approximation errors. We then show examples of how to use the LUT to implement quantum arithmetic functions and compare the resources required for the implementation with the current state-of-the-art bespoke implementations of some commonly used arithmetic functions. The implementation of the LUT is designed for use by practitioners to use when implementing end-to-end quantum algorithms. In addition, given its well-defined approximation errors, the LUT implementation makes for a clear benchmark for evaluating the efficiency of bespoke quantum arithmetic circuits.