Quantum search on simplicial complexes

DOI10.1007/S40509-017-0144-8zbMATH Open1423.81056arXiv1707.00156OpenAlexW2766471340MaRDI QIDQ2329932FDOQ2329932

Authors: Kaname Matsue, Osamu Ogurisu, Etsuo Segawa 

Publication date: 18 October 2019

Published in: Quantum Studies: Mathematics and Foundations (Search for Journal in Brave)

Abstract: In this paper, we propose an extension of quantum searches on graphs driven by quantum walks to simplicial complexes. To this end, we newly define a quantum walk on simplicial complex which is an alternative of preceding studies by authors. We show that the quantum search on the specific simplicial complex corresponding to the triangulation of $n$-dimensional unit square driven by this new simplicial quantum walk works well, namely, a marked simplex can be found with probability $1+o(1)$ with in a time $O(sqrtN)$, where $N$ is the number of simplices with the dimension of marked simplex.

Full work available at URL: https://arxiv.org/abs/1707.00156

Recommendations

• Quantum walks on simplicial complexes
• Up and down Grover walks on simplicial complexes
• Search via Quantum Walk
• Spatial quantum search in a triangular network
• Quantum Walk Based Search Algorithms

zbMATH Keywords

simplicial complexesquantum walksquantum searchunitary equivalence of quantum walks

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Random walks on graphs (05C81) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Bulk-edge correspondence of one-dimensional quantum walks
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Quantum random walks in one dimension
• Coins make quantum walks faster
• Quantum Walk Based Search Algorithms
• Spectral and asymptotic properties of Grover walks on crystal lattices
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Walks
• Quantum Walk Algorithm for Element Distinctness
• Quantum walks and search algorithms
• Topology for Computing
• Spatial quantum search in a triangular network
• Spatial search on a honeycomb network
• Connecting coined quantum walks with Szegedy's model
• Realistic quantum probability
• Quantum walks on simplicial complexes
• Title not available (Why is that?)
• Quantum walks induced by Dirichlet random walks on infinite trees
• Title not available (Why is that?)
• Periodicity of the discrete-time quantum walk on a finite graph
• A note on the spectral mapping theorem of quantum walk models
• Up and down Grover walks on simplicial complexes

Cited In (9)

• Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
• A quantum searching model finding one of the edges of a subgraph in a complete graph
• Quantum search in a possible three-dimensional complex subspace
• Quantum search of matching on signed graphs
• Up and down Grover walks on simplicial complexes
• Quantum walks on simplicial complexes
• Quantum walk search on Johnson graphs
• Quantum polyhedra, definitions, statistics and the construction of a collective quantum similarity index
• Quantum walk on simplicial complexes for simplicial community detection

Uses Software

• Split Step Explorer

This page was built for publication: Quantum search on simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329932)