output
20022009
most citedQuantum algorithm for solving linear systems of equations

3.4k citations

Showing 2004 · quant-phShow all

9 papers · 2 filters

quant-ph200437 cited

On the efficiency of nonlocal gates generation

Berry Groisman, Benni Reznik

We propose and study a method for using non-maximally entangled states to implement probabilistically non-local gates. Unlike distillation-based protocols, this method does not gen…

quant-ph2004626 cited

On the quantum, classical and total amount of correlations in a quantum state

Berry Groisman, Sandu Popescu, Andreas Winter

We give an operational definition of the quantum, classical and total amount of correlations in a bipartite quantum state. We argue that these quantities can be defined via the amo…

quant-ph2004169 cited

Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms

Dave Bacon, Isaac Chuang, Aram Harrow

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 u…

quant-ph200430 cited

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…

quant-ph2004365 cited

Aspects of generic entanglement

Patrick Hayden, Debbie W. Leung, Andreas Winter

We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to t…

quant-ph20044 cited

Lower bound on the number of Toffoli gates in a classical reversible circuit through quantum information concepts

Sandu Popescu, Berry Groisman, Serge Massar

The question of finding a lower bound on the number of Toffoli gates in a classical reversible circuit is addressed. A method based on quantum information concepts is proposed. The…