Cargando…
A Quantum Algorithm Detecting Concentrated Maps
We consider an arbitrary mapping f: {0, …, N − 1} → {0, …, N − 1} for N = 2(n), n some number of quantum bits. Using N calls to a classical oracle evaluating f(x) and an N-bit memory, it is possible to determine whether f(x) is one-to-one. For some radian angle 0 ≤ θ ≤ π/2, we say f(x) is θ − concen...
Autores principales: | Beichl, Isabel, Bullock, Stephen S., Song, Daegene |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
[Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
2007
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4655924/ https://www.ncbi.nlm.nih.gov/pubmed/27110475 http://dx.doi.org/10.6028/jres.112.025 |
Ejemplares similares
-
Quantum Algorithms for anomaly detection at the LHC
por: Belis, Vasilis
Publicado: (2023) -
Quantum Density Peak Clustering Algorithm
por: Wu, Zhihao, et al.
Publicado: (2022) -
Successful surgical treatment of a 1160 g neonate with cardiac teratoma and severe foetal hydrops: a case report
por: Beichl, Matthias, et al.
Publicado: (2021) -
Quantum algorithmic measurement
por: Aharonov, Dorit, et al.
Publicado: (2022) -
Multiscale quantum algorithms for quantum chemistry
por: Ma, Huan, et al.
Publicado: (2023)