21 citations
3 papers
cs.IT2006★ 1 cited
On Universally Decodable Matrices for Space-Time Coding
Pascal O. Vontobel, Ashwin Ganesan
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc…
cs.CC2005
Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity
Gabriel Istrate, Stefan Boettcher, Allon G. Percus
We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a…
quant-ph2000★ 21 cited
Information gain versus state disturbance for a single qubit
Konrad Banaszek
The trade-off between the information gain and the state disturbance is derived for quantum operations on a single qubit prepared in a uniformly distributed pure state. The derivat…