Measurement-based quantum computation offers exponential computational speed-up through simple measurements on a large entangled cluster state. We propose and demonstrate a scalable scheme for the generation of photonic cluster states suitable for universal measurement-based quantum computation. We exploit temporal multiplexing of squeezed light modes, delay loops, and beam-splitter transformations to deterministically generate a cylindrical cluster state with a two-dimensional (2D) topological structure as required for universal quantum information processing. The generated state consists of more than 30,000 entangled modes arranged in a cylindrical lattice with 24 modes on the circumference, defining the input register, and a length of 1250 modes, defining the computation depth. Our demonstrated source of two-dimensional cluster states can be combined with quantum error correction to enable fault-tolerant quantum computation.
Measurement-based quantum computation offers exponential computational speed-up through simple measurements on a large entangled cluster state. We propose and demonstrate a scalable scheme for the generation of photonic cluster states suitable for universal measurement-based quantum computation. We exploit temporal multiplexing of squeezed light modes, delay loops, and beam-splitter transformations to deterministically generate a cylindrical cluster state with a two-dimensional (2D) topological structure as required for universal quantum information processing. The generated state consists of more than 30,000 entangled modes arranged in a cylindrical lattice with 24 modes on the circumference, defining the input register, and a length of 1250 modes, defining the computation depth. Our demonstrated source of two-dimensional cluster states can be combined with quantum error correction to enable fault-tolerant quantum computation.
Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states-based on bosonic modes rather than qubits-have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.
Cluster states are useful in many quantum information processing applications. In particular, universal measurement-based quantum computation (MBQC) utilizes two-dimensional cluster states [R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. 86, 5188 (2001)] and topologically fault-tolerant MBQC requires cluster states of dimension 3 or higher [R. Raussendorf et al., New J. Phys. 9, 199 (2007)]. This work proposes a protocol to deterministically generate multidimensional photonic cluster states using a single atom-cavity system and time-delay feedback. The dimensionality of the cluster state increases linearly with the number of time-delay feedbacks. We first give a diagrammatic derivation of the tensor network states, which is valuable in simulating matrix product states and projected entangled pair states generated from sequential photons. Our method also provides a simple way to bridge and analyze the experimental imperfections and the logical errors of the generated states. In this method, we analyze the generated cluster states under realistic experimental conditions and address both one-qubit and two-qubit errors. Through numerical simulation, we observe an optimal atom-cavity cooperativity for the fidelity of the generated states, which is surprising given the prevailing assumption that higher-cooperativity systems are inherently better for photonic applications.
Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster states, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this work, based on our compact and scalable scheme of generating a two-dimensional spatiotemporal cluster state, a complete architecture including cluster state preparation, gate implementations, and error correction, is proposed. First, a scheme for generating two-dimensional large-scale continuous-variable cluster state by multiplexing both the temporal and spatial domains is proposed. Then, the corresponding gate implementations by gate teleportation are discussed and the actual gate noise from the generated cluster state is considered. After that, the quantum error correction can be further achieved by utilizing the square-lattice Gottesman-Kitaev-Preskill (GKP) code. Finally, a fault-tolerant quantum computation can be realized by introducing bias into the square-lattice GKP code (to protect against phase-flip errors) and concatenating a repetition code (to handle the residual bit-flip errors), with a squeezing threshold of 12.3 dB. Our work provides a possible option for a complete fault-tolerant quantum computation architecture in the future.
One-way quantum computation is a promising scheme for realizing large-scale quantum computation, where computation is done via measurements on a universal multi-mode entangled resource called cluster state. The capability of this method is determined by the size and the dimension of the cluster state; the size is roughly equivalent to the number of input modes times number of operation steps, while the dimension determines universality and fault tolerance of the computation. To achieve universality, two-dimensional cluster state is required. Among many approaches, time-domain multiplexing using optical system [1, 2] is a promising method where quantum state is encoded in a temporal wave packet. Although universality is still lacking, one-million-mode one-dimensional cluster state has been demonstrated with this approach [3].
Measurement-based quantum computation with continuous variables in an optical setup shows great promise toward implementation of large-scale quantum computation, where the time-domain multiplexing approach enables us to generate the large-scale cluster state used to perform measurement-based quantum computation. To make effective use of the advantage of the time-domain multiplexing approach, in this paper, we propose the method to generate the large-scale three-dimensional cluster state which is a platform for topologically protected measurement-based quantum computation. Our method combines a time-domain multiplexing approach with a divide-and-conquer approach and has two advantages for implementing large-scale quantum computation. First, the squeezing level for verification of the entanglement of the three-dimensional cluster states is experimentally feasible. The second advantage is the robustness against analog errors derived from the finite squeezing of continuous variables during topologically protected measurement-based quantum computation. Therefore, our method is a promising approach to implement large-scale quantum computation with continuous variables.
Topological measurement-based quantum computation (MBQC) enables one to carry out universal fault-tolerant quantum computation via single-qubit measurements with a family of large entangled states called cluster states as resources. Raussendorf's three-dimensional cluster states (RTCSs) based on the surface codes are mainly considered for topological MBQC. In such schemes, however, the logical Hadamard, phase (Z1/2), and T(Z1/4) gates which are essential for building up arbitrary logical gates are not implemented natively without using state distillation or lattice dislocations, to the best of our knowledge. In particular, state distillation generally consumes many ancillary logical qubits; thus it is a severe obstacle against practical quantum computing. To solve this problem, we suggest an MBQC scheme via a family of cluster states called color-code-based cluster states (CCCSs) based on the two-dimensional color codes instead of the surface codes. We define logical qubits, construct elementary logical gates, and describe error correction schemes. We show that all logical Clifford gates generated by the cnot, Hadamard, and phase gates can be implemented natively in a fault-tolerant manner, although the T gate still requires state distillation to be fault-tolerant. The error thresholds of MBQC via CCCSs for logical-Z errors are calculated to be 2.7%--2.8%, which are comparable to the values for RTCSs, assuming a simple error model where physical qubits have nontrivial errors independently with the same probability. We analyze and compare the resource overheads of both the schemes. In particular, we show that the number of physical qubits required for implementing a phase gate with CCCSs is at least about 26 times smaller than with RTCSs using state distillation, for the same code distance.