Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1409.2382 · Physical Review Letters

Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene

Julian Böhm, Matthieu Bellec, Fabrice Mortessagne, Ulrich Kuhl, Sonja Barkhofen, Stefan Gehler, H.‐J. Stöckmann, Iain Foulger, Sven Gnutzmann∥, Gregor Tanner

Published Mar 17, 2015• 34 citations
arXivHTMLPDF

Abstract

A series of quantum search algorithms have been proposed recently providing an algebraic speedup compared to classical search algorithms from N to √N, where N is the number of items in the search space. In particular, devising searches on regular lattices has become popular in extending Grover's original algorithm to spatial searching. Working in a tight-binding setup, it could be demonstrated, theoretically, that a search is possible in the physically relevant dimensions 2 and 3 if the lattice spectrum possesses Dirac points. We present here a proof of principle experiment implementing wave search algorithms and directed wave transport in a graphene lattice arrangement. The idea is based on bringing localized search states into resonance with an extended lattice state in an energy region of low spectral density-namely, at or near the Dirac point. The experiment is implemented using classical waves in a microwave setup containing weakly coupled dielectric resonators placed in a honeycomb arrangement, i.e., artificial graphene. Furthermore, we investigate the scaling behavior experimentally using linear chains.

DOI
10.1103/physrevlett.114.110501

Related papers

Quantum Search on Graphene Lattices

Iain Foulger, Sven Gnutzmann∥, Gregor Tanner

We present a continuous-time quantum search algorithm on a graphene lattice. This provides the sought-after implementation of an efficient continuous-time quantum search on a two-dimensional lattice. The search uses the linearity of the dispersion relation near the Dirac point and can find a marked site on a graphene lattice faster than the corresponding classical search. The algorithm can also be used for state transfer and communication.

arXiv:1312.3852•Physical Review Letters•Feb 21, 2014•38 citations

Quantum walks and quantum search on graphene lattices

Iain Foulger, Sven Gnutzmann∥, Gregor Tanner

Quantum walks have been very useful in developing search algorithms in quantum information, in particular for devising of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in two-dimensional lattices has proved difficult, requiring additional degrees of freedom. Here, we demonstrate that a continuous-time quantum walk search is possible in two dimensions by changing the search topology to a graphene lattice, utilizing the Dirac point in the energy spectrum. This is made possible by making a change to standard methods of marking a particular site in the lattice. Various ways of marking a site are shown to result in successful search protocols. We further establish that the search can be adapted to transfer probability amplitude across the lattice between specific lattice sites thus establishing a line of communication between these sites.

arXiv:1501.07543•Physical Review A•Jun 18, 2015•31 citations

Graphene band structure in circuit quantum electrodynamics

Ednilson Lopes, Valentina Spohr, Alberto Saa +1 more

Circuit QED lattices provide a powerful and versatile platform for quantum simulation of condensed matter systems, enabling the realization of engineered photonic lattices with tunable geometries and interactions. In these systems, coupled CPW resonators form effective lattices whose site energies and hopping amplitudes are determined by the resonator geometry and coupling mechanisms. In this work, we propose and investigate the simulation of the honeycomb lattice of graphene, by an architecture based on inductive coupling, eliminating the need for discrete multiport capacitive elements and thereby enabling new flexibility in the implementation of geometries such as Bravais lattice. Using full-wave electromagnetic simulations, we analyze some lattice configurations, extracting effective tightbinding parameters. We systematically study the evolution of the energy spectrum as a function of lattice size, demonstrating the progressive closing of finite-size gaps, including the role of edge effects in small lattices and their suppression in larger structures, and the emergence of band-touching points associated with Dirac cones. The results show clear agreement with the expected behavior of infinite graphene systems.

Symposium on Microelectronics Technology and Devices•Aug 1, 2026•0 citations

Graphene-like physics in optical lattices

Feng Mei, Dan-Wei Zhang, Shi-Liang Zhu

Graphene has attracted enormous attention over the past years in condensed matter physics. The most interesting feature of graphene is that its low-energy excitations are relativistic Dirac fermions. Such feature is the origin of many topological properties in graphene-like physics. On the other hand, ultracold quantum gas trapped in an optical lattice has become a unique setting for quantum simulation of condensed matter physics. Here, we mainly review our recent work on quantum simulation of graphene-like physics with ultracold atoms trapped in a honeycomb or square optical lattice, including the simulation of Dirac fermions and quantum Hall effect with and without Landau levels. We also present the related experimental advances.

Chinese Physics B•Nov 1, 2013•12 citations

Quantum search algorithms on a regular lattice

Birgit Hein, Gregor Tanner

Quantum algorithms for searching for one or more marked items on a $d$-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For $d=2$ and $d=3$, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

