Quantum walks and quantum search on graphene lattices

@article{Foulger2015QuantumWA,
  title={Quantum walks and quantum search on graphene lattices},
  author={Iain Foulger and Sven Gnutzmann and Gregor Tanner},
  journal={Physical Review A},
  year={2015},
  volume={91},
  pages={062323},
  url={https://api.semanticscholar.org/CorpusID:118480006}
}
This work describes how the need for extra degrees of freedom can be negated by utilising a graphene lattice, demonstrating that a continuous-time quantum search in the experimentally relevant regime of two-dimensions is possible and demonstrates the feasibility of realising the quantum search and transfer mechanisms on graphene.
[PDF] Semantic Reader

Figures from this paper

21 Citations

Floquet engineering of continuous-time quantum walks: Toward the simulation of complex and next-nearest-neighbor couplings

This paper defines periodically driven Hamiltonians which can be used to simulate the dynamics of certain target continuous-time quantum walks and provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks, or investigating quantum dynamics in highly connected structures.

Continuous-time quantum walks on planar lattices and the role of the magnetic field

We address the dynamics of continuous-time quantum walk (CTQW) on planar 2D lattice graphs, i.e. those forming a regular tessellation of the Euclidean plane (triangular, square, and honeycomb lattice…

Staggered Quantum Walks on Graphs

The staggered quantum walk model allows to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the…

Quantum walk transport properties on graphene structures.

We present numerical studies of quantum walks on C 60 and related graphene structures to investigate their transport properties. Also known as a honeycomb lattice, the lattice formed by carbon…

Strategies to simulate dephasing-assisted quantum transport on digital quantum computers

The non-unitary dynamics of the open system is obtained through effective representations of the environment, paving the way to digital quantum simulations of quantum transport influenced by structured environments.

Quantum search with prior knowledge

This work considers a network that consists of different types of edges, such that the transitions between nodes result in extra edge-dependent phase shift, and combines amplitude amplification and phase estimation to develop an algorithm for exploring such networks.

The Dirac equation as a quantum walk over the honeycomb and triangular lattices

It is shown that the Dirac equation in $(2+1)$ dimensions can be simulated, through local unitaries, on the honeycomb or the triangular lattice, both of interest in the study of quantum propagation on the nonrectangular grids, as in graphene-like materials.

Quantum transport on honeycomb networks

We study the transport properties on honeycomb networks motivated by graphene structures by using the continuous-time quantum walk (CTQW) model. For various relevant topologies we consider the…

From curved spacetime to spacetime-dependent local unitaries over the honeycomb and triangular Quantum Walks

It is shown that the spacetime-dependent QW simulates the Dirac equation in (2 + 1)–dimensional curved spacetime, and opens the possibility to simulate field theories on curved manifolds via the quantum walk on different kinds of lattices.

Quantum circuits for discrete-time quantum walks with position-dependent coin operator

The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator, and it is shown that for a position dependence of the coin operator (the block-diagonal unitary) which is smooth enough, one can find an efficient quantum-circuit implementation approximating the coin operator up to an error.

88 References

Quantum Walks and Search Algorithms

The reader will benefit from the pedagogical aspects of the book, learning faster and with more ease than would be possible from the primary research literature, and guidelines for the use of computer programs to simulate the evolution of quantum walks are provided.

Quantum Walk in Position Space with Single Optically Trapped Atoms

In this experiment, a quantum walk on the line with single neutral atoms is implemented by deterministically delocalizing them over the sites of a one-dimensional spin-dependent optical lattice and its spatial coherence is demonstrated.

Under consideration for publication in Math. Struct. in Comp. Science Decoherence in quantum walks- a review

    Physics, Computer Science
  • 2006

Microwave experiments simulating quantum search and directed transport in artificial graphene.

A proof of principle experiment implementing wave search algorithms and directed wave transport in a graphene lattice arrangement based on bringing localized search states into resonance with an extended lattice state in an energy region of low spectral density at or near the Dirac point.

Quantum walks: a comprehensive review

This paper has reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.

Alternate two-dimensional quantum walk with a single-qubit coin

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker…

Experimental realization of a delayed-choice quantum walk

This is the first experiment realizing a multi-dimensional quantum walk with a single photon source and the first experimental simulation of the Grover walk, a model that can be used to implement theGrover quantum search algorithm.

Spatial search by continuous-time quantum walks on crystal lattices

By constructing lattice Hamiltonians exhibiting Dirac points in their dispersion relations and exploiting the linear behavior near a Dirac point, this work develops algorithms that solve the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk in a time of $O(\sqrt{N})$.

Realization of quantum walks with negligible decoherence in waveguide lattices.

It is shown that the propagation of photons in waveguide lattices, which have been studied extensively in recent years, are essentially an implementation of quantum walks.

One-dimensional quantum walks

A quantum analog of the symmetric random walk, which the authors call the Hadamard walk, is analyzed, which has position that is nearly uniformly distributed in the range after steps, in sharp contrast to the classical random walk.
...