Related papers: Insights from Quantum Information into Fundamental…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives.…
We explore, both analytically and numerically, the quantum dynamics of a many-body free-fermion system subjected to local density measurements. We begin by extending the mapping to the nonlinear sigma-model (NLSM) field theory for the case…
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
Quantum discrete-time walkers have, since their introduction, demonstrated applications in algorithmic and in modeling and simulating a wide range of transport phenomena. They have long been considered the discrete-time and discrete space…
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational…
In this thesis, we have proposed some novel thought experiments involving foundations of quantum mechanics and quantum information theory, using quantum entanglement property. Concerning foundations of quantum mechanics, we have suggested…
A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…
Modern quantum information theory deals with an idealized situation when the spacetime dependence of quantum phenomena is neglected. However the transmission and processing of (quantum) information is a physical process in spacetime.…
We use discrete-event simulation on a digital computer to study two different models of experimentally realizable quantum walks. The simulation models comply with Einstein locality, are as "realistic" as the one of the simple random walk in…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…
We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum Darwinism explains the emergence of a classical description of objects in terms of the creation of many redundant registers in an environment containing their classical information. This amplification phenomenon, where only…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…