Related papers: Simulating Bell inequalities with Qibo
One of the most notable aspects of quantum systems is that their components can exhibit correlations much stronger than those allowed by classical physics. Two examples of quantum correlations are quantum entanglement and Bell nonlocality,…
Bell nonlocality is the resource that enables device-independent quantum information processing tasks. It is revealed through the violation of so-called Bell inequalities, indicating that the observed correlations cannot be reproduced by…
Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
We derive a Bell-like inequality involving all correlations in local observables with uncertainty free states and show that the inequality is violated in quantum mechanics for EPR and GHZ states. If the uncertainties are allowed in local…
The main challenge of quantum computing on its way to scalability is the erroneous behaviour of current devices. Understanding and predicting their impact on computations is essential to counteract these errors with methods such as quantum…
Quantum correlations in observables of multiple systems not only are of fundamental interest, but also play a key role in quantum information processing. As a signature of these correlations, the violation of Bell inequalities has not been…
I explain so-called quantum nonlocality experiments and discuss how to optimize them. Statistical tools from missing data maximum likelihood are crucial. New results are given on CGLMP, CH and ladder inequalities. Open problems are also…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Bell nonlocality is an intrinsic feature of quantum mechanics, which can be certified via the violation of Bell inequalities. It is therefore a fundamental question to certify Bell nonlocality from experimental data. Here, we present an…
Calibration of quantum devices is fundamental to successfully deploy quantum algorithms on current available quantum hardware. We present Qibocal, an open-source software library to perform calibration and characterization of…
Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired…
Contemporary quantum technologies face major difficulties in fault tolerant quantum computing with error correction, and focus instead on various shades of quantum simulation (Noisy Intermediate Scale Quantum, NISQ) devices, analogue and…
We present a tomographic approach to the study of quantum nonlocality in multipartite systems. Bell inequalities for tomograms belonging to a generic tomographic scheme are derived by exploiting tools from convex geometry. Then, possible…
I present a novel use of quantum annealing to solve the Set Splitting Problem using (QUBO) problem formulation. The contribution of the work is in formulating penalty functions that ensure the ground state of the QUBO Hamiltonian…
The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with either the number of steps and the number of parties involved. The proof that the optimization of such…
We explore quantum nonlocality in one of the simplest bipartite scenarios. Several new facet-defining Bell inequalities for the {[3 3 3] [3 3 3]} scenario are obtained with their quantum violations analyzed in details. Surprisingly, all…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that…
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly…
So far, various Bell type inequalities have been introduced to test the local realism in tripartite systems. In this article we consider a tripartite system with two measurements in each side and two outputs for each measurement. Then we…