Pith. sign in

REVIEW 1 cited by

Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter

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 2410.23518 v2 pith:MOYA53SW submitted 2024-10-30 quant-ph

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

Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are mutually entangled with various topologies. Recently, deterministic sources of graph states have been demonstrated with quantum emitters in both the optical and microwave domains. In this work, we demonstrate deterministic and reconfigurable graph state generation with optical solid-state integrated quantum emitters. Specifically, we use a single semiconductor quantum dot in a cavity to generate caterpillar graph states, the most general type of graph state that can be produced with a single emitter. By using fast detuned optical pulses, we achieve full control over the spin state, enabling us to vary the entanglement topology at will. We perform quantum state tomography of two successive photons, measuring Bell state fidelities up to 0.80$\pm$0.04 and concurrences up to 0.69$\pm$0.09, while maintaining high photon indistinguishability. This simple optical scheme, compatible with commercially available quantum dot-based single photon sources, brings us a step closer to fault-tolerant quantum computing with spins and photons.

Discussion (0). Sign in 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. Finding trail covers: near-optimal decompositions of graph states as linear fusion networks

    quant-ph 2025-08 conditional novelty 7.0 of 10

    The fusion-minimization problem for photonic graph states is formalized as minimum trail cover; most bounded variants are NP-hard, but heuristics plus a TSP reduction give near-optimal fusion counts in benchmarks.

Pith tools