Related papers: Testing Scalable Bell Inequalities for Quantum Gra…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set…
We give the complete list of 175 facet Bell inequalities for the case where Alice and Bob each choose their measurements from a set of four binary outcome measurements. For each inequality we compute the maximum quantum violation for…
Facet inequalities play an important role in detecting the nonlocality of a quantum state. The number of such inequalities depends on the Bell test scenario. With the increase in the number of parties, measurement outcomes, or/and the…
We improve the test to show the impossibility of a quantum theory based on real numbers by a larger ratio of complex-to-real bound on a Bell-type parameter. In contrast to previous theoretical and experimental proposals the test requires…
Besides using the laser beam, it is very tempting to directly testify the Bell inequality at high energy experiments where the spin correlation is exactly what the original Bell inequality investigates. In this work, we follow the proposal…
Quantum processors can already execute tasks beyond the reach of classical simulation, albeit for artificial problems. At this point, it is essential to design error metrics that test the experimental accuracy of quantum algorithms with…
Based on a geometrical argument introduced by Zukowski, a new multisetting Bell inequality is derived, for the scenario in which many parties make measurements on two-level systems. This generalizes and unifies some previous results.…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
Bell measurements (BMs) are ubiquitous in quantum information and technology. They are basic elements for quantum commmunication, computation, and error correction. In particular, when performed on logical qubits encoded in physical…
In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance…
The ability to generate and verify multipartite entanglement is an important benchmark for near-term quantum devices devices. We develop a scalable entanglement metric based on multiple quantum coherences, and demonstrate experimentally on…
We consider a Bell inequality for a continuous range of settings of the apparatus at each site. This "functional" Bell inequality gives a better range of violation for generalized GHZ states. Also a family of N-qubit bound entangled states…
It is shown that even if the linear entropy of mixed two-qubit state is not smaller then 0.457, Bell - CHSH inequalities can be violated. This contradicts the result obtained in the paper of E. Santos [1].
We show that violation of genuine multipartite Bell inequalities can be obtained with sampled, probabilistic phase space methods. These genuine Bell violations cannot be replicated if any part of the system is described by a local hidden…
Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage. These games are well suited for noisy quantum computers because they only require the preparation of a shallow circuit, followed by the…
There is a significant interest in testing quantum entanglement and Bell inequality violation in high-energy experiments. Since the analyses in high-energy experiments are performed with events statistically averaged over phase space, the…
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…
Quantum processors with sizes in the 10-100 qubit range are now increasingly common. However, with increased size comes increased complexity for benchmarking. The effectiveness of a given device may vary greatly between different tasks, and…
Quantum error correction (QEC) is considered a deciding component in enabling practical quantum computing. Stabilizer codes, and in particular topological surface codes, are promising candidates for implementing QEC by redundantly encoding…