output
19912026
Showing 2007 · quant-phShow all

9 papers · 2 filters

quant-ph2007★ 10 cited

A quantum characterization of NP

Hugue Blier, Alain Tapp

In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with pe…

quant-ph2007★ 14 cited

Robustness of entangled states that are positive under partial transposition

Somshubhro Bandyopadhyay, Sibasish Ghosh, Vwani Roychowdhury

We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust,…

quant-ph2007★ 22 cited

Quantum entropic security and approximate quantum encryption

Simon Pierre Desrosiers, Frédéric Dupuis

We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is mad…

quant-ph2007★ 47 cited

Anonymous quantum communication

Gilles Brassard, Anne Broadbent, Joseph Fitzsimons +2

We present the first protocol for the anonymous transmission of a quantum state that is information-theoretically secure against an active adversary, without any assumption on the…

quant-ph2007★ 39 cited

Validity of the Adiabatic Approximation

R. MacKenzie, A. Morin-Duchesne, H. Paquette +1

We analyze the validity of the adiabatic approximation, and in particular the reliability of what has been called the "standard criterion" for validity of this approximation. Recen…

quant-ph2007★ 117 cited

Parallelizing Quantum Circuits

Anne Broadbent, Elham Kashefi

We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade…

quant-ph2007★ 379 cited

Quantum Key Distribution with Classical Bob

Michel Boyer, Dan Kenigsberg, Tal Mor

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made,…

quant-ph2007★ 16 cited

No nonlocal box is universal

Frédéric Dupuis, Nicolas Gisin, Avinatan Hassidim +2

We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known…

quant-ph2007★ 7 cited

Using quantum key distribution for cryptographic purposes: a survey

Romain Alléaume, Cyril Branciard, Jan Bouda +20

The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. A…