Caricamento...
Inverse Problems, Constraint Satisfaction, Reversible Logic, Invertible Logic and Grover Quantum Oracles for Practical Problems
It is well-known that the “Unsorted Database” quantum algorithm by Grover gives quadratic speedup to several important combinatorial and enumerative problems, such as: SAT, Graph Coloring, Maximum Cliques, Travelling Salesman and many others. Recently, quantum programming languages such as Quipper s...
Salvato in:
| Pubblicato in: | Reversible Computation |
|---|---|
| Autore principale: | |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2020
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7345305/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-52482-1_1 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|