Related papers: Error-Tolerating Bell Inequalities via Graph State…
I discuss a variety of issues relating to near-future experiments demonstrating fault-tolerant quantum computation. I describe a family of fault-tolerant quantum circuits that can be performed with 5 qubits arranged on a ring with…
We have determined the maximum quantum violation of 241 tight bipartite Bell inequalities with up to five two-outcome measurement settings per party by constructing the appropriate measurement operators in up to six-dimensional complex and…
Bell's theorem sets a boundary between the classical and quantum realms, by providing a strict proof of the existence of entangled quantum states with no classical counterpart. An experimental violation of Bell's inequality demands…
Topological error correction--a novel method to actively correct errors based on cluster states with topological properties--has the highest order of tolerable error rates known to date (10^{-2}). Moreover, the scheme requires only…
Superior computational power promised by quantum computers utilises the fundamental quantum mechanical principle of entanglement. However, achieving entanglement and verifying that the generated state does not follow the principle of local…
Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a…
We have determined numerically the maximum quantum violation of over 100 tight bipartite Bell inequalities with two-outcome measurements by each party on systems of up to four dimensional Hilbert spaces. We have found several cases,…
Violation of Bell inequality (or, Bell-type inequalities) by nonlocal correlations is justified by relaxation of at least one of the plausible physical constraints used to model such inequality. Based on this fact, in this letter we present…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
To reproduce in a local hidden variables theory correlations that violate Bell inequalities, communication must occur between the parties. We show that the amount of violation of a Bell inequality imposes a lower bound on the average…
A systematic approach is presented to construct non-homogeneous two- and three-qubit Bell-type inequalities. When projector-like terms are subtracted from homogeneous two-qubit CHSH polynomial, non-homogeneous inequalities are attained and…
Threshold theorems for fault-tolerant quantum computing assume that errors are of certain types. But how would one detect whether errors of the "wrong" type occur in one's experiment, especially if one does not even know what type of error…
Bell experiments can be used to generate private random numbers. An ideal Bell experiment would involve measuring a state of two maximally entangled qubits, but in practice any state produced is subject to noise. Here we consider how the…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than…
We present a [[7, 1, 3]] quantum error-correcting code that is able to achieve fault-tolerant syndrome measurement using one ancillary qubit per stabilizer for an error model of independent single-qubit Pauli errors. All single-qubit Pauli…
We derive a single general Bell inequality which is a necessary and sufficient condition for the correlation function for N particles to be describable in a local and realistic picture, for the case in which measurements on each particle…
The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires…
Fault-tolerant measurement-based quantum computation (MBQC) with recent progress on quantum technologies leads to a promising scalable platform for realizing quantum computation, conducted by preparing a large-scale graph state over many…
Proposals for Bell inequality tests on systems restricted by superselection rules often require operations that are difficult to implement in practice. In this paper, we derive a new Bell inequality, where pairs of states are used to…