2021
DOI: 10.48550/arxiv.2111.00226
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum simulation of perfect state transfer on weighted cubelike graphs

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 [5,15], a c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…QWs can -in the main -be classified into two categories, viz. discrete- [2,25] and continuous-time [8,20,26] ones. Quantum walks have been experimentally realized in nuclear magnetic resonance systems, photons in waveguides, trapped atoms, synthetic gauge fields in a three-dimensional lattice, Fibonacci fibers, superconducting qubits, etc.…”
Section: Introductionmentioning
confidence: 99%
“…QWs can -in the main -be classified into two categories, viz. discrete- [2,25] and continuous-time [8,20,26] ones. Quantum walks have been experimentally realized in nuclear magnetic resonance systems, photons in waveguides, trapped atoms, synthetic gauge fields in a three-dimensional lattice, Fibonacci fibers, superconducting qubits, etc.…”
Section: Introductionmentioning
confidence: 99%