62 citations
- Centrum Wiskunde & InformaticaNL9 papers
- University of AmsterdamNL5 papers
- California Institute of TechnologyUS2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- University of CalgaryCA2 papers
- University of WaterlooCA2 papers
- Amsterdam UMC Location Vrije Universiteit AmsterdamNL1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Chalmers University of TechnologySE1 paper
- Delft University of TechnologyNL1 paper
- Institut Polytechnique de BordeauxFR1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
8 papers · 1 filter
Robust Cryptography in the Noisy-Quantum-Storage Model
Christian Schaffner, Barbara Terhal, Stephanie Wehner
It was shown in [WST08] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the…
Locally Decodable Quantum Codes
Jop Briët, Ronald de Wolf
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that e…
The quantum moment problem and bounds on entangled multi-prover games
Andrew C. Doherty, Yeong-Cherng Liang, Ben Toner +1
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection o…
Quantum Algorithms for Matching and Network Flows
Andris Ambainis, Robert Spalek
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time…
Tight adversary bounds for composite functions
Peter Hoyer, Troy Lee, Robert Spalek
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many…
All Quantum Adversary Methods are Equivalent
Robert Spalek, Mario Szegedy
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spectral advers…