arXiv:1005.3676•Physical Review A•Jul 23, 2010•37 citations

Adiabatic quantum algorithm for artificial graphene

Axel Pérez-Obiol, Adrián Pérez-Salinas, Sergio Sanchez +2 more

We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic, spin-orbit, and Coulomb terms. The initial state is obtained efficiently using Gaussian-state preparation, while the readout of the ground energy is organized into seventeen sets of measurements, irrespective of the size of the problem. The total depth of the corresponding quantum circuit scales polynomially with the size of the system. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons. Our results are benchmarked with exact diagonalization for systems with one and two hexagons. For larger systems we use the exact state vector and approximate matrix product state simulation techniques. The latter allows us to systematically trade off precision with memory and therefore to tackle larger systems. We analyze adiabatic and Trotterization errors, providing estimates for optimal periods and time discretizations given a finite accuracy. In the case of large systems we also study approximation errors.

arXiv:2204.03013•Physical Review A•Nov 8, 2022•11 citations
A series of quantum search algorithms have been proposed recently providing an algebraic speedup compared to classical search algorithms from N to √N, where N is the number of items in the search space. In particular, devising searches on regular lattices has become popular in extending Grover's original algorithm to spatial searching. Working in a tight-binding setup, it could be demonstrated, theoretically, that a search is possible in the physically relevant dimensions 2 and 3 if the lattice spectrum possesses Dirac points. We present here a proof of principle experiment implementing wave search algorithms and directed wave transport in a graphene lattice arrangement. The idea is based on bringing localized search states into resonance with an extended lattice state in an energy region of low spectral density-namely, at or near the Dirac point. The experiment is implemented using classical waves in a microwave setup containing weakly coupled dielectric resonators placed in a honeycomb arrangement, i.e., artificial graphene. Furthermore, we investigate the scaling behavior experimentally using linear chains.
Quantum walks have been very useful in developing search algorithms in quantum information, in particular for devising of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in two-dimensional lattices has proved difficult, requiring additional degrees of freedom. Here, we demonstrate that a continuous-time quantum walk search is possible in two dimensions by changing the search topology to a graphene lattice, utilizing the Dirac point in the energy spectrum. This is made possible by making a change to standard methods of marking a particular site in the lattice. Various ways of marking a site are shown to result in successful search protocols. We further establish that the search can be adapted to transfer probability amplitude across the lattice between specific lattice sites thus establishing a line of communication between these sites.
Circuit QED lattices provide a powerful and versatile platform for quantum simulation of condensed matter systems, enabling the realization of engineered photonic lattices with tunable geometries and interactions. In these systems, coupled CPW resonators form effective lattices whose site energies and hopping amplitudes are determined by the resonator geometry and coupling mechanisms. In this work, we propose and investigate the simulation of the honeycomb lattice of graphene, by an architecture based on inductive coupling, eliminating the need for discrete multiport capacitive elements and thereby enabling new flexibility in the implementation of geometries such as Bravais lattice. Using full-wave electromagnetic simulations, we analyze some lattice configurations, extracting effective tightbinding parameters. We systematically study the evolution of the energy spectrum as a function of lattice size, demonstrating the progressive closing of finite-size gaps, including the role of edge effects in small lattices and their suppression in larger structures, and the emergence of band-touching points associated with Dirac cones. The results show clear agreement with the expected behavior of infinite graphene systems.
Graphene has attracted enormous attention over the past years in condensed matter physics. The most interesting feature of graphene is that its low-energy excitations are relativistic Dirac fermions. Such feature is the origin of many topological properties in graphene-like physics. On the other hand, ultracold quantum gas trapped in an optical lattice has become a unique setting for quantum simulation of condensed matter physics. Here, we mainly review our recent work on quantum simulation of graphene-like physics with ultracold atoms trapped in a honeycomb or square optical lattice, including the simulation of Dirac fermions and quantum Hall effect with and without Landau levels. We also present the related experimental advances.
Quantum algorithms for searching for one or more marked items on a ddd-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2d=2d=2 and d=3d=3d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.
We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic, spin-orbit, and Coulomb terms. The initial state is obtained efficiently using Gaussian-state preparation, while the readout of the ground energy is organized into seventeen sets of measurements, irrespective of the size of the problem. The total depth of the corresponding quantum circuit scales polynomially with the size of the system. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons. Our results are benchmarked with exact diagonalization for systems with one and two hexagons. For larger systems we use the exact state vector and approximate matrix product state simulation techniques. The latter allows us to systematically trade off precision with memory and therefore to tackle larger systems. We analyze adiabatic and Trotterization errors, providing estimates for optimal periods and time discretizations given a finite accuracy. In the case of large systems we also study approximation errors.