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...
Главные авторы: | Liu, N, Thompson, J, Weedbrook, C, Lloyd, S, Vedral, V, Gu, M, Modi, K |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
American Physical Society
2016
|
Схожие документы
-
Power of one qumode for quantum computation
по: Liu, Nana, и др.
Опубликовано: (2016) -
Power of one qumode for quantum computation
по: Liu, Nana, и др.
Опубликовано: (2018) -
Non-destructively probing the thermodynamics of quantum systems with qumodes
по: Elliott, Thomas J., и др.
Опубликовано: (2023) -
Quantum plug n’ play: modular computation in the quantum regime
по: Thompson, J, и др.
Опубликовано: (2018) -
How discord underlies the noise resilience of quantum illumination
по: Weedbrook, C, и др.
Опубликовано: (2016)