One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...