1 citations · 1 across the 1 of their papers we have counts for
3 papers
quant-ph2024★ 1 cited
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}…
quant-ph2020
Bounds on the QAC Complexity of Approximating Parity
Gregory Rosenthal
QAC circuits are quantum circuits with one-qubit gates and Toffoli gates of arbitrary arity. QAC circuits are QAC circuits of constant depth, and are quantum analogues of AC$^0…
cs.CC2019
Beating Treewidth for Average-Case Subgraph Isomorphism
Gregory Rosenthal
For any fixed graph , the subgraph isomorphism problem asks whether an -vertex input graph has a subgraph isomorphic to . A well-known algorithm of Alon, Yuster and Zwick…