English
Related papers

Related papers: Small error algorithms for tropical group testing

200 papers

Topological quantum error correction codes are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to…

Quantum Physics · Physics 2013-05-01 Austin G. Fowler

Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…

Quantum Physics · Physics 2016-07-13 Ruben S. Andrist , Helmut G. Katzgraber , H. Bombin , M. A. Martin-Delgado

Classically, for many computational problems one can conclude time lower bounds conditioned on the hardness of one or more of key problems: k-SAT, 3SUM and APSP. More recently, similar results have been derived in the quantum setting…

Computational Complexity · Computer Science 2022-07-25 Andris Ambainis , Harry Buhrman , Koen Leijnse , Subhasree Patro , Florian Speelman

In this work we consider the large-coalition asymptotics of various fingerprinting and group testing games, and derive explicit expressions for the capacities for each of these models. We do this both for simple decoders (fast but…

Information Theory · Computer Science 2015-10-01 Thijs Laarhoven

Given $p$ samples, each of which may or may not be defective, group testing (GT) aims to determine their defect status by performing tests on $n < p$ `groups', where a group is formed by mixing a subset of the $p$ samples. Assuming that the…

Machine Learning · Statistics 2025-07-25 Shuvayan Banerjee , Radhendushka Srivastava , James Saunderson , Ajit Rajwade

We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as…

Information Theory · Computer Science 2017-11-20 Thach V. Bui , Minoru Kuribayashi , Isao Echizen

Modern deep learning based classifiers show very high accuracy on test data but this does not provide sufficient guarantees for safe deployment, especially in high-stake AI applications such as medical diagnosis. Usually, predictions are…

Machine Learning · Computer Science 2022-05-09 David Stutz , Krishnamurthy , Dvijotham , Ali Taylan Cemgil , Arnaud Doucet

We consider a novel group testing procedure, termed semi-quantitative group testing, motivated by a class of problems arising in genome sequence processing. Semi-quantitative group testing (SQGT) is a non-binary pooling scheme that may be…

Information Theory · Computer Science 2012-05-22 Amin Emad , Olgica Milenkovic

The group testing approach that achieves significant cost reduction over the individual testing approach has received a lot of interest lately for massive testing of COVID-19. Many studies simply assume samples mixed in a group are…

Methodology · Statistics 2021-11-12 Yi-Jheng Lin , Che-Hao Yu , Tzu-Hsuan Liu , Cheng-Shang Chang , Wen-Tsuen Chen

In this paper, an information theoretic analysis on non-adaptive group testing schemes based on sparse pooling graphs is presented. The binary status of the objects to be tested are modeled by i.i.d. Bernoulli random variables with…

Information Theory · Computer Science 2013-04-29 Tadashi Wadayama

Tropical recurrent sequences are introduced satisfying a given vector (being a tropical counterpart of classical linear recurrent sequences). We consider the case when Newton polygon of the vector has a single (bounded) edge. In this case…

Algebraic Geometry · Mathematics 2020-02-06 Dima Grigoriev

Almost every software system provides configuration options to tailor the system to the target platform and application scenario. Often, this configurability renders the analysis of every individual system configuration infeasible. To…

Software Engineering · Computer Science 2016-02-17 Flávio Medeiros , Christian Kästner , Márcio Ribeiro , Rohit Gheyi , Sven Apel

Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks.…

Disordered Systems and Neural Networks · Physics 2016-11-10 Satoshi Takabe , Koji Hukushima

Accurate drug-target interaction (DTI) prediction with machine learning models is essential for drug discovery. Such models should also provide a credible representation of their uncertainty, but applying classical marginal conformal…

Machine Learning · Computer Science 2025-05-27 Morteza Rakhshaninejad , Mira Jurgens , Nicolas Dewolf , Willem Waegeman

As networks continue to increase in size, current methods must be capable of handling large numbers of nodes and edges in order to be practically relevant. Instead of working directly with the entire (large) network, analyzing sub-networks…

Social and Information Networks · Computer Science 2025-04-03 Eric Yanchenko

Multi-objective evolutionary algorithms (MOEAs) have progressed significantly in recent decades, but most of them are designed to solve unconstrained multi-objective optimization problems. In fact, many real-world multi-objective problems…

Neural and Evolutionary Computing · Computer Science 2019-05-29 Zhun Fan , Wenji Li , Xinye Cai , Hui Li , Caimin Wei , Qingfu Zhang , Kalyanmoy Deb , Erik D. Goodman

The states needed in a quantum computation are extremely affected by decoherence. Several methods have been proposed to control error spreading. They use two main tools: fault-tolerant constructions and concatenated quantum error correcting…

Quantum Physics · Physics 2007-05-23 Pedro J. Salas , Angel L. Sanz

Practitioners conducting adaptive experiments often encounter two competing priorities: maximizing total welfare (or `reward') through effective treatment assignment and swiftly concluding experiments to implement population-wide…

Machine Learning · Computer Science 2024-07-31 Chao Qin , Daniel Russo

We propose a novel group testing method, termed semi-quantitative group testing, motivated by a class of problems arising in genome screening experiments. Semi-quantitative group testing (SQGT) is a (possibly) non-binary pooling scheme that…

Information Theory · Computer Science 2015-05-28 Amin Emad , Olgica Milenkovic

We consider the problem of Clifford testing, which asks whether a black-box $n$-qubit unitary is a Clifford unitary or at least $\varepsilon$-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this…

Quantum Physics · Physics 2025-10-09 Marcel Hinsche , Zongbo Bao , Philippe van Dordrecht , Jens Eisert , Jop Briët , Jonas Helsen
‹ Prev 1 8 9 10 Next ›