output
20022009
most citedQuantum entanglement enhances the capacity of bosonic channels with memory

71 citations

Showing 2005Show all

7 papers · 1 filter

math.CO2005

An Orlik-Solomon type algebra for matroids with a fixed linear class of circuits

Raul Cordovil, David Forge

A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can…

quant-ph2005

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…

quant-ph2005

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…

math.CO20053 cited

Crossings and alignments of permutations

Sylvie Corteel

We derive the continued fraction form of the generating function of some new -analogs of the Eulerian numbers introduced by Lauren Williams building on work o…

quant-ph20051 cited

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…

quant-ph200571 cited

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…