Partial Boolean Functions With Exact Quantum Query Complexity One

We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be computed exactly by a 1-query quantum algorit...

Descripción completa

Detalles Bibliográficos
Autores principales: Xu, Guoliang, Qiu, Daowen
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7913633/
https://www.ncbi.nlm.nih.gov/pubmed/33546475
http://dx.doi.org/10.3390/e23020189

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7913633/
https://www.ncbi.nlm.nih.gov/pubmed/33546475
http://dx.doi.org/10.3390/e23020189

Ejemplares similares