Solving search problems by strongly simulating quantum circuits

Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several efficient strong simulation techniques are known for restricted fami...

Descripción completa

Detalles Bibliográficos
Autores principales: Johnson, T. H., Biamonte, J. D., Clark, S. R., Jaksch, D.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2013
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3565169/
https://www.ncbi.nlm.nih.gov/pubmed/23390585
http://dx.doi.org/10.1038/srep01235

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3565169/
https://www.ncbi.nlm.nih.gov/pubmed/23390585
http://dx.doi.org/10.1038/srep01235

Ejemplares similares