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...
Auteurs principaux: | Liu, N, Thompson, J, Weedbrook, C, Lloyd, S, Vedral, V, Gu, M, Modi, K |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
American Physical Society
2016
|
Documents similaires
-
Power of one qumode for quantum computation
par: Liu, Nana, et autres
Publié: (2016) -
Power of one qumode for quantum computation
par: Liu, Nana, et autres
Publié: (2018) -
Non-destructively probing the thermodynamics of quantum systems with qumodes
par: Elliott, Thomas J., et autres
Publié: (2023) -
Quantum plug n’ play: modular computation in the quantum regime
par: Thompson, J, et autres
Publié: (2018) -
How discord underlies the noise resilience of quantum illumination
par: Weedbrook, C, et autres
Publié: (2016)