A high-fidelity quantum state transfer algorithm on the complete bipartite graph

• URL: http://arxiv.org/abs/2302.11931v1
• Date: Thu, 23 Feb 2023 11:20:12 GMT
• Title: A high-fidelity quantum state transfer algorithm on the complete bipartite graph
• Authors: Dan Li, Jia-Ni Huang, Yu-Qian Zhou and Yu-Guang Yang
• Abstract summary: Current quantum state transfer algorithms on the complete bipartite graph suffer from low fidelity in some cases. We propose a two-stage quantum state transfer algorithm on the complete bipartite graph.
• Score: 15.305667582809924
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search algorithms, suffer from low fidelity in some cases. To solve this problem, in this paper we propose a two-stage quantum state transfer algorithm on the complete bipartite graph. The algorithm is achieved by the generalized Grover walk with one marked vertex. The generalized Grover walk's coin operators and the query oracles are both parametric unitary matrices, which are designed flexibly based on the positions of the sender and receiver and the size of the complete bipartite graph. We prove that the fidelity of the algorithm is greater than $1-2\epsilon_{1}-\epsilon_{2}-2\sqrt{2}\sqrt{\epsilon_{1}\epsilon_{2}}$ or $1-(2+2\sqrt{2})\epsilon_{1}-\epsilon_{2}-(2+2\sqrt{2})\sqrt{\epsilon_{1}\epsilon_{2}}$ for any adjustable parameters $\epsilon_{1}$ and $\epsilon_{2}$ when the sender and receiver are in the same partition or different partitions of the complete bipartite graph. The algorithm provides a novel approach to achieve high-fidelity quantum state transfer on the complete bipartite graph in any case, which will offer potential applications for quantum information processing.

Related papers

• Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact [2.871419116565751]
  This article presents a novel and succinct algorithmic framework via alternating quantum walks. It unifies quantum spatial search, state transfer and uniform sampling on a large class of graphs. The approach is easy to use since it has a succinct formalism that depends only on the depth of the Laplacian eigenvalue set of the graph.
  arXiv  Detail & Related papers  (2024-07-01T06:09:19Z)
• Quantum algorithms for Hopcroft's problem [45.45456673484445]
  We study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n4/3)$ time. Our results are two different quantum algorithms with time complexity $widetilde O(n5/6)$.
  arXiv  Detail & Related papers  (2024-05-02T10:29:06Z)
• Quantum Counting on the Complete Bipartite Graph [0.0]
  Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. Since Grover's algorithm can be viewed as a quantum walk on a complete graph, a natural way to extend quantum counting is to use the evolution operator of quantum-walk-based search on non-complete graphs.
  arXiv  Detail & Related papers  (2023-11-17T09:22:28Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• Implementation of Continuous-Time Quantum Walks on Quantum Computers [0.0]
  Quantum walks are interesting candidates to be implemented on quantum computers. We describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes.
  arXiv  Detail & Related papers  (2022-12-17T14:59:21Z)
• Quantum walk based state transfer algorithms on the complete M-partite graph [0.0]
  We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. We show that when the sender and the receiver are in different partitions the algorithm succeeds with fidelity approaching unity for a large graph. However, when the sender and the receiver are in the same partition the fidelity does not reach exactly one.
  arXiv  Detail & Related papers  (2022-12-01T14:52:49Z)
• Quantum Approximate Counting for Markov Chains and Application to Collision Counting [0.0]
  We show how to generalize the quantum approximate counting technique developed by Brassard, Hoyer and Tapp [ICALP 1998] to estimating the number of marked states of a Markov chain. This makes it possible to construct quantum approximate counting algorithms from quantum search algorithms based on the powerful "quantum walk based search" framework established by Magniez, Nayak, Roland and Santha.
  arXiv  Detail & Related papers  (2022-04-06T03:04:42Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.