Related papers: Quantum simulation of perfect state transfer on weighted cubelike graphs

Quantum simulation of perfect state transfer on weighted cubelike graphs

URL: http://arxiv.org/abs/2111.00226v1
Date: Sat, 30 Oct 2021 10:42:54 GMT
Title: Quantum simulation of perfect state transfer on weighted cubelike graphs
Authors: Jaideep Mulherkar and Rishikant Rajdeepak and V. Sunitha
Abstract summary: A continuous-time quantum walk on a graph evolves according to the unitary operator $e-iAt$. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node to another node with $100%$ fidelity.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: A continuous-time quantum walk on a graph evolves according to the unitary operator $e^{-iAt}$, where $A$ is the adjacency matrix of the graph. Perfect state transfer (PST) in a quantum walk is the transfer of a quantum state from one node of a graph to another node with $100\%$ fidelity. It can be shown that the adjacency matrix of a cubelike graph is a finite sum of tensor products of Pauli $X$ operators. We use this fact to construct an efficient quantum circuit for the quantum walk on cubelike graphs. In \cite{Cao2021, rishi2021(2)}, a characterization of integer weighted cubelike graphs is given that exhibit periodicity or PST at time $t=\pi/2$. We use our circuits to demonstrate PST or periodicity in these graphs on IBM's quantum computing platform~\cite{Qiskit, IBM2021}.

Related papers

Implementation of Continuous-Time Quantum Walk on Sparse Graph [0.0]
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing. How to efficiently implement CTQWs is a challenging issue. In this paper, we study implementation of CTQWs on sparse graphs.
arXiv Detail & Related papers (2024-08-20T05:20:55Z)
Relation of curvature and torsion of weighted graph states with graph properties and its studies on a quantum computer [0.0]
The velocity of quantum evolution is determined by the sum of the weighted degrees of nodes in the graph. The curvature depends on the sum of the products of the weights of edges forming squares in graph $G(V, E)$. The torsion in addition is related to the sum of the products of the weights of edges in graph $G(V, E)$ forming triangles.
arXiv Detail & Related papers (2024-08-02T18:09:15Z)
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling [30.53587208999909]
We give a quantum algorithm for computing an $epsilon$-approximate Nash equilibrium of a zero-sum game in a $m times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $widetildeO(sqrtm + ncdot epsilon-2.5 + epsilon-3)$ and outputs a classical representation of the $epsilon$-approximate Nash equilibrium.
arXiv Detail & Related papers (2023-01-10T02:56:49Z)
Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z)
From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z)
Algebraic Bethe Circuits [58.720142291102135]
We bring the Algebraic Bethe Ansatz (ABA) into unitary form, for its direct implementation on a quantum computer. Our algorithm is deterministic and works for both real and complex roots of the Bethe equations. We derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.
arXiv Detail & Related papers (2022-02-09T19:00:21Z)
Perfect State Transfer in Weighted Cubelike Graphs [0.0]
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on a graph. We generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs.
arXiv Detail & Related papers (2021-09-26T13:44:44Z)
Implementation of hitting times of discrete time quantum random walks on Cubelike graphs [0.0]
We show an implementation of the hitting time of a discrete time quantum random walk on cubelike graphs. We extend the study to another family of cubelike graphs called the augmented cubes.
arXiv Detail & Related papers (2021-08-31T11:49:34Z)
How to Teach a Quantum Computer a Probability Distribution [0.0]
We explore teaching a coined discrete time quantum walk on a regular graph a probability distribution. We also discuss some hardware and software concerns as well as immediate applications and the several connections to machine learning.
arXiv Detail & Related papers (2021-04-15T02:41:27Z)
Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z)
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.