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...
| Egile Nagusiak: | , , , , , , |
|---|---|
| Formatua: | Journal article |
| Hizkuntza: | English |
| Argitaratua: |
American Physical Society
2016
|
| _version_ | 1826304432658186240 |
|---|---|
| author | Liu, N Thompson, J Weedbrook, C Lloyd, S Vedral, V Gu, M Modi, K |
| author_facet | Liu, N Thompson, J Weedbrook, C Lloyd, S Vedral, V Gu, M Modi, K |
| author_sort | Liu, N |
| collection | OXFORD |
| description | 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 phase estimation, which includes applications like factoring. We introduce a computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, we can use the amount of squeezing to quantitatively relate the resource requirements of DQC1 and factoring. Furthermore, we can connect the squeezing to other known resources like precision, energy, qudit dimensionality, and qubit number. We show the circumstances under which they can likewise be considered good resources. |
| first_indexed | 2024-03-07T06:17:44Z |
| format | Journal article |
| id | oxford-uuid:f1a99bdb-ba5f-4fa5-9cb7-d07b4e114889 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T06:17:44Z |
| publishDate | 2016 |
| publisher | American Physical Society |
| record_format | dspace |
| spelling | oxford-uuid:f1a99bdb-ba5f-4fa5-9cb7-d07b4e1148892022-03-27T11:57:40ZPower of one qumode for quantum computationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:f1a99bdb-ba5f-4fa5-9cb7-d07b4e114889EnglishSymplectic Elements at OxfordAmerican Physical Society2016Liu, NThompson, JWeedbrook, CLloyd, SVedral, VGu, MModi, KAlthough 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 phase estimation, which includes applications like factoring. We introduce a computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, we can use the amount of squeezing to quantitatively relate the resource requirements of DQC1 and factoring. Furthermore, we can connect the squeezing to other known resources like precision, energy, qudit dimensionality, and qubit number. We show the circumstances under which they can likewise be considered good resources. |
| spellingShingle | Liu, N Thompson, J Weedbrook, C Lloyd, S Vedral, V Gu, M Modi, K Power of one qumode for quantum computation |
| title | Power of one qumode for quantum computation |
| title_full | Power of one qumode for quantum computation |
| title_fullStr | Power of one qumode for quantum computation |
| title_full_unstemmed | Power of one qumode for quantum computation |
| title_short | Power of one qumode for quantum computation |
| title_sort | power of one qumode for quantum computation |
| work_keys_str_mv | AT liun powerofonequmodeforquantumcomputation AT thompsonj powerofonequmodeforquantumcomputation AT weedbrookc powerofonequmodeforquantumcomputation AT lloyds powerofonequmodeforquantumcomputation AT vedralv powerofonequmodeforquantumcomputation AT gum powerofonequmodeforquantumcomputation AT modik powerofonequmodeforquantumcomputation |