A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
Separability criteria for genuine multiparticle entanglement
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
We present a method to derive separability criteria for the different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states. Further, the criteria are superior to all known entanglement criteria for many other families; also they allow the detection of bound entanglement. We next demonstrate that they are easily implementable in experiments and discuss applications to the decoherence of multiparticle entangled states.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2roles
background 1polarities
background 1representative citing papers
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
citing papers explorer
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.