output
20022009
most citedExponential algorithmic speedup by quantum walk

836 citations

Showing 2006 · quant-phShow all

18 papers · 2 filters

quant-ph2006190 cited

Diluted maximum-likelihood algorithm for quantum tomography

Jaroslav Rehacek, Zdenek Hradil, E. Knill +1

We propose a refined iterative likelihood-maximization algorithm for reconstructing a quantum state from a set of tomographic measurements. The algorithm is characterized by a very…

quant-ph200645 cited

Adiabatic frequency conversion of quantum optical information in atomic vapor

Frank Vewinger, Juergen Appel, Eden Figueroa +1

We experimentally demonstrate a quantum communication protocol that enables frequency conversion and routing of quantum optical information in an adiabatic and thus robust way. The…

quant-ph200618 cited

Entanglement of Collaboration

Gilad Gour

The entanglement of collaboration (EoC) quantifies the maximum amount of entanglement, that can be generated between two parties, A and B, given collaboration with N-2 other partie…

quant-ph200617 cited

Degradation of a quantum directional reference frame as a random walk

Stephen D. Bartlett, Terry Rudolph, Barry C. Sanders +1

We investigate if the degradation of a quantum directional reference frame through repeated use can be modeled as a classical direction undergoing a random walk on a sphere. We dem…

quant-ph2006132 cited

Duality for monogamy of entanglement

Somshubhro Bandyopadhyay, Gilad Gour, Barry C. Sanders

We establish duality for monogamy of entanglement: whereas monogamy of entanglement inequalities provide an upper bound for bipartite sharability of entanglement in a multipartite…

quant-ph200643 cited

Perfect quantum state transfer with spinor bosons on weighted graphs

David L. Feder

A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infin…