Fault-tolerant Greenberger-Horne-Zeilinger paradox based on non-Abelian anyons

Topological Quantum Compiling with Reinforcement Learning

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep reinforcement learning that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set. It generates near-optimal gate sequences with given accuracy and is generally applicable to various scenarios, independent of the hardware-feasible universal set and free from using ancillary qubits. For concreteness, we apply this algorithm to the case of topological compiling of Fibonacci anyons and obtain near-optimal braiding sequences for arbitrary single-qubit unitaries. Our algorithm may carry over to other challenging quantum discrete problems, thus opening up a new avenue for intriguing applications of deep learning in quantum physics.

Sharp Contradiction for Local-Hidden-State Model in Quantum Steering

In quantum theory, no-go theorems are important as they rule out the existence of a particular physical model under consideration. For instance, the Greenberger-Horne-Zeilinger (GHZ) theorem serves as a no-go theorem for the nonexistence of local hidden variable models by presenting a full contradiction for the multipartite GHZ states. However, the elegant GHZ argument for Bell's nonlocality does not go through for bipartite Einstein-Podolsky-Rosen (EPR) state. Recent study on quantum nonlocality has shown that the more precise description of EPR's original scenario is "steering", i.e., the nonexistence of local hidden state models. Here, we present a simple GHZ-like contradiction for any bipartite pure entangled state, thus proving a no-go theorem for the nonexistence of local hidden state models in the EPR paradox. This also indicates that the very simple steering paradox presented here is indeed the closest form to the original spirit of the EPR paradox.

Test of Einstein-Podolsky-Rosen steering based on the all-versus-nothing proof

In comparison with entanglement and Bell nonlocality, Einstein-Podolsky-Rosen steering is a newly emerged research topic and in its incipient stage. Although Einstein-Podolsky-Rosen steering has been explored via violations of steering inequalities both theoretically and experimentally, the known inequalities in the literatures are far from well-developed. As a result, it is not yet possible to observe Einstein-Podolsky-Rosen steering for some steerable mixed states. Recently, a simple approach was presented to identify Einstein-Podolsky-Rosen steering based on all-versus-nothing argument, offering a strong condition to witness the steerability of a family of two-qubit (pure or mixed) entangled states. In this work, we show that the all-versus-nothing proof of Einstein-Podolsky-Rosen steering can be tested by measuring the projective probabilities. Through the bound of probabilities imposed by local-hidden-state model, the proposed test shows that steering can be detected by the all-versus-nothing argument experimentally even in the presence of imprecision and errors. Our test can be implemented in many physical systems and we discuss the possible realizations of our scheme with non-Abelian anyons and trapped ions.