Circuit implementation of discrete-time quantum walks via the shunt decomposition method

DOI10.1007/S11128-023-03878-6OpenAlexW4353038872MaRDI QIDQ2693901

Allan Wing-Bocanegra, Salvador Elías Venegas-Andraca

Publication date: 24 March 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

quantum walksquantum circuitsblock diagonal unitary matrixIBM quantummulti-controlled quantum gatesshunt decomposition

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Related Items (1)

Unitary coined discrete-time quantum walks on directed multigraphs

Uses Software

• DLMF
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum walks can find a marked element on any graph
• Quantum walks: a comprehensive review
• Discrete-time quantum walks and graph structures
• Discrete-time quantum walk algorithm for ranking nodes on a network
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Implementation of quantum walks on IBM quantum computers
• Quantum walk public-key cryptographic system
• Templates for Positive and Negative Control Toffoli Networks
• Random Walk: A Modern Introduction
• Faster quantum-walk algorithm for the two-dimensional spatial search
• DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES
• A CLASS OF EFFICIENT QUANTUM INCREMENTER GATES FOR QUANTUM CIRCUIT SYNTHESIS
• Quantum walks and search algorithms

This page was built for publication: Circuit implementation of discrete-time quantum walks via the shunt decomposition method