output
19942026
most citedLOFAR: The LOw-Frequency ARray

2.7k citations

Showing 1998Show all

12 papers · 1 filter

quant-ph1998★ 1 cited

Searching an Ordered List on a Quantum Computer

Hein Roehrig

Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N +…

quant-ph1998★ 12 cited

Lower Bounds for Quantum Search and Derandomization

Harry Buhrman, Ronald de Wolf

We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In part…

cs.AI1998★ 1 cited

A Proof Theoretic View of Constraint Programming

Krzysztof R. Apt

We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proo…

quant-ph1998

A Family of Indecomposable Positive Linear Maps based on Entangled Quantum States

Barbara M. Terhal

We introduce a new family of indecomposable positive linear maps based on entangled quantum states. Central to our construction is the notion of an unextendible product basis. The…

cs.CC1998

New Applications of the Incompressibility Method: Part I

Tao Jiang, Ming Li, Paul Vitanyi

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit ne…

cs.CC1998

New Applications of the Incompressibility Method: Part II

Harry Buhrman, Tao Jiang, Ming Li +1

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit ne…