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...
Autori principali: | Liu, N, Thompson, J, Weedbrook, C, Lloyd, S, Vedral, V, Gu, M, Modi, K |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
American Physical Society
2016
|
Documenti analoghi
-
Power of one qumode for quantum computation
di: Liu, Nana, et al.
Pubblicazione: (2016) -
Power of one qumode for quantum computation
di: Liu, Nana, et al.
Pubblicazione: (2018) -
Non-destructively probing the thermodynamics of quantum systems with qumodes
di: Elliott, Thomas J., et al.
Pubblicazione: (2023) -
Quantum plug n’ play: modular computation in the quantum regime
di: Thompson, J, et al.
Pubblicazione: (2018) -
How discord underlies the noise resilience of quantum illumination
di: Weedbrook, C, et al.
Pubblicazione: (2016)