Quantum plug n’ play: modular computation in the quantum regime
Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-fabricated circuits without knowing their construction. This bestows advantages such as allowing parts of the computational process to be outsourced, and permitting individual circuit components t...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/89036 http://hdl.handle.net/10220/44761 |
| _version_ | 1826119342646886400 |
|---|---|
| author | Thompson, Jayne Modi, Kavan Vedral, Vlatko Gu, Mile |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Thompson, Jayne Modi, Kavan Vedral, Vlatko Gu, Mile |
| author_sort | Thompson, Jayne |
| collection | NTU |
| description | Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-fabricated circuits without knowing their construction. This bestows advantages such as allowing parts of the computational process to be outsourced, and permitting individual circuit components to be exchanged and upgraded. Here, we introduce a formal framework to describe modularity in the quantum regime. We demonstrate a 'no-go' theorem, stipulating that it is not always possible to make use of quantum circuits without knowing their construction. This has significant consequences for quantum algorithms, forcing the circuit implementation of certain quantum algorithms to be rebuilt almost entirely from scratch after incremental changes in the problem—such as changing the number being factored in Shor's algorithm. We develop a workaround capable of restoring modularity, and apply it to design a modular version of Shor's algorithm that exhibits increased versatility and reduced complexity. In doing so we pave the way to a realistic framework whereby 'quantum chips' and remote servers can be invoked (or assembled) to implement various parts of a more complex quantum computation. |
| first_indexed | 2024-10-01T04:58:44Z |
| format | Journal Article |
| id | ntu-10356/89036 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:58:44Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | ntu-10356/890362023-02-28T19:23:42Z Quantum plug n’ play: modular computation in the quantum regime Thompson, Jayne Modi, Kavan Vedral, Vlatko Gu, Mile School of Physical and Mathematical Sciences Quantum Information Quantum Protocol Classical computation is modular. It exploits plug n' play architectures which allow us to use pre-fabricated circuits without knowing their construction. This bestows advantages such as allowing parts of the computational process to be outsourced, and permitting individual circuit components to be exchanged and upgraded. Here, we introduce a formal framework to describe modularity in the quantum regime. We demonstrate a 'no-go' theorem, stipulating that it is not always possible to make use of quantum circuits without knowing their construction. This has significant consequences for quantum algorithms, forcing the circuit implementation of certain quantum algorithms to be rebuilt almost entirely from scratch after incremental changes in the problem—such as changing the number being factored in Shor's algorithm. We develop a workaround capable of restoring modularity, and apply it to design a modular version of Shor's algorithm that exhibits increased versatility and reduced complexity. In doing so we pave the way to a realistic framework whereby 'quantum chips' and remote servers can be invoked (or assembled) to implement various parts of a more complex quantum computation. NRF (Natl Research Foundation, S’pore) MOE (Min. of Education, S’pore) Published version 2018-05-09T03:09:50Z 2019-12-06T17:16:27Z 2018-05-09T03:09:50Z 2019-12-06T17:16:27Z 2018 Journal Article Thompson, J., Modi, K., Vedral, V., & Gu, M. (2018). Quantum plug n’ play: modular computation in the quantum regime. New Journal of Physics, 20(1), 013004-. 1367-2630 https://hdl.handle.net/10356/89036 http://hdl.handle.net/10220/44761 10.1088/1367-2630/aa99b3 en New Journal of Physics © 2018 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft. Original content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. 13 p. application/pdf |
| spellingShingle | Quantum Information Quantum Protocol Thompson, Jayne Modi, Kavan Vedral, Vlatko Gu, Mile Quantum plug n’ play: modular computation in the quantum regime |
| title | Quantum plug n’ play: modular computation in the quantum regime |
| title_full | Quantum plug n’ play: modular computation in the quantum regime |
| title_fullStr | Quantum plug n’ play: modular computation in the quantum regime |
| title_full_unstemmed | Quantum plug n’ play: modular computation in the quantum regime |
| title_short | Quantum plug n’ play: modular computation in the quantum regime |
| title_sort | quantum plug n play modular computation in the quantum regime |
| topic | Quantum Information Quantum Protocol |
| url | https://hdl.handle.net/10356/89036 http://hdl.handle.net/10220/44761 |
| work_keys_str_mv | AT thompsonjayne quantumplugnplaymodularcomputationinthequantumregime AT modikavan quantumplugnplaymodularcomputationinthequantumregime AT vedralvlatko quantumplugnplaymodularcomputationinthequantumregime AT gumile quantumplugnplaymodularcomputationinthequantumregime |