Sciweavers

587 search results - page 46 / 118
» Quantum computation and quantum information
Sort
View
COMPUTING
2004
87views more  COMPUTING 2004»
13 years 9 months ago
The Generalized Quantum Database Search Algorithm
In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. We will discuss the relation between the original and ge...
Sándor Imre, Ferenc Balázs
FOCS
2002
IEEE
14 years 3 months ago
Quantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
Oded Regev
FOCS
2006
IEEE
14 years 4 months ago
New Limits on Fault-Tolerant Quantum Computation
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 9 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 3 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang