# Quantum Networks on Cubelike Graphs

@article{Bernasconi2008QuantumNO, title={Quantum Networks on Cubelike Graphs}, author={Anna Bernasconi and Chris D. Godsil and Simone Severini}, journal={Physical Review A}, year={2008}, volume={78}, pages={052320} }

Cubelike graphs are the Cayley graphs of the elementary Abelian group ${\mathbb{Z}}_{2}^{n}$ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in quantum networks modeled by a large class of cubelike graphs. This generalizes the results of Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and Facer et al. [Phys. Rev. A 92, 187902 (2008)].

## 67 Citations

### Perfect state transfer on abelian Cayley graphs

- MathematicsLinear Algebra and its Applications
- 2019

### Uniform mixing on abelian Cayley graphs

- Mathematics
- 2019

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. In 2003, Childs et al. found a graph in which the continuous-time quantum walk…

### Perfect State Transfer in Weighted Cubelike Graphs

- Mathematics
- 2021

A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the…

### Perfect edge state transfer on cubelike graphs

- MathematicsQuantum Inf. Process.
- 2021

This paper gives a characterization of cubelike graphs having perfect edge state transfer by using a lifting technique, and shows that every bent function, and some semi-bent functions as well, can produce some graphs having PEST.

### Perfect state transfer on Cayley graphs over dihedral groups

- MathematicsLinear and Multilinear Algebra
- 2019

Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs…

### Quantum simulation of perfect state transfer on weighted cubelike graphs

- MathematicsArXiv
- 2021

It can be shown that the adjacency matrix of a cubelike graph is a finite sum of tensor products of Pauli X operators, and this fact is used to construct an efficient quantum circuit for the quantum walk on cubelikes graphs.

### Quantum walks on Cayley graphs

- Mathematics
- 2006

We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the…

### Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups

- MathematicsAlgebraic Combinatorics
- 2022

We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian $p$-groups, called extraspecial $2$-groups. By applying general results for graphs in association schemes we…

### Some results on uniform mixing on abelian Cayley graphs.

- Mathematics
- 2020

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum…

### Perfect quantum state transfer on diamond fractal graphs

- PhysicsQuantum Inf. Process.
- 2020

Methods from fractal analysis and probability are used to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer, and which have a wide range of different Hausdorff and spectral dimensions.

## References

SHOWING 1-10 OF 36 REFERENCES

### Colouring Cayley Graphs

- Mathematics
- 1988

We will discuss three ways to bound the chromatic number on a Cayley graph. (a) If the connection set contains information about a smaller graph, then these two graphs are related. Using this…

### A note on graphs resistant to quantum uniform mixing

- Mathematics
- 2003

Continuous-time quantum walks on graphs is a generalization of continuous-time Markov chains on discrete structures. Moore and Russell proved that the continuous-time quantum walk on the $n$-cube is…

### Perfect state transfer over distance-regular spin networks

- Physics
- 2008

Christandl et al. have noted that the d-dimensional hypercube can be projected to a linear chain with d+1 sites so that, by considering fixed but different couplings between the qubits assigned to…

### An Example of the Difference Between Quantum and Classical Random Walks

- Physics, MathematicsQuantum Inf. Process.
- 2002

A general definition of quantum random walks on graphs is discussed and with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog is illustrated.

### Mixing of quantum walk on circulant bunkbeds

- MathematicsQuantum Inf. Comput.
- 2006

This paper gives new observations on the mixing dynamics of a continuous-time quantumwalk on circulants and their bunkbed extensions through the join G + H and the Cartesian product G × H of graphs G and H.

### Optimal transfer of a d-level quantum state over pseudo-distance-regular networks

- Physics
- 2008

In the previous work (Jafarizadeh and Sufiani 2008 Phys. Rev. A 77 022315), by using some techniques such as stratification and spectral distribution associated with the graphs, perfect state…

### Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem

- Mathematics, Computer ScienceIEEE Trans. Computers
- 1999

This paper shows that the Walsh spectrum of Boolean functions can be analyzed by looking at algebraic properties of a class of Cayley graphs associated with Boolean functions.

### Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions

- MathematicsComputational Discrete Mathematics
- 2001

This study relates the 0/1-case of Borsuk's problem to the coloring problem for the Hamming graphs, to the geometry of a Hamming code, as well as to some upper bounds for the sizes of binary codes.

### Computational Discrete Mathematics

- Computer ScienceLecture Notes in Computer Science
- 2001

This work presents a description of this puzzle of the apparent duality between the nonlinear Kerdock and Preparata codes and a brief introduction to codes over Z4.

### Learning Boolean Functions via the Fourier Transform

- Computer Science
- 1994

The Fourier Transform representation for functions whose inputs are boolean has been far less studied, but it seems that it can be used to learn many classes of boolean functions.