#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2003

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Anura Abeyesinghe,1, ∗ Igor Devetak,2, † Patrick Hayden,3, ‡ and Andreas Winter4, § 1 Institute for Quantum Information, Physics Department, Caltech 103-33, Pasadena, CA 91125, USA 2 Electrical Engineering Department, University of Southern California Los Angeles, California 90089, USA 3 School of Computer Science, McGill University, Montreal, Quebec, H3A… (More)

We consider the problem of communicating quantum states by simultaneously making use of a noiseless classical channel, a noiseless quantum channel, and shared entanglement. We specifically study the version of the problem in which the sender is given knowledge of the state to be communicated. In this setting, a trade-off arises between the three resources,… (More)

The Markov Chain Monte Carlo method is at the heart of most fully-polynomial randomized approximation schemes for #P-complete problems such as estimating the permanent or the value of a polytope. It is therefore very natural and important to determine whether quantum computers can speed-up classical mixing processes based on Markov chains. To this end, we… (More)

- A. Abeyesinghe, Patrick M. Hayden, Graeme Smith, Andreas J. Winter
- IEEE Transactions on Information Theory
- 2006

In this paper, we present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a 2l-qubit quantum state could be communicated to a receiver by physically transmitting only l+o(l) qubits in… (More)

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying… (More)

We present the unification of many previously disparate results in noisy quantum Shannon theory and the unification of all of noiseless quantum Shannon theory. More specifically we deal here with bipartite, unidirectional, and memoryless quantum Shannon theory. We find all the optimal protocols and quantify the relationship between the resources used, both… (More)

- ‹
- 1
- ›