251 citations · 802 across the 40 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
quant-ph2012★ 3 cited
Gate-efficient discrete simulations of continuous-time quantum query algorithms
Dominic W. Berry, Richard Cleve, Sevag Gharibian
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) wh…
quant-ph2012★ 26 cited
Hardness of approximation for quantum problems
Sevag Gharibian, Julia Kempe
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show…
quant-ph2012★ 46 cited
Quantifying non-classicality with local unitary operations
Sevag Gharibian
We propose a measure of non-classical correlations in bipartite quantum states based on local unitary operations. We prove the measure is non-zero if and only if the quantum discor…