#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (18)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Martin Müller-Lennert,1 Frédéric Dupuis,2 Oleg Szehr,3 Serge Fehr,4 and Marco Tomamichel5 Department of Mathematics, ETH Zurich, 8092 Zürich, Switzerland Department of Computer Science, Aarhus University, 8200 Aarhus, Denmark Department of Mathematics, Technische Universität München, 85748 Garching, Germany CWI (Centrum Wiskunde & Informatica), 1090… (More)

- Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail
- IACR Cryptology ePrint Archive
- 2012

We provide the first two-party protocol allowing Alice and Bob to evaluate privately even against active adversaries any completely positive, tracepreserving map F ∈ L(Ain ⊗ Bin) → L(Aout ⊗ Bout), given as a quantum circuit, upon their joint quantum input state ρin ∈ D(Ain ⊗ Bin). Our protocol leaks no more to any active adversary than an ideal… (More)

- Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail
- CRYPTO
- 2010

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held… (More)

- Joseph M Renes, Frédéric Dupuis, Renato Renner
- Physical review letters
- 2012

Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here, we study the use of polar codes for the transmission of quantum information.… (More)

- Joseph M. Renes, Frédéric Dupuis, Renato Renner
- ArXiv
- 2011

Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information.… (More)

- Gilles Brassard, Frédéric Dupuis, Sébastien Gambs, Alain Tapp
- ArXiv
- 2011

We describe two quantum algorithms to approximate the mean value of a black-box function. The first algorithm is novel and asymptotically optimal while the second is a variation on an earlier algorithm due to Aharonov. Both algorithms have their own strengths and caveats and may be relevant in different contexts. We then propose a new algorithm for… (More)

- Frédéric Dupuis, Omar Fawzi, Stephanie Wehner
- IEEE Transactions on Information Theory
- 2015

A natural measure for the amount of quantum information that a physical system E holds about another system A = A<sub>1</sub>, .. . , A<sub>n</sub> is given by the min-entropy H<sub>min</sub>(A|E). In particular, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging… (More)

- Alexander Vitanov, Frédéric Dupuis, Marco Tomamichel, Renato Renner
- IEEE Transactions on Information Theory
- 2013

The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here, we consider the chain rule for the more general smooth min- and max-entropies, used in one-shot information theory. For these entropy measures, the chain rule no longer holds… (More)

- Simon Pierre Desrosiers, Frédéric Dupuis
- IEEE Transactions on Information Theory
- 2010

An encryption scheme is said to be entropically secure if an adversary whose min-entropy on the message is upper bounded cannot guess any function of the message. Similarly, an encryption scheme is entropically indistinguishable if the encrypted version of a message whose min-entropy is high enough is statistically indistinguishable from a fixed… (More)

- Frédéric Dupuis, Nicolas Gisin, Avinatan Hasidim, André Allan Méthot, Haran Pilpel
- 2008

We show that standard nonlocal boxes, also known as PopescuRohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to the bipartite case. We then generalize this result further by showing that no finite set containing any… (More)