2 citations · 5 across the 3 of their papers we have counts for
5 papers
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}…
Quantum Worst-Case to Average-Case Reductions for All Linear Problems
Vahid R. Asadi, Alexander Golovnev, Tom Gur +2
We study the problem of designing worst-case to average-case reductions for quantum algorithms. For all linear problems, we provide an explicit and efficient transformation of quan…
Constant-time one-shot testing of large-scale graph states
Hayata Yamasaki, Sathyawageeswar Subramanian
Fault-tolerant measurement-based quantum computation (MBQC) with recent progress on quantum technologies leads to a promising scalable platform for realizing quantum computation, c…
Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms
Steven Herbert, Sathyawageeswar Subramanian
We study the potential utility of classical techniques of spectral sparsification of graphs as a preprocessing step for digital quantum algorithms, in particular, for Hamiltonian s…
Implementing smooth functions of a Hermitian matrix on a quantum computer
Sathyawageeswar Subramanian, Steve Brierley, Richard Jozsa
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which…