output
19912026
Showing 1996 · quant-phShow all

10 papers · 2 filters

quant-ph1996★ 6 cited

On The Power of Exact Quantum Polynomial Time

Gilles Brassard, Peter Hoyer

We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst…

quant-ph1996

Quantum Key Distribution and String Oblivious Transfer in Noisy Channels

Dominic Mayers

We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that…

quant-ph1996★ 185 cited

Teleportation as a quantum computation

Gilles Brassard

An explicit quantum circuit is given to implement quantum teleportation. This circuit makes teleportation straightforward to anyone who believes that quantum computation is a reaso…

quant-ph1996★ 754 cited

Tight bounds on quantum searching

Michel Boyer, Gilles Brassard, Peter Hoeyer +1

We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number…

quant-ph1996

Information Gain vs. State Disturbance in Quantum Theory

Christopher A. Fuchs

The engine that powers quantum cryptography is the principle that there are no physical means for gathering information about the identity of a quantum system's state (when it is k…

quant-ph1996★ 763 cited

Unconditionally secure quantum bit commitment is impossible

Dominic Mayers

The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction…

quant-ph1996★ 69 cited

The Trouble with Quantum Bit Commitment

Dominic Mayers

In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Crépeau,…

quant-ph1996★ 3 cited

New Trends in Quantum Computing

Gilles Brassard

Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum…

quant-ph1996★ 125 cited

Universal Superpositions of Coherent States and Self-Similar Potentials

V. Spiridonov

A variety of coherent states of the harmonic oscillator is considered. It is formed by a particular superposition of canonical coherent states. In the simplest case, these superpos…

quant-ph1996★ 200 cited

Distinguishability and Accessible Information in Quantum Theory

Christopher A. Fuchs

This document focuses on translating various information-theoretic measures of distinguishability for probability distributions into measures of distin- guishability for quantum st…