We experimentally show the first realization of the maximal entanglement under a ballistic quantum transport. An inhomogeneous ordered quantum walk is introduced to generate the maximal entanglement meanwhile maintaining the quadratic speedup, wherein the coin operations keep unchanged with time evolution but are varied according to positions in a deterministic way. Using a reconfigurable time-bin encoded optical network, we implement a 11-step ballistic quantum walk and obtain a maximal entanglement in which the von Neumann entropy of the coin state is close to 1. The construction of the maximal entanglement and the speedup of spreading signify a quadratic acceleration in producing entanglement with fast expansion of the Hilbert space, thus may stimulate the engineering of entanglement and the design of quantum algorithms.
We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an optimization problem with quantum process fidelity as the cost function. Then we determine the maximal entanglement that can be rigorously generated for any step beyond the second regardless of initial conditions with appropriate coin sequences. The simplest coin sequence comprising Hadamard and identity operations is equivalent to the generalized elephant quantum walk, which exhibits an increasingly faster spreading in terms of probability distribution. Experimentally, we demonstrate a ten-step quantum walk driven by such coin sequences with linear optics and thereby show the desired high-dimensional bipartite entanglement as well as the transport behavior of faster spreading.
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value asymptotically in the number of steps, outperforming the entanglement attained by using ordered QRW. The disorder is modeled by introducing an extra random aspect to QRW, a classical coin that randomly dictates which quantum coin drives the system's time evolution. We also show that maximal entanglement is achieved independently of the initial state of the walker, study the number of steps the system must move to be within a small fixed neighborhood of its asymptotic limit, and propose two experiments where these ideas can be tested.
Discrete-time quantum walks are powerful platforms for simulating quantum transport and information processing. Here we introduce a walker on a one-dimensional lattice whose motion is controlled by three entangled coins, each initialized with the Hadamard gate, aiming to maximize information flow. The walker moves only when all three coins yield the same outcome (HHH or TTT), thus coupling the 8-dimensional coin Hilbert space to the position degree of freedom. By analyzing fully separable, fully entangled (GHZ-type) and intermediate initial states, and using the von Neumann entropy of reduced subsystems, we compute the mutual information
I(C;P;t) between coin and position. The results show that initial three-partite entanglement accelerates the growth of mutual information by up to 18\% after ten steps (when compared to the lower of the two separable states), although it exhibits short-term non-monotonic dynamics due to quantum interference. For the first time, we introduce a tunable parameter
α (amplitude of non-displacement states) and show that the GHZ state reaches a maximum of mutual information at
α≈0.71 - a key finding for optimal control of information flow. Finally, an integrated photonic implementation using polarization, spatial modes and time bins is proposed, where
α can be tuned with nonlinear or electro-optic elements. A scalable numerical framework (Python code) for simulations up to
t=5 steps is provided. Our findings establish three-partite entanglement as a dynamical resource for maximizing information flow and spatial spreading, with direct applications in quantum state transfer, entanglement-assisted sensing and programmable photonic quantum processors.
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value asymptotically in the number of steps, outperforming the entanglement attained by using ordered QRW. The disorder is modeled by introducing an extra random aspect to QRW, a classical coin that randomly dictates which quantum coin drives the system's time evolution. We also show that maximal entanglement is achieved independently of the initial state of the walker, study the number of steps the system must move to be within a small fixed neighborhood of its asymptotic limit, and propose two experiments where these ideas can be tested.
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.