output
19912026
most citedAdam: A Method for Stochastic Optimization

83.4k citations

Showing 1998 · quant-phShow all

5 papers · 2 filters

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…

quant-ph1998★ 194 cited

The problem of equilibration and the computation of correlation functions on a quantum computer

Barbara M. Terhal, David P. DiVincenzo

We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of th…

quant-ph1998★ 738 cited

Unextendible Product Bases and Bound Entanglement

C. H. Bennett, D. P. DiVincenzo, T. Mor +3

An unextendible product basis (UPB) for a multipartite quantum system is an incomplete orthogonal product basis whose complementary subspace contains no product state. We give exam…

quant-ph1998★ 37 cited

Simulating quantum operations with mixed environments

B. M. Terhal, I. L. Chuang, D. P. DiVincenzo +2

We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perfo…

quant-ph1998★ 179 cited

Quantum Lower Bounds by Polynomials

Robert Beals, Harry Buhrman, Richard Cleve +2

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the…