Pith. sign in

REVIEW 1 cited by

A quantum-network register assembled with optical tweezers in an optical cavity

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.09109 v1 pith:G4BAS7QZ submitted 2024-07-12 quant-ph

classification quant-ph
keywords quantumopticalqubitscavitycommunicationcomputationregistertweezers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum computation and quantum communication are expected to provide users with capabilities inaccessible by classical physics. However, scalability to larger systems with many qubits is challenging. One solution is to develop a quantum network consisting of small-scale quantum registers containing computation qubits that are reversibly interfaced to communication qubits. Here we report on a register that uses both optical tweezers and optical lattices to deterministically assemble a two-dimensional array of atoms in an optical cavity. Harnessing a single-atom addressing beam, we stimulate the emission of a photon from each atom and demonstrate multiplexed atom-photon entanglement with a generation-to-detection efficiency approaching 90$\%$. Combined with cavity-mediated quantum logic, our approach provides a possible route to distributed quantum information processing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A greedy star-merging protocol distributes GHZ states over arbitrary Bell-pair networks with O(N) gates, N-1 Bell pairs in the complete case, and a polynomial-time alternative to Steiner-tree-based methods.

Pith tools