Constant-sized correlations are sufficient to self-test maximally entangled states with unbounded dimension

Let p be an odd prime and let r be the smallest generator of the multiplicative group Zp∗. We show that there exists a correlation of size Θ(r2) that self-tests a maximally entangled state of local dimension p−1. The construction of the correlation uses the embedding procedure proposed by Slofstra (Forum of Mathematics, Pi. (2019)). Since there are infinitely many prime numbers whose smallest multiplicative generator is in the set {2,3,5} (D.R. Heath-Brown The Quarterly Journal of Mathematics (1986) and M. Murty The Mathematical Intelligencer (1988)), our result implies that constant-sized correlations are sufficient for self-testing of maximally entangled states with unbounded local dimension.

Two Entangled Electrons How to Link to Each Other?—What’s the Magnetic Force State on Both Sides?

There discovered the maximum possible magnetic induction in nature, equal to the magnetic induction at the poles of an electron’s spin, When the spin magnetic moments of two electrons are close to each other, they act on each other with the maximum possible magnetic induction, and finally entered the maximally entangled state after the energy drops. By this time, the spin magnetic moments on both sides situated in anti-parallel, between them there existed four invisible magnetic circuit, and each magnetic circuit just contain a fluxon. No matter how far the distance between the spins, owing to the inalienability of fluxon, no magnetic flux leakage (coupling degree 100%), so these four magnetic circuit will always existed, maintaining the maximally entangled state system immutably. This is the material basis for the entangled state to be existed, nothing to do with “spooky action at a distance”. In this paper, a visual schematic diagram has drawn to describe these, and the magnetic force state, force relationship and “light barrier” problem are analyzed.

Large violations in Kochen Specker contextuality and their applications

It is of interest to study how contextual quantum mechanics is, in terms of the violation of Kochen Specker state-independent and state-dependent non-contextuality inequalities. We present state-independent non-contextuality inequalities with large violations, in particular, we exploit a connection between Kochen-Specker proofs and pseudo-telepathy games to show KS proofs in Hilbert spaces of dimension $d \geq 2^{17}$ with the ratio of quantum value to classical bias being $O(\sqrt{d}/\log d)$. We study the properties of this KS set and show applications of the large violation. It has been recently shown that Kochen-Specker proofs always consist of substructures of state-dependent contextuality proofs called $01$-gadgets or bugs. We show a one-to-one connection between $01$-gadgets in $\mathbb{C}^d$ and Hardy paradoxes for the maximally entangled state in $\mathbb{C}^d \otimes \mathbb{C}^d$. We use this connection to construct large violation $01$-gadgets between arbitrary vectors in $\mathbb{C}^d$, as well as novel Hardy paradoxes for the maximally entangled state in $\mathbb{C}^d \otimes \mathbb{C}^d$, and give applications of these constructions. As a technical result, we show that the minimum dimension of the faithful orthogonal representation of a graph in $\mathbb{R}^d$ is not a graph monotone, a result that may be of independent interest.

Self-testing quantum systems of arbitrary local dimension with minimal number of measurements

Bell nonlocality as a resource for device-independent certification schemes has been studied extensively in recent years. The strongest form of device-independent certification is referred to as self-testing, which given a device, certifies the promised quantum state as well as quantum measurements performed on it without any knowledge of the internal workings of the device. In spite of various results on self-testing protocols, it remains a highly nontrivial problem to propose a certification scheme of qudit–qudit entangled states based on violation of a single d-outcome Bell inequality. Here we address this problem and propose a self-testing protocol for the maximally entangled state of any local dimension using the minimum number of measurements possible, i.e., two per subsystem. Our self-testing result can be used to establish unbounded randomness expansion, $${{{\mathrm{log}}}\,}_{2}d$$ log 2 d perfect random bits, while it requires only one random bit to encode the measurement choice.

Robust self-testing of steerable quantum assemblages and its applications on device-independent quantum certification

