activity
20202022
collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2023

-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks

Matteo Allaix, Yuxiang Lu, Yuhang Yao +3

Linear computations over quantum many-to-one communication networks offer opportunities for communication cost improvements through schemes that exploit quantum entanglement among…

cs.IT2022

Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes

Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti +1

In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous…

cs.IT2021

On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers

Matteo Allaix, Seunghoan Song, Lukas Holzbaur +3

In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file.…

cs.IT2021

High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes

Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1

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 identit…

cs.IT2020

Quantum Private Information Retrieval from Coded and Colluding Servers

Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1

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 identit…