activity
20042009
most citedAre random pure states useful for quantum computation?

122 citations · 355 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2009★ 25 cited

Universal resources for approximate and stochastic measurement-based quantum computation

C. E. Mora, M. Piani, A. Miyake +3

We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can b…

quant-ph2009★ 77 cited

Broadcast copies reveal the quantumness of correlations

M. Piani, M. Christandl, C. E. Mora +1

We study the quantumness of bipartite correlations by proposing a quantity that combines a measure of total correlations -- mutual information -- with the notion of broadcast copie…

quant-ph2008★ 122 cited

Are random pure states useful for quantum computation?

Michael J. Bremner, Caterina Mora, Andreas Winter

We show the following: a randomly chosen pure state as a resource for measurement-based quantum computation, is - with overwhelming probability - of no greater help to a polynomial…

quant-ph2008★ 10 cited

Epsilon-measures of entanglement

Caterina Mora, Marco Piani, Hans Briegel

We associate to every entanglement measure a family of measures which depend on a precision parameter, and which we call epsilon-measures of entanglement. Their definition aims at…

quant-ph2006★ 2 cited

Quantum Kolmogorov complexity and its applications

C. Mora, H. Briegel, B. Kraus

Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information re…

quant-ph2006★ 54 cited

Class of PPT bound entangled states associated to almost any set of pure entangled states

M. Piani, C. Mora

We analyze a class of entangled states for bipartite systems, with non-prime. The entanglement of such states is revealed by the construction of canonically assoc…