SciPost Submission Page
Implementing discrete-time quantum walks on multi-dimensional arbitrary graphs in circuit quantum electrodynamics
by Qi-Ping Su , Chen-Hui Peng, Li Yu, Wei Feng, Guo-Qiang Zhang and Chui-Ping Yang
This is not the latest submitted version.
Submission summary
| Authors (as registered SciPost users): | QiPing Su |
| Submission information | |
|---|---|
| Preprint Link: | scipost_202211_00003v1 (pdf) |
| Date submitted: | 2022-11-01 14:50 |
| Submitted by: | Su, QiPing |
| Submitted to: | SciPost Physics |
| Ontological classification | |
|---|---|
| Academic field: | Physics |
| Specialties: |
|
| Approach: | Theoretical |
Abstract
One of the final goals in quantum information science is to achieve large-scale quantum computing. Circuit QED (quantum electrodynamics) provides one of the best platforms for quantum computing. However, previous research focuses on implementing discrete-time quantum walks (DTQWs) on one-dimensional simple graphs based on circuit QED, which can only be used to realize quantum computing with a small size. To implement large-scale quantum computing, it becomes necessary and urgent to realize DTQWs on multi-dimensional graphs with arbitrary structures. We here propose a general protocol for realizing DTQWs on multi-dimensional arbitrary graphs based on circuit QED, where each graph node can have a different number of connected neighbor nodes. As an application, we numerically simulate a Grover walk search algorithm in a cubic graph. With decoherence considered, our simulation results fit well with the theoretical results. The protocol is universal and can be extended to accomplish the same task in a wide range of physical systems, which consist of natural or artificial atoms and optical or microwave cavities. This work paves an avenue to realize DTQWs on multi-dimensional arbitrary graphs, which could have broad applications in large-scale quantum computing and quantum simulation.
Current status:
Reports on this Submission
Report
The Authors described a protocol for implementing discrete-time quantum walks (DTQWs) on multi-dimensional (including 1D) graphs. The implementation is described for circuit-QED systems with superconducting qudits and cavities, such that the qudits correspond to the nodes of a given graph, and the cavities serve as the edges connecting these nodes. To show the usefulness of the protocol for implementing quantum algorithms, the Authors conducted simulations of a Grover search algorithm on a cubic graph with eight elements. Their numerical results based on 500 random simulations suggest that the target element can be found with a probability approaching 1 even by assuming experimentally feasible values of relevant parameters. These include: the coupling strength (of $g/2\pi=100$MHz) between the neighboring qudits, the Rabi frequency (of $\Omega/2\pi=100$MHz), detuning (of $\Delta/2\pi=100$GHz), relaxation time $T_1=5\mu s$, and dephasing time $T_2=T_1/2$, which are feasible using the current circuit QED technologies (but seemingly using also other quantum technologies).
(1) I think the theory of quantum walks itself is applied properly. However, possible problems may be in the implementation of QED itself on many qudits. This is crucial, because the manuscript reports (as its main result) a proposal of a circuit-QED implementation, rather than a new theoretical fundamental result.
The analysis of the applied gate operations is quite general, as given in the subsections on Process I (bottom of page 4) and Process II (bottom of page 5). Thus, it seems that the operations are not limited to circuit-QED implementations. In my opinion, similar values of the above-mentioned parameters are also experimentally feasible for trapped ions or other systems allowing to experimentally reach the ratio of $g/\Omega=1$, as assumed in Fig. 5. Anyway, I would suggest to clarify the issue whether it is possible or not (see also the comments below) to use other platforms by applying the transformations described in the above-mentioned subsections.
(2) The assumed qudits must have many levels (more than 3) and the operations require many sequences and a very high precision. I do not know to what extent this is currently achievable, but the Authors should clearly address this issue in the manuscript.
(3) The Authors mentioned that their method allows for walks on arbitrary graphs, but they only discussed the construction of a single element from which the whole graph can be assembled. It is like discussing only two qubits together with 1- and 2-qubit gates, and then saying that a quantum computer can be assembled from those. Although this is mathematically correct, but extremely challenging concerning any physical implementations. Considering the complexity of single operations (see the previous point), the whole system will be even more prone to imperfections.
(4) Although the Authors consider a simulation for Grover's search walk and consider simple noise models, this analysis is done too superficially in my opinion.
(5) I feel that the paper in its present form does not discuss a realistic circuit-QED implementation. The main result is effectively a decomposition of abstract unitarity operations, which are needed to realize a quantum walk, into sequences that can be theoretically realized in various platforms.
The discussion of realistic constraints and noise effects is very limited. Indeed, its considered via a general Lindblad master equation (in Appendix B), which can be applied in the same form for implementations using other platforms and just by modifying the values of the relevant parameters. Thus, a Reader of the manuscript would like to know some more details specific to the chosen circuit-QED platform.
Finally, I must admit that the paper is relatively clearly and consistently written, so one can easily follow the presentation and understand the protocol even concerning many details.
In conclusion, I could recommend the publication of this work in SciPost if the manuscript was adequately revised according to at least some of the above-mentioned issues.
Anonymous on 2024-07-04 [id 4601]
This manuscript presents a novel protocol for the implementation of discrete-time quantum walks (DTQWs) on multi-dimensional graphs using circuit quantum electrodynamics (circuit QED). The authors propose a general method where each node of the graph can have a varying number of connected neighbors, which is a significant advancement over previous research focusing on one-dimensional simple graphs. The protocol is demonstrated through the numerical simulation of a Grover walk search algorithm on a cubic graph, taking decoherence into account. The results indicate a relatively high probability of success, aligning well with theoretical expectations, and suggest that the protocol is feasible with current circuit QED technology. This work is interesting, and the following enhancements are recommended:
(1) The authors could provide more details on the initialization of quantum states, especially for the qudits used in the simulation.
(2) An analysis of the protocol's scalability, including the resource requirements and potential bottlenecks, would be valuable. The paper could provide a more detailed account of the resource requirements for implementing the protocol, such as the number of qubits or qudits, and the complexity of the required circuitry.
(3) Expanding on the potential applications of the protocol in quantum computing and simulation beyond the Grover search algorithm could illustrate its broader impact and utility.
(4) If the numerical simulation used the package Qutip, it should be cited.
(5) Related references could be updated.
(6) The paper would benefit from a conclusion that outlines future research directions, including potential improvements to the protocol and other applications that could be explored.
By addressing these suggestions, the paper could provide an even stronger contribution to the field of quantum information science and enhance its appeal to both theoretical and experimental researchers.