We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
The probabilistic formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework can be based on the not...
Benjamin Piwowarski, Ingo Frommholz, Mounia Lalmas...
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...