1.2k citations
- Centre National de la Recherche ScientifiqueFR50 papers
- Laboratoire de physique des SolidesFR27 papers
- Université Paris CitéFR19 papers
- Laboratoire de Physique Théorique et Modèles StatistiquesFR16 papers
- CEA Paris-SaclayFR11 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR11 papers
- Laboratoire de Recherche en InformatiqueFR8 papers
- Laboratoire de Physique ThéoriqueFR7 papers
- Sorbonne UniversitéFR7 papers
- Université Libre de BruxellesBE5 papers
- Laboratoire Léon BrillouinFR4 papers
- Université de BourgogneFR4 papers
6 papers · 2 filters
Direct measurement of finite-time disentanglement induced by a reservoir
M. Franca Santos, P. Milman, L. Davidovich +1
We propose a method for directly probing the dynamics of disentanglement of an initial two-qubit entangled state, under the action of a reservoir. We show that it is possible to de…
Enhanced algorithms for Local Search
Yves F. Verhoeven
Let G=(V,E) be a finite graph, and f:V->N be any function. The Local Search problem consists in finding a local minimum of the function f on G, that is a vertex v such that f(v) is…
On the black-box complexity of Sperner's Lemma
Katalin Friedl, Gabor Ivanyos, Miklos Santha +1
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ps…
Quantum multiparty communication complexity and circuit lower bounds
Iordanis Kerenidis
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show th…
Quantum entanglement enhances the capacity of bosonic channels with memory
Nicolas J. Cerf, Julien Clavareau, Chiara Macchiavello +1
The bosonic quantum channels have recently attracted a growing interest, motivated by the hope that they open a tractable approach to the generally hard problem of evaluating quant…
The quantum adversary method and classical formula size lower bounds
Sophie Laplante, Troy Lee, Mario Szegedy
We introduce two new complexity measures for Boolean functions, or more generally for functions of the form f:S->T. We call these measures sumPI and maxPI. The quantity sumPI has b…