Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
Jaikumar Radhakrishnan;Amnon Ta-Shma.
SIAM Journal on Discrete Mathematics (2000)
334 Citations
Dense quantum coding and quantum finite automata
Andris Ambainis;Ashwin Nayak;Amnon Ta-Shma;Umesh Vazirani.
Journal of the ACM (2002)
259 Citations
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov;Amnon Ta-Shma.
symposium on the theory of computing (2003)
255 Citations
Extracting Randomness
Noam Nisan;Amnon Ta-Shma.
Journal of Computer and System Sciences (1999)
183 Citations
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
Amnon Ta-Shma;Uri Zwick.
ACM Transactions on Algorithms (2014)
181 Citations
Loss-less condensers, unbalanced expanders, and extractors
Amnon Ta-Shma;Christopher Umans;David Zuckerman.
symposium on the theory of computing (2001)
180 Citations
Dense quantum coding and a lower bound for 1-way quantum automata
Andris Ambainis;Ashwin Nayak;Ammon Ta-Shma;Umesh Vazirani.
symposium on the theory of computing (1999)
154 Citations
Extractors from Reed-Muller codes
Amnon Ta-Shma;David Zuckerman;Shmuel Safra.
foundations of computer science (2006)
130 Citations
Quantum bit escrow
Dorit Aharonov;Amnon Ta-Shma;Umesh V. Vazirani;Andrew C. Yao.
symposium on the theory of computing (2000)
125 Citations
Normal subgroup reconstruction and quantum computation using group representations
Sean Hallgren;Alexander Russell;Amnon Ta-Shma.
symposium on the theory of computing (2000)
124 Citations
