Pith. sign in

REVIEW 1 cited by

Streamlined quantum computing with macronode cluster states

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 2109.04668 v3 pith:6RRENOEL submitted 2021-09-10 quant-ph

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

Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster states, whose construction is defined by a fixed, low-depth beam splitter network, we show that a Clifford gate and GKP error correction can be simultaneously implemented in a single teleportation step. We give explicit recipes to realize the Clifford generating set, and we calculate the logical gate-error rates given finite squeezing in the cluster-state and GKP resources. We find that logical error rates of $10^{-2}$-$10^{-3}$, compatible with the thresholds of topological codes, can be achieved with squeezing of 11.9-13.7 dB. The protocol presented eliminates noise present in prior schemes and puts the required squeezing for fault tolerance in the range of current state-of-the-art optical experiments. Finally, we show how to produce distillable GKP magic states directly within the cluster state.

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. Impact of finite squeezing on near-term quantum computations using GKP qubits

    quant-ph 2025-07 conditional novelty 7.0 of 10

    A 108-mode simulation of a GKP-based measurement-based quantum computer shows a three-qubit Grover search beats the classical one-query bound only above about 10 dB of GKP squeezing.

Pith tools