Web: http://arxiv.org/abs/2211.12954

Nov. 24, 2022, 2:10 a.m. | Yassine Hamoudi, Qipeng Liu, Makrand Sinha

cs.CR updates on arXiv.org arxiv.org

We study tradeoffs between quantum and classical queries for hybrid
algorithms that have black-box access to a random oracle. Although there are
several established techniques for proving query lower bounds for both quantum
and classical algorithms, there is no such widely applicable technique for
hybrid algorithms and the optimal tradeoffs for many fundamental problems are
still unknown $\unicode{x2013}$ an optimal tradeoff for the search problem was
only shown recently by Rosmanis, although not in the random oracle model. For
another …

oracle quantum random

More from arxiv.org / cs.CR updates on arXiv.org

Senior Cloud Security Engineer

@ HelloFresh | Berlin, Germany

Senior Security Engineer

@ Reverb | Remote, US

I.S. Security Analyst

@ YVFWC | Yakima, WA

Application Security Design Architect

@ Fivesky | Alpharetta, GA

DevSecOps Engineer

@ Bosch Group | Bengaluru, India

Senior Security Engineer, Application Security

@ Wayfair Inc. | Austin, TX

Network Security Engineer

@ Genomics England | London, United Kingdom

FedRAMP Compliance Analyst

@ HealthVerity | Remote

Incident Responder and Threat Hunter (REMOTE)

@ Arista Networks | Charlotte, NC, United States

Risk Advisory - Cyber Risk - Assistant Manager L3 SOC

@ Deloitte | Midrand, South Africa

Senior Global Campaign Marketing Manager, Firewalls/CDSS

@ Palo Alto Networks | Santa Clara, CA, United States

Staff Security Engineer - 2124

@ Kioxia | San Jose, CA, United States