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

Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts

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

Published Jan 1, 2024• 14 citations
Publisher
DOI
10.1007/978-3-031-58740-5_7

Related papers

Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption

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

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

Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits

Huige Wang, Kefei Chen, Joseph K. Liu +1 more

Lecture notes in computer science•Jan 1, 2018•3 citations

Garbled Circuits via Structured Encryption

Seny Kamara, Lei Wei

Lecture notes in computer science•Jan 1, 2013•11 citations

Unified architecture for quantum lookup tables

Shuchen Zhu, Aarthi Sundaram, Guang Hao Low

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the boolean circuit for a classical lookup table. We present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

arXiv:2406.18030•Physical Review Research•Dec 1, 2025•14 citations

Toss: Garbled PIR from Table-Only Stacking

Lucien K. L. Ng, Vladimir Kolesnikov

Garbled Circuits (GC) is a foundational primitive for secure two-party computation (2PC). Garbled Private Information Retrieval (GPIR) is a GC technique for looking up a public array or database (DB) on a private index unknown to either player. GPIR immediately implies GC evaluation of functions implemented as a publicly known look-up table (LUT).

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 19, 2025•2 citations

Efficient Secure Computation with Garbled Circuits

Yan Huang, Chih-Hao Shen, David Evans +2 more

Lecture notes in computer science•Jan 1, 2011•146 citations
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the boolean circuit for a classical lookup table. We present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.