Cargando…
Quantum verification of NP problems with single photons and linear optics
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the satisfiability of potentially conflict constraints (SAT). Accordi...
| Autores principales: | , , , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8373877/ https://www.ncbi.nlm.nih.gov/pubmed/34408129 http://dx.doi.org/10.1038/s41377-021-00608-4 |