Searcharxiv⌕ Search

arXiv subjects

Paolo Facchi

Publications and source records attributed to Paolo Facchi.

148 records · Page 9Linked to original sources

Robustness of optimal working points for non-adiabatic holonomic quantum computation

Geometric phases are an interesting resource for quantum computation, also in view of their robustness against decoherence effects. We study here the effects of the environment on a class of one-qubit holonomic gates that have been recently shown to be characterized by "optimal" working times. We numerically analyze the behavior of these optimal points and focus on their robustness against noise.

quant-ph↗

Dynamical Imperfections in quantum computers

We study the effects of dynamical imperfections in quantum computers. By considering an explicit example, we identify different regimes ranging from the low-frequency case, where the imperfections can be considered as static but with renormalized parameters, to the high frequency fluctuations, where the effects of imperfections are completely wiped out. We generalize our results by proving a theorem on the dynamical evolution of a system in the presence of dynamical perturbations.

quant-ph↗

Optimization of a Neutron-Spin Test of the Quantum Zeno Effect

A neutron-spin experimental test of the quantum Zeno effect (QZE) is discussed from a practical point of view, when the nonideal efficiency of the magnetic mirrors, used for filtering the spin state, is taken into account. In the idealized case the number N of (ideal) mirrors can be indefinitely increased, yielding an increasingly better QZE. By contrast, in a practical situation with imperfect mirrors, there is an optimal number of mirrors, N_opt, at which the QZE becomes maximum: more frequent measurements would deteriorate the performance. However, a quantitative analysis shows that a good experimental test of the QZE is still feasible. These conclusions are of general validity: in a realistic experiment, the presence of losses and imperfections leads to an optimal frequency N_opt, which is in general finite. One should not increase N beyond N_opt. A convenient formula for N_opt, valid in a broad framework, is derived as a function of the parameters characterizing the experimental setup.

quant-ph↗