Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits

DOI10.1142/S021974992150043XzbMath1495.81027arXiv2012.10268MaRDI QIDQ5074442

Daniel Koch, Andrew Projansky, Michael Samodurov, Paul M. Alsing

Publication date: 9 May 2022

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

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

zbMATH Keywords

quantum walkquantum circuit design

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10) Quantum computation (81P68) Statistical mechanics of superconductors (82D55) Finite-type conditions for the boundary of a domain (32F18) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Automata, languages and programming. Seventh Colloquium, Noordwijkerhout, the Netherlands, July 14-18, 1980
• Quantum walks: a comprehensive review
• Discrete quantum walks hit exponentially faster
• An example of the difference between quantum and classical random walks
• Universal Computation by Multiparticle Quantum Walk
• Quantum walks on graphs
• A random walk approach to quantum algorithms
• Quantum Walk Algorithm for Element Distinctness
• EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
• Magnetic Shielding of Nuclei in Molecules
• Spin Echoes