Biomedical subjects

Aram W Harrow

Publications and source records attributed to Aram W Harrow.

3 recordsLinked to original sources

PubMed2006

Efficient quantum circuits for Schur and Clebsch-Gordan transforms.

The Schur basis on n d-dimensional quantum systems is a generalization of the total angular momentum basis that is useful for exploiting symmetry under permutations or collective unitary rotations. We present efficient {size poly[n,d,log(1/epsilon)] for accuracy epsilon} quantum circuits for the Schur transform, which is the change of basis between the computational and the Schur bases. Our circuits provide explicit efficient methods for solving such diverse problems as estimating the spectrum of a density operator, quantum hypothesis testing, and communicating without a shared reference frame. We thus render tractable a large series of methods for extracting resources from quantum systems and for numerous quantum information protocols.

Journal Article↗

PubMed2004

A family of quantum protocols.

We introduce three new quantum protocols involving noisy quantum channels and entangled states, and relate them operationally and conceptually with four well-known old protocols. Two of the new protocols (the mother and father) can generate the other five "child" protocols by direct application of teleportation and superdense coding, and can be derived in turn by making the old protocols "coherent." This gives very simple proofs for two famous old protocols (the hashing inequality and quantum channel capacity) and provides the basis for optimal trade-off curves in several quantum information processing tasks.

Journal Article↗

PubMed2002

Practical scheme for quantum computation with any two-qubit entangling gate.

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

Journal Article↗