Deterministic generation of two-dimensional multi-photon cluster states

Cluster states are a class of multiqubit entangled states with broad applications such as quantum metrology and one-way quantum computing. Here, we present a protocol to generate frequency-bin-encoded dual-rail cluster states using a superconducting circuit consisting of a fixed-frequency transmon qubit, a resonator, and a Purcell filter. We implement time-frequency multiplexing by sequentially emitting copropagating microwave photons, where each time bin contains a dual-rail qubit encoded in two distinct frequency modes, and adjacent time bins are entangled to form the cluster state. The frequency-bin dual-rail encoding enables erasure detection based on photon occupancy. We characterize the state fidelity using quantum tomography and quantify the multipartite entanglement using localizable entanglement. Our implementation achieves a state fidelity exceeding <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mn>50</a:mn> <a:mi mathvariant="normal">%</a:mi> </a:math> for a cluster state consisting of up to four logical qubits. The localizable entanglement remains across chains of up to seven logical qubits. After discarding the erasure errors, the fidelity exceeds <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mn>50</d:mn> <d:mi mathvariant="normal">%</d:mi> </d:math> for states with up to eight logical qubits, and the entanglement persists across chains of up to 11 qubits. These results highlight the improved robustness of frequency-bin dual-rail encoding against photon loss compared to conventional single-rail schemes. This work provides a scalable pathway toward high-dimensional entangled state generation and photonic quantum information processing in the microwave domain.

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.

Based on the former structures in the generation of two-dimensional cluster states, we first propose a scheme to generate linear three-dimensional (3D) cluster state. After that, we develop the former structures to three-dimension, and then we could use them to generate universal 3D cluster states. In final, we provide two new structures, which could make the generation of a special type of 3D cluster state very efficient. All the proposals work with cross-phase modulation, so they are deterministic, highly efficient, fast, compared with the former schemes. It will make the requirement of quantum memory much relax, thus it is more feasible and suitable for large-scale one-way quantum computation.

We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4)m−1.

Measurement-Based Quantum Computing (MBQC), proposed in 2001 is a model of quantum computing that achieves quantum computation by performing a series of adaptive single-qubit measurements on an entangled cluster state. Our project is aimed at introducing MBQC to a wide audience ranging from high school students to quantum computing researchers through a Tangram puzzle with a modified set of rules played on an applet. The player is provided a quantum circuit which they have to map to MBQC using polyominos. Polyominos, the building blocks of our game, consist of square tiles joined edge-to-edge to form different shapes. Each tile represents a measurement basis, differentiated by its color. Polyominos rest on a square-grid playing board, which signifies a cluster state. We show that mapping a quantum circuit to MBQC is equivalent to arranging a set of polyominos—each corresponding to a gate in the circuit—on the playing board, subject to certain rules. We state the rules in simple terms with no reference to quantum computing. One such rule describes ways to deform a polyomino while it still correctly realizes a given quantum gate. The player has to place polyominos on the playing board conforming to the rules. Any correct solution creates a valid realization of the quantum circuit in MBQC. A higher-scoring correct solution fills up less space on the board, resulting in a lower-overhead embedding of the circuit in MBQC, a challenging research problem.

We demonstrate a method of constructing <i>L</i>-shape cluster states by exploiting equivalence class properties of graph states. The <i>L</i>-shape cluster state is a primitive which can be used to construct cluster states capable of supporting universal quantum computation. The method is device independent but is shown to be considerably more efficient than previously proposed approaches for photonic cluster construction. Two-dimensional photonic cluster states can be efficiently built via local unitaries and type-I fusion only. To allow for a complete calculation of the cost of two-dimensional photonic cluster-state construction, we also provide a recursion relation relating the length of a photonic cluster chain to the average resources required.

Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot molecules, where qubits are encoded on singlet and triplet states of two coupled quantum dots. By applying a collective electrical field or simultaneously adjusting interdot bias voltages of all double-dot molecules, we get a switchable Ising-like interaction between any two adjacent quantum molecule qubits. The initialization, the single-qubit measurement, and the experimental parameters are discussed. It is shown that preparation of large cluster states and one-way quantum computation are implementable in semiconductor quantum dots with the present techniques.

