Implementing arbitrary quantum operations via quantum walks on a cycle graph
Jia-Yi Lin, Xin-Yu Li, Yu-Hao Shao, Wei Wang, and Shengjun Wu

TL;DR
This paper introduces a quantum neural network based on discrete-time quantum walks on a cycle graph, capable of implementing arbitrary unitary operations and measurements without decomposition, with efficient training and noise robustness.
Contribution
It presents a universal DTQW-based neural network model for quantum operations, enabling direct implementation and training of arbitrary unitaries and POVMs.
Findings
Can realize any unitary operation via appropriate coin operators
Capable of approximating arbitrary unitaries through training
Demonstrates implementation of arbitrary 2-outcome POVMs
Abstract
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
