A carregar...
Revisiting the simulation of quantum Turing machines by quantum circuits
Yao's 1995 publication ‘Quantum circuit complexity’ in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 352–361, proved that quantum Turing machines and quantum circuits are polynomially equivalent computational models: t≥n steps of a quantum Turing machine...
Na minha lista:
| Publicado no: | Proc Math Phys Eng Sci |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
The Royal Society Publishing
2019
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6598068/ https://ncbi.nlm.nih.gov/pubmed/31293355 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rspa.2018.0767 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|