Please use this identifier to cite or link to this item: https://doi.org/10.1038/s42005-021-00606-3
Title: Realising and compressing quantum circuits with quantum reservoir computing
Authors: Ghosh, Sanjib
Krisnanda, Tanjung
Paterek, Tomasz 
Liew, Timothy C. H. 
Issue Date: 21-May-2021
Publisher: Nature Research
Citation: Ghosh, Sanjib, Krisnanda, Tanjung, Paterek, Tomasz, Liew, Timothy C. H. (2021-05-21). Realising and compressing quantum circuits with quantum reservoir computing. Communications Physics 4 (1) : 105. ScholarBank@NUS Repository. https://doi.org/10.1038/s42005-021-00606-3
Rights: Attribution 4.0 International
Abstract: Quantum computers require precise control over parameters and careful engineering of the underlying physical system. In contrast, neural networks have evolved to tolerate imprecision and inhomogeneity. Here, using a reservoir computing architecture we show how a random network of quantum nodes can be used as a robust hardware for quantum computing. Our network architecture induces quantum operations by optimising only a single layer of quantum nodes, a key advantage over the traditional neural networks where many layers of neurons have to be optimised. We demonstrate how a single network can induce different quantum gates, including a universal gate set. Moreover, in the few-qubit regime, we show that sequences of multiple quantum gates in quantum circuits can be compressed with a single operation, potentially reducing the operation time and complexity. As the key resource is a random network of nodes, with no specific topology or structure, this architecture is a hardware friendly alternative paradigm for quantum computation. © 2021, The Author(s).
Source Title: Communications Physics
URI: https://scholarbank.nus.edu.sg/handle/10635/233056
ISSN: 2399-3650
DOI: 10.1038/s42005-021-00606-3
Rights: Attribution 4.0 International
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
10_1038_s42005-021-00606-3.pdf1.02 MBAdobe PDF

OPEN

NoneView/Download

SCOPUSTM   
Citations

10
checked on Nov 29, 2022

Page view(s)

16
checked on Dec 1, 2022

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons