Quantum walks: a comprehensive review

Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists, mathematicians and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.Comment: Paper accepted for publication in Quantum Information Processing Journa

Search for leptophobic Z ' bosons decaying into four-lepton final states in proton-proton collisions at root s=8 TeV

Peer reviewe

Search for black holes and other new phenomena in high-multiplicity final states in proton-proton collisions at root s=13 TeV

Peer reviewe

Search for heavy resonances decaying into a vector boson and a Higgs boson in final states with charged leptons, neutrinos, and b quarks

Peer reviewe

Search for high-mass diphoton resonances in proton-proton collisions at 13 TeV and combination with 8 TeV search

Peer reviewe

Search for single production of scalar leptoquarks in proton-proton collisions at root s=8 TeV

Correction DOI:10.1103/PhysRevD.95.039906Peer reviewe