Given a Bell inequality, if its maximal quantum violation can be achieved only by a single set of measurements for each party or a single quantum state, up to local unitaries, one refers to such a phenomenon as self-testing. For instance, the maximal quantum violation of the Clauser-Horne-Shimony-Holt inequality certifies that the underlying state contains the two-qubit maximally entangled state and the measurements of one party contains a pair of anti-commuting qubit observables. As a consequence, the other party automatically verifies the set of states remotely steered, namely the "assemblage", is in the eigenstates of a pair of anti-commuting observables. It is natural to ask if the quantum violation of the Bell inequality is not maximally achieved, or if one does not care about self-testing the state or measurements, are we capable of estimating how close the underlying assemblage is to the reference one? In this work, we provide a systematic device-independent estimation by proposing a framework called "robust self-testing of steerable quantum assemblages". In particular, we consider assemblages violating several paradigmatic Bell inequalities and obtain the robust self-testing statement for each scenario. Our result is device-independent (DI), i.e., no assumption is made on the shared state and the measurement devices involved. Our work thus not only paves a way for exploring the connection between the boundary of quantum set of correlations and steerable assemblages, but also provides a useful tool in the areas of DI quantum certification. As two explicit applications, we show 1) that it can be used for an alternative proof of the protocol of DI certification of all entangled two-qubit states proposed by Bowles et al., and 2) that it can be used to verify all non-entanglement-breaking qubit channels with fewer assumptions compared with the work of Rosset et al.

Simple and maximally robust processes with no classical common-cause or direct-cause explanation

Guided by the intuition of coherent superposition of causal relations, recent works presented quantum processes without classical common-cause and direct-cause explanation, that is, processes which cannot be written as probabilistic mixtures of quantum common-cause and quantum direct-cause relations (CCDC). In this work, we analyze the minimum requirements for a quantum process to fail to admit a CCDC explanation and present "simple" processes, which we prove to be the most robust ones against general noise. These simple processes can be realized by preparing a maximally entangled state and applying the identity quantum channel, thus not requiring an explicit coherent mixture of common-cause and direct-cause, exploiting the possibility of a process to have both relations simultaneously. We then prove that, although all bipartite direct-cause processes are bipartite separable operators, there exist bipartite separable processes which are not direct-cause. This shows that the problem of deciding weather a process is direct-cause process is not equivalent to entanglement certification and points out the limitations of entanglement methods to detect non-classical CCDC processes. We also present a semi-definite programming hierarchy that can detect and quantify the non-classical CCDC robustnesses of every non-classical CCDC process. Among other results, our numerical methods allow us to show that the simple processes presented here are likely to be also the maximally robust against white noise. Finally, we explore the equivalence between bipartite direct-cause processes and bipartite processes without quantum memory, to present a separable process which cannot be realized as a process without quantum memory.

Quantum teleportation of physical qubits into logical code spaces

Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that nontransverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, nontransverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit to implement the nontransverse gate. As the first important step, we create a maximally entangled state between a physical and an error-correctable logical qubit and use it as a teleportation resource. We then demonstrate the teleportation of quantum information encoded on the physical qubit into the error-corrected logical qubit with fidelities up to 0.786. Our scheme can be designed to be fully fault tolerant so that it can be used in future large-scale quantum technologies.

Optimal teleportation via noisy quantum channels without additional qubit resources

Quantum teleportation exemplifies how the transmission of quantum information starkly differs from that of classical information and serves as a key protocol for quantum communication and quantum computing. While an ideal teleportation protocol requires noiseless quantum channels to share a pure maximally entangled state, the reality is that shared entanglement is often severely degraded due to various decoherence mechanisms. Although the quantum noise induced by the decoherence is indeed a major obstacle to realizing a near-term quantum network or processor with a limited number of qubits, the methodologies considered thus far to address this issue are resource-intensive. Here, we demonstrate a protocol that allows optimal quantum teleportation via noisy quantum channels without additional qubit resources. By analyzing teleportation in the framework of generalized quantum measurement, we optimize the teleportation protocol for noisy quantum channels. In particular, we experimentally demonstrate that our protocol enables to teleport an unknown qubit even via a single copy of an entangled state under strong decoherence that would otherwise preclude any quantum operation. Our work provides a useful methodology for practically coping with decoherence with a limited number of qubits and paves the way for realizing noisy intermediate-scale quantum computing and quantum communication.

A nondestructive Bell-state measurement on two distant atomic qubits

One of the most fascinating aspects of quantum networks is their capability to distribute entanglement as a nonlocal communication resource1. In a first step, this requires network-ready devices that can generate and store entangled states2. Another crucial step, however, is to develop measurement techniques that allow for entanglement detection. Demonstrations for different platforms3–13 suffer from being not complete, destructive or local. Here, we demonstrate a complete and nondestructive measurement scheme14–16 that always projects any initial state of two spatially separated network nodes onto a maximally entangled state. Each node consists of an atom trapped inside an optical resonator from which two photons are successively reflected. Polarization measurements on the photons discriminate between the four maximally entangled states. Remarkably, such states are not destroyed by our measurement. In the future, our technique might serve to probe the decay of entanglement and to stabilize it against dephasing via repeated measurements17,18.