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 to be...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2018-01-01
|
| Series: | New Journal of Physics |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/1367-2630/aa99b3 |
| _version_ | 1797750774176940032 |
|---|---|
| author | Jayne Thompson Kavan Modi Vlatko Vedral Mile Gu |
| author_facet | Jayne Thompson Kavan Modi Vlatko Vedral Mile Gu |
| author_sort | Jayne Thompson |
| collection | DOAJ |
| 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-03-12T16:37:46Z |
| format | Article |
| id | doaj.art-b3b08885f53b4402a4d735d5935ab327 |
| institution | Directory Open Access Journal |
| issn | 1367-2630 |
| language | English |
| last_indexed | 2024-03-12T16:37:46Z |
| publishDate | 2018-01-01 |
| publisher | IOP Publishing |
| record_format | Article |
| series | New Journal of Physics |
| spelling | doaj.art-b3b08885f53b4402a4d735d5935ab3272023-08-08T14:48:47ZengIOP PublishingNew Journal of Physics1367-26302018-01-0120101300410.1088/1367-2630/aa99b3Quantum plug n’ play: modular computation in the quantum regimeJayne Thompson0Kavan Modi1Vlatko Vedral2Mile Gu3Centre for Quantum Technologies, National University of Singapore , SingaporeSchool of Physics and Astronomy, Monash University , AustraliaCentre for Quantum Technologies, National University of Singapore , Singapore; Department of Physics, University of Oxford , United KingdomCentre for Quantum Technologies, National University of Singapore , Singapore; School of Physical and Mathematical Sciences, Nanyang Technological University , Singapore; Complexity Institute, Nanyang Technological University , Singapore 639673, SingaporeClassical 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.https://doi.org/10.1088/1367-2630/aa99b3quantum informationquantum protocolquantum computing03.67.-a03.67.Ac |
| spellingShingle | Jayne Thompson Kavan Modi Vlatko Vedral Mile Gu Quantum plug n’ play: modular computation in the quantum regime New Journal of Physics quantum information quantum protocol quantum computing 03.67.-a 03.67.Ac |
| 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 quantum computing 03.67.-a 03.67.Ac |
| url | https://doi.org/10.1088/1367-2630/aa99b3 |
| work_keys_str_mv | AT jaynethompson quantumplugnplaymodularcomputationinthequantumregime AT kavanmodi quantumplugnplaymodularcomputationinthequantumregime AT vlatkovedral quantumplugnplaymodularcomputationinthequantumregime AT milegu quantumplugnplaymodularcomputationinthequantumregime |