We propose a mean to obtain computationally useful resource states also known as cluster states, for measurement-based quantum computation, via transitionless quantum driving algorithm. The idea is to cool the system to its unique ground state and tune some control parameters to arrive at computationally useful resource state, which is in one of the degenerate ground states. Even though there is set of conserved quantities already present in the model Hamiltonian, which prevents the instantaneous state to go to any other eigenstate subspaces, one cannot quench the control parameters to get the desired state. In that case, the state will not evolve. With involvement of the shortcut Hamiltonian, we obtain cluster states in fast-forward manner. We elaborate our proposal in the one-dimensional Kitaev honeycomb model, and show that the auxiliary Hamiltonian needed for the counterdiabatic driving is of M-body interaction.

Highly entangled states called cluster states are a universal resource for measurement-based quantum computing (QC). Here we propose an efficient method for producing large cluster states using superconducting quantum circuits. We show that a large cluster state can be efficiently generated in just one step by turning on the inter-qubit coupling for a short time. Because the inter-qubit coupling is only switched on during the time interval for generating the cluster state, our approach is also convenient for preparing the initial state for each qubit and for implementing one-way QC via single-qubit measurements. Moreover, the cluster state is robust against parameter variations.

Cluster states, whose model are a remarkably rich structure in measurement-based quantum computation, hold high degree of entanglement, while entanglement is very fragile during the process of transmission because of the inevitable interaction with the environment. We propose two entanglement concentration protocols for four-particle linear cluster states which and are susceptible to the decoherence and the imperfect communication setups. In the first protocol, POVM operators are introduced to maximize the success probability, and the second protocol is based on cross-Kerr nonlinearity which is utilized to check the parity between the original particle and the ancillary particle. Both of the protocols have their own advantages. The first one can be easily realized in experiment by linear optics, while the one with cross-Kerr nonlinearity reach more than 90% success probability by iteration. Since the wide application of cluster states, the two protocols are efficient and valuable to different fields of quantum communication.

In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for universal Gaussian operations.

We propose a scheme to implement a two-qubit controlled-phase gate for single atomic qubits, which works in principle with nearly ideal success probability and fidelity. Our scheme is based on the cavity input-output process and the single-photon polarization measurement. We show that, even with the practical imperfections such as atomic spontaneous emission, weak atom-cavity coupling, violation of the Lamb-Dicke condition, cavity photon loss, and detection inefficiency, the proposed gate is feasible for generation of a cluster state in that it meets the scalability criterion and it operates in a conclusive manner. We demonstrate a simple and efficient process to generate a cluster state with our high probabilistic entangling gate.

We propose a scheme to achieve a kind of nontrivial multipartite pair-wise controlled phase operation in a cavity QED setup. The operation implemented is of geometrical nature and is not sensitive to the thermal state of the cavity. In particular, we have managed to avoid the conventional dispersive coupling so that high speed gate operation is achieved which is very important in view of decoherence. We show that this multipartite pair-wise controlled phase operation makes the generation of two-dimensional cluster states very efficient.

Continuous-variable Gaussian cluster states are a potential resource for universal quantum computation. They can be efficiently and unconditionally built from sources of squeezed light using beam splitters. Here we report on the generation of three different kinds of continuous-variable four-mode cluster states. In our realization, the resulting cluster-type correlations are such that no corrections other than simple phase-space displacements would be needed when quantum information propagates through these states. At the same time, the inevitable imperfections from the finitely squeezed resource states and from additional thermal noise are minimized, as no antisqueezing components are left in the cluster states.

Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the T2 time of the qubits for various cluster state geometries, and we estimate the size of the qubit reservoir that is needed for the creation of mini-clusters.