Power of one qumode for quantum computation
Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class of problems where quantum computers possess an advantage is...
Autores principales: | Liu, N, Thompson, J, Weedbrook, C, Lloyd, S, Vedral, V, Gu, M, Modi, K |
---|---|
Formato: | Journal article |
Lenguaje: | English |
Publicado: |
American Physical Society
2016
|
Ejemplares similares
-
Power of one qumode for quantum computation
por: Liu, Nana, et al.
Publicado: (2016) -
Power of one qumode for quantum computation
por: Liu, Nana, et al.
Publicado: (2018) -
Non-destructively probing the thermodynamics of quantum systems with qumodes
por: Elliott, Thomas J., et al.
Publicado: (2023) -
Quantum plug n’ play: modular computation in the quantum regime
por: Thompson, J, et al.
Publicado: (2018) -
How discord underlies the noise resilience of quantum illumination
por: Weedbrook, C, et al.
Publicado: (2016)