A one-query lower bound for unitary synthesis and breaking quantum cryptography.
Alex LombardiFermi MaJohn WrightPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- query processing
- database
- cellular automata
- branch and bound
- response time
- data structure
- range queries
- query evaluation
- user queries
- np hard
- branch and bound algorithm
- retrieval systems
- keywords
- quantum computation
- lower and upper bounds
- worst case
- relevance feedback
- objective function
- database systems
- data sources
- relational databases
- optimal solution
- information security
- database queries
- retrieval method
- learning algorithm
- statistical queries
- information retrieval