Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors

DOI10.1142/S0219749921500088zbMath1468.81028OpenAlexW3165059638MaRDI QIDQ5003369

Amor Gueddana, Iyed Ben Slimen, Vasudevan Lakshminarayanan

Publication date: 21 July 2021

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219749921500088

zbMATH Keywords

quantum gatesquantum walkquantum circuitCNOTToffoli gates

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Random walks on graphs (05C81) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Related Items (1)

Double controlled quantum phase gate based on three atoms trapped in separate optical cavities

Cites Work

• Quantum walks: a comprehensive review
• REALIZABILITY ASSESSMENT OF PROBABILISTIC QUANTUM CNOT GATE BASED ON EXPERIMENTAL IMPLEMENTATION
• CNOT-based design and query management in quantum relational databases
• Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures
• DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

This page was built for publication: Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors