no code implementations • 28 Jun 2021 • Matteo Allaix, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, Camilla Hollanti
A general statement on the converse bound for QPIR with coded and colluding servers is derived showing that the capacities of stabilizer QPIR and dimension-squared QPIR induced from any class of PIR are upper bounded by twice the classical capacity of the respective PIR class.
no code implementations • 24 Feb 2021 • Tefjol Pllaha, Olav Tirkkonen, Robert Calderbank
We describe in details the interplay between binary symplectic geometry and quantum computation, with the ultimate goal of constructing highly structured codebooks.
Information Theory Information Theory
no code implementations • 4 Feb 2021 • Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data.
no code implementations • 16 Jan 2020 • Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data.