Pith. sign in

REVIEW 1 cited by

Optimization of deterministic photonic graph state generation via local operations

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 2401.00635 v3 pith:DH2B44EU submitted 2024-01-01 quant-ph

classification quant-ph
keywords generationgraphstatesdeterministicgateslocalmethodoptimization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Realizing photonic graph states, crucial in various quantum protocols, is challenging due to the absence of deterministic entangling gates in linear optics. To address this, emitter qubits have been leveraged to establish and transfer the entanglement to photons. We introduce an optimization method for such protocols based on the local Clifford equivalency of states and the graph theoretical correlations of the generation cost parameters. Employing this method, we achieve a 50% reduction in use of the 2-qubit gates for generation of the arbitrary large repeater graph states and similar significant reductions in the total gate count for generation of random dense graphs.

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. Local Equivalences of Graph States

    quant-ph 2025-11 conditional novelty 8.0 of 10

    Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.

Pith tools