arXiv subjects
Publications and source records attributed to C. Di Franco.
We use the recently introduced concept of information flux in a many-body register in order to give an alternative viewpoint on quantum state transfer in linear chains of many spins.
We propose a protocol for perfect quantum state transfer that is resilient to a broad class of realistic experimental imperfections, including noise sources that could be modelled either as independent Markovian baths or as certain forms of spatially correlated environments. We highlight interesting connections between the fidelity of state transfer and quantum stochastic resonance effects. The scheme is flexible enough to act as an effective entangling gate for the generation of genuine multipartite entanglement in a control-limited setting. Possible experimental implementations using superconducting qubits are also briefly discussed.
We find a coupling-strength configuration for a linear chain of N spins which gives rise to simultaneous multiple Bell states. We suggest a way such an interesting entanglement pattern can be used in order to distribute maximally entangled channels to remote locations and generate multipartite entanglement with a minimum-control approach. Our proposal thus provides a way to achieve the core resources in distributed information processing. The schemes we describe can be efficiently tested in chains of coupled cavities interacting with three-level atoms.
We introduce and formalize the concept of information flux in a many-body register as the influence that the dynamics of a specific element receive from any other element of the register. By quantifying the information flux in a protocol, we can design the most appropriate initial state of the system and, noticeably, the distribution of coupling strengths among the parts of the register itself. The intuitive nature of this tool and its flexibility, which allow for easily manageable numerical approaches when analytic expressions are not straightforward, are greatly useful in interacting many-body systems such as quantum spin chains. We illustrate the use of this concept in quantum cloning and quantum state transfer and we also sketch its extension to non-unitary dynamics.
The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two non-equivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the inital preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.