Finding the optimal cluster state configuration. Cluster states classification by type of computations

We experimentally demonstrate a controlled-phase gate for continuous variables using a cluster-state resource of four optical modes. The two independent input states of the gate are coupled with the cluster in a teleportation-based fashion. As a result, one of the entanglement links present in the initial cluster state appears in the two unmeasured output modes as the corresponding entangling gate acting on the input states. The genuine quantum character of this gate becomes manifest and is verified through the presence of entanglement at the output for a product two-mode coherent input state. By combining our gate with the recently reported module for single-mode Gaussian operations [R. Ukai et al., Phys. Rev. Lett. 106, 240504 (2011)], it is possible to implement any multimode Gaussian operation as a fully measurement-based one-way quantum computation.

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.

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.

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.

Multidimensional cluster states are a key resource for robust quantum communication, measurement-based quantum computing and quantum metrology. Here, we present a device capable of emitting large-scale entangled microwave photonic states in a two dimensional ladder structure. The device consists of a pair of coupled superconducting transmon qubits which are each tuneably coupled to a common output waveguide. This architecture permits entanglement between each transmon and a deterministically emitted photonic qubit. By interleaving two-qubit gates with controlled photon emission, we generate 2 × n grids of time- and frequency-multiplexed cluster states of itinerant microwave photons. We generate states with fidelities above 0.50 for up to eight qubits and, in addition, observe nonzero localizable entanglement for states of up to 16 qubits. We expect the device architecture to be capable of generating a wide range of other tensor network states such as tree graph states, repeater states or the ground state of the toric code, and to be readily scalable to generate larger and higher dimensional states.

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.

One of the biggest challenges to a viable quantum computer with real-world impact is scaling it up to handle large computations. Continuous-variable (CV) cluster states, which are resource states for measurement-based quantum computation, can be made on a vast scale with minimal experimental resources. I will present recent experimental breakthroughs in producing large-scale CV cluster states, and I will illustrate how to use these states for fault-tolerant quantum computation.

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.

Circuit-based quantum computing (CBQC), also known as the gate model, is currently regarded as the leading paradigm for performing quantum computation and has garnered widespread interest due to its relatively better-established implementation and close intuitive resemblance to classical computation. However, an alternative model that solely utilizes single-qubit measurements on entangled states to perform computation, namely the measurement-based quantum computing (MBQC), has started to attract further research interest as it is deemed more naturally suited for certain quantum hardware architectures, though its actual implementation remains largely underexplored. Recently, there have been preliminary efforts to characterize the specific regimes in which MBQC may potentially be more advantageous compared to CBQC. Nevertheless, a more systematic assessment is necessary to assess the suitability of each model across a broader range of more practical cases. In this work, we present a detailed comparative analysis of CBQC and MBQC, beginning with reviewing the theoretical foundations of each model before highlighting its distinguishing features that set the two paradigms apart. Furthermore, building on previous work, we propose a generalized regime analysis that more accurately captures the conditions under which a given quantum algorithm is more favorably executed in MBQC or CBQC. Subsequently, we identify critical parameters that likely determine whether a quantum algorithm is better suited to CBQC or MBQC, categorizing detailed key factors and performance metrics into layers of quantum computation. Next, we propose a decision flow that, given specific hardware constraints and algorithm requirements, guides the selection to the most appropriate model, discussing suitability in two representative worked examples of quantum algorithm applications: Quantum Fourier Transform (QFT) and Variational Quantum Algorithm (VQE). Last, we discuss the potential to combine both models as a hybrid approach to leverage the best of both worlds and explore its benefits for practical quantum computing applications.

Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased noise where the qubit predominantly suffers from one type of error, e.g. dephasing. However, extending these advances in stabilizer codes to generate high-threshold cluster states for biased noise has been a challenge, as the standard method for foliating stabilizer codes to generate fault-tolerant cluster states does not preserve the noise bias. In this work, we overcome this barrier by introducing a generalization of the cluster state that allows us to foliate stabilizer codes in a bias-preserving way. As an example of our approach, we construct a foliated version of the XZZX code which we call the XZZX cluster state. We demonstrate that under a circuit-level-noise model, our XZZX cluster state has a threshold more than double the usual cluster state when dephasing errors are more likely than errors that cause bit flips by a factor of order ~100 or more.

The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504 (2014)]. Here, we expand the scope of that result by showing that additional anti-squeezing has no effect on the fault-tolerance threshold, removing the purity requirement for experimental continuous-variable cluster-state quantum computing. We emphasize that the appropriate experimental target for fault-tolerant applications is to directly measure 15-17 dB of squeezing in the cluster state rather than the more conservative upper bound of 20.5 dB.

Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the client's universal BQC, we construct an $m\times n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.

We consider the issue of what should count as a resource for measurement-based quantum computation (MBQC). While a state that supports universal quantum computation clearly should be considered a resource, universality should not be necessary given the existence of interesting, but less computationally-powerful, classes of MBQCs. Here, we propose minimal criteria for a state to be considered a resource state for MBQC. Using these criteria, we explain why discord-free states cannot be resources for MBQC, contrary to recent claims [Hoban et al., arXiv:1304.2667v1]. Independently of our criteria, we also show that the arguments of Hoban et al., if correct, would imply that Shor's algorithm (for example) can be implemented by measuring discord-free states.

The asymmetric cluster states in 28Si are discussed on the basis of antisymmetrized molecular dynamics. It is found that the inversion doublet bands having the 24Mg+α, 20Ne+8Be and 16O+12C cluster configurations appear in the energy range of Ex = 10 ∼ 15 MeV. It is demonstrated that the 24Mg+α, 20Ne+8Be cluster states have pronounced isoscalar monopole (IS0) and dipole (IS1) transition strengths from the ground state. This result suggests that the IS0 and IS1 strength are good probe for these cluster states.