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.
Streamlined quantum computing with macronode cluster states
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Impact of finite squeezing on near-term quantum computations using GKP qubits
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.