Author of the publication

Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester.

, and . CoRR, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Quantum Complexity of Closest Pair and Related Problems., , , , and . CoRR, (2019)Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning., , , , , and . J. ACM, 69 (5): 33:1-33:72 (2022)Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches., , , and . CoRR, (2019)On relating one-way classical and quantum communication complexities., , and . Quantum, (May 2023)Localized High Dynamic Range Plenoptic Image Compression., , , , , , , and . Computational Imaging, page 163-168. Society for Imaging Science and Technology, (2017)A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries., , , and . EUROCRYPT (2), volume 11477 of Lecture Notes in Computer Science, page 442-469. Springer, (2019)Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester., and . Theory of Computing, 12 (1): 1-35 (2016)Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension., , , , , and . ISAAC, volume 181 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation., , , , , and . CCC, volume 264 of LIPIcs, page 33:1-33:45. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Sample Complexity of PAC Learning Quantum Process., and . CoRR, (2018)