Related papers: Evolution of Quantum Resources in Quantum-walk-bas…
The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…
Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…
Shor's factoring algorithm provides a super-polynomial speed-up over all known classical factoring algorithms. Here, we address the question of which quantum properties fuel this advantage. We investigate a sequential variant of Shor's…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
Using coordinate-free basic operators on toy Fock spaces \cite{AP}, quantum random walks are defined following the ideas in \cite{LP,AP}. Strong convergence of quantum random walks associated with bounded structure maps is proved under…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
Entanglement is a key resource of quantum science for tasks that require it to be shared among participants. Within atomic, condensed matter and photonic many-body systems the distribution and sharing of entanglement is of particular…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of…
Quantum coherence as the fundamental characteristic of quantum physics, provides the valuable resource for quantum computation in exceeding the power of classical algorithms. The exploration of quantum coherence in relativistic systems is…
Decoherence is the major stumbling block in the realization of a large-scale quantum computer. Ingenious methods have been devised to overcome decoherence, but their success has been proven only for over-simplified models of…
The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the…
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, quantum ergodic regime…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…
It is well known that many operations in quantum information processing depend largely on a special kind of quantum correlation, that is, entanglement. However, there are also quantum tasks that display the quantum advantage without…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…