194 citations · 1.9k across the 115 of their papers we have counts for
Showing 2001 · quant-phShow all
3 papers · 2 filters
quant-ph2001
Extracting Quantum Entanglement (General Entanglement Purification Protocols)
Andris Ambainis, Ke Yang
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state which is ``reasonably close'' to perfect EPR pairs. The only…
quant-ph2001
Exact results for accepting probabilities of quantum automata
Andris Ambainis, Arnolds Kikusts
One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this pap…
quant-ph2001★ 3 cited
ROM-based computation: quantum versus classical
B. C. Travaglione, M. A. Nielsen, H. M. Wiseman +1
We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible…