David Patiño Rodríguez

Necessary and Sufficient Detection Efficiency for the Mermin Inequalities

We prove that the threshold detection efficiency for a loophole-free Bell experiment using an n-qubit Greenberger-Horne-Zeilinger state and the correlations appearing in the n-partite Mermin inequality is n/(2n-2). If the detection efficiency is equal to or lower than this value, there are local hidden variable models that can simulate all the quantum predictions. If the detection efficiency is above this value, there is no local hidden variable model that can simulate all the quantum predictions.

Minimum detection efficiency required for a loophole-free violation of the Braunstein-Caves chained Bell inequalities

The chained Bell inequalities of Braunstein and Caves involving N settings per observer have some interesting applications. Here we obtain the minimum detection efficiency required for a loophole-free violation of the Braunstein-Caves inequalities for any N greater than= 2. We discuss both the case in which both particles are detected with the same efficiency and the case in which the particles are detected with different efficiencies.

Mermin inequalities for perfect correlations

Any n-qubit state with n independent perfect correlations is equivalent to a graph state. We present the optimal Bell inequalities for perfect correlations and maximal violation for all classes of graph states with n < 7 qubits. Twelve of them were previously unknown and four give the same violation as the Greenberger-Horne-Zeilinger state, although the corresponding states are more resistant to decoherence.

Steady-state parameter estimation of an experimental vapour compression refrigeration plant

This paper describes the steady-state parameter identification process of the components which constitute a vapour-compression refrigeration cycle. Particularly relevant is the heat exchanger steady-state parameter identification due to the refrigerant phase change which occurs during a typical cycle operation. Experimental results that prove the validity of the considered assumptions are shown and discussed.

Nonlocality for graph states

The possibility of preparing two-photon entangled states encoding three or more qubits in each photon leads to the following problem: If n quabits were distributed between two parties, which quantum pure states and qubit distributions would allow all-versus-nothing (or Greenberger-Horne-Zeilinger-like) proofs of Bell’s theorem using only single-qubit measurements? We show a necessary and sufficient condition for the existence of these proofs and provide all existing proofs up to n = 7 qubits. On the other hand, the possibility of preparing n-photon n-qubit graph states leads to the following problem: If n qubits were distributed between n parties, which would be the optimal Bell inequalities? We show all optimal n-party Bell inequalities for the perfect correlations of any graph state of n < 6 qubits. Optimal means that the ratio between the quantum violation and the bound for local hidden-variable theories is the maximum over all possible combinations of perfect correlations. This implies that the required detection efficiencies for loophole-free Bell tests are minimal.