Verifying commuting quantum computations via fidelity estimation of weighted graph states
The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some u...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IOP Publishing
2019-01-01
|
| coleção: | New Journal of Physics |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.1088/1367-2630/ab3d88 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|