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

Modeling Information Sources and Replicated Data in Quantum Contexts

David Bernal‐Casas, Josep Maria Oller

Published Jul 30, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.23687.56487

Related papers

Modeling Quantum Information

Marco Tomamichel

SpringerBriefs in mathematical physics•Oct 8, 2015•3 citations

Dual-Source Symmetric PIR Without Data Replication or Shared Randomness

Rémi A. Chou

Information-theoretically secure Symmetric Private Information Retrieval (SPIR) is known to be infeasible over noiseless channels with a single server. Previous solutions in-volved additional resources such as database replication, shared randomness, or noisy channels. This paper demonstrates that, using a noiseless multiple access channel, SPIR with information-theoretic security guarantees is feasible without shared random-ness, a noisy channel, or data replication. Specifically, we leverage a noiseless binary adder channel and employ two non-colluding servers with independent content. Furthermore, we characterize the optimal file rates, i.e., the file lengths normalized by the number of channel uses, that can be transferred.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•3 citations

Foundations of Quantum Information Science and Computing

Manoj Kumar Tiwari

•Sep 18, 2026•0 citations

Dual-Source SPIR Over a Noiseless MAC Without Data Replication or Shared Randomness

Rémi A. Chou

Information-theoretically secure Symmetric Private Information Retrieval (SPIR) from a single server is known to be infeasible over noiseless channels. Known solutions to overcome this infeasibility involve additional resources such as database replication, shared randomness, or noisy channels. In this paper, we propose an alternative approach for achieving SPIR with information-theoretic security guarantees, without relying on shared randomness, noisy channels, or data replication. Specifically, we demonstrate that it is sufficient to use a noiseless binary adder multiple-access channel, where inputs are controlled by two non-colluding servers and the output is observed by the client, alongside a public noiseless communication channel between the client and the servers. Furthermore, in this setting, we characterize the optimal file rates, i.e., the file lengths normalized by the number of channel uses, that can be transferred.

arXiv:2503.14682•IEEE Transactions on Information Theory•Dec 8, 2025•3 citations

Quantum Information and Computation

V. Ravishankar

•May 15, 2017•3 citations

A Systematic Mapping Study on Quantum and Quantum-inspired Algorithms in Operations Research

Cláudio Gomes, João Paulo Fernandes, Gabriel Falcão +2 more

Quantum and quantum-inspired algorithms have not yet been systematically classified in the context of potential Operations Research (OR) applications. Our systematic mapping is designed for quick consultation and shows which algorithms have been significantly explored in the context of OR, as well as which algorithms have been vaguely addressed in the same context. The study provides rapid access to OR professionals, both practitioners and researchers, who are interested in applying and/or further developing these algorithms in their respective contexts. We prepared a replicable protocol as a backbone of this systematic mapping study, specifying research questions, establishing effective search and selection methods, defining quality metrics for assessment, and guiding the analysis of the selected studies. A total of more than 2,000 studies were found, of which 149 were analyzed in detail. Readers can have an interactive hands-on experience with the collected data on an open-source repository with a website. An international standard was used as part of our classification, enabling professionals and researchers from across the world to readily identify which algorithms have been applied in any industry sector. Our effort also culminated in a rich set of takeaways that can help the reader identify potential paths for future work.

ACM Computing Surveys•Oct 18, 2024•16 citations
Information-theoretically secure Symmetric Private Information Retrieval (SPIR) is known to be infeasible over noiseless channels with a single server. Previous solutions in-volved additional resources such as database replication, shared randomness, or noisy channels. This paper demonstrates that, using a noiseless multiple access channel, SPIR with information-theoretic security guarantees is feasible without shared random-ness, a noisy channel, or data replication. Specifically, we leverage a noiseless binary adder channel and employ two non-colluding servers with independent content. Furthermore, we characterize the optimal file rates, i.e., the file lengths normalized by the number of channel uses, that can be transferred.
Information-theoretically secure Symmetric Private Information Retrieval (SPIR) from a single server is known to be infeasible over noiseless channels. Known solutions to overcome this infeasibility involve additional resources such as database replication, shared randomness, or noisy channels. In this paper, we propose an alternative approach for achieving SPIR with information-theoretic security guarantees, without relying on shared randomness, noisy channels, or data replication. Specifically, we demonstrate that it is sufficient to use a noiseless binary adder multiple-access channel, where inputs are controlled by two non-colluding servers and the output is observed by the client, alongside a public noiseless communication channel between the client and the servers. Furthermore, in this setting, we characterize the optimal file rates, i.e., the file lengths normalized by the number of channel uses, that can be transferred.
Quantum and quantum-inspired algorithms have not yet been systematically classified in the context of potential Operations Research (OR) applications. Our systematic mapping is designed for quick consultation and shows which algorithms have been significantly explored in the context of OR, as well as which algorithms have been vaguely addressed in the same context. The study provides rapid access to OR professionals, both practitioners and researchers, who are interested in applying and/or further developing these algorithms in their respective contexts. We prepared a replicable protocol as a backbone of this systematic mapping study, specifying research questions, establishing effective search and selection methods, defining quality metrics for assessment, and guiding the analysis of the selected studies. A total of more than 2,000 studies were found, of which 149 were analyzed in detail. Readers can have an interactive hands-on experience with the collected data on an open-source repository with a website. An international standard was used as part of our classification, enabling professionals and researchers from across the world to readily identify which algorithms have been applied in any industry sector. Our effort also culminated in a rich set of takeaways that can help the reader identify potential paths for future work.