activity
20012026
most citedQuantum algorithm for solving linear systems of equations

3.4k citations · 12.4k across the 106 of their papers we have counts for

collaborators
Showing 2009 · quant-phShow all

6 papers · 2 filters

quant-ph2009★ 224 cited

Quantum Reverse Shannon Theorem

Charles H. Bennett, Igor Devetak, Aram W. Harrow +2

Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noisel…

quant-ph2009★ 24 cited

Random tensor theory: extending random matrix theory to random product states

Andris Ambainis, Aram W. Harrow, Matthew B. Hastings

We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in (C^d)^{otime…

quant-ph2009★ 6 cited

Entanglement spread and clean resource inequalities

Aram W. Harrow

This article will examine states that superpose different amounts of entanglement and protocols that run in superposition but generate or consume different amounts of entanglement.…

quant-ph2009★ 109 cited

Adaptive versus non-adaptive strategies for quantum channel discrimination

Aram W. Harrow, Avinatan Hassidim, Debbie W. Leung +1

We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglemen…

quant-ph2009★ 41 cited

Quantum algorithms for testing properties of distributions

Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim

Suppose one has access to oracles generating samples from two unknown probability distributions P and Q on some N-element set. How many samples does one need to test whether the tw…

quant-ph2009★ 50 cited

Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel

Toby S. Cubitt, Jianxin Chen, Aram W. Harrow

The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probab…