259 citations · 597 across the 5 of their papers we have counts for
5 papers
Quantum Speed-up for Approximating Partition Functions
Pawel Wocjan, Chen-Fu Chiang, Anura Abeyesinghe +1
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…
Speed-up via Quantum Sampling
Pawel Wocjan, Anura Abeyesinghe
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is ther…
The mother of all protocols: Restructuring quantum information's family tree
Anura Abeyesinghe, Igor Devetak, Patrick Hayden +1
We give a simple, direct proof of the "mother" protocol of quantum information theory. In this new formulation, it is easy to see that the mother, or rather her generalization to t…
Optimal superdense coding of entangled states
Anura Abeyesinghe, Patrick Hayden, Graeme Smith +1
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 prepari…
Generalized remote state preparation: Trading cbits, qubits and ebits in quantum communication
Anura Abeyesinghe, Patrick Hayden
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 speci…