Lanean...
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...
Gorde:
| Argitaratua izan da: | Entropy (Basel) |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI
2021
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7913633/ https://ncbi.nlm.nih.gov/pubmed/33546475 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e23020189 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|