1 citations · 1 across the 2 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Efficient Quantum State Synthesis with One Query
Gregory Rosenthal
We present a polynomial-time quantum algorithm making a single query (in superposition) to a classical oracle, such that for every state there exists a choice of oracl…
quant-ph2026★ 1 cited
Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
Gregory Rosenthal
We prove that any -qubit unitary can be implemented (i) approximately in time with query access to an appropriate classical oracle, and also (ii) exa…
quant-ph2024
Quantum Channel Testing in Average-Case Distance
Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian +2
We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}…