Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation ($T_1$) yields $>$90\% fidelity while pure dephasing $T_2$ show $70\%$ decays at fourth harmonics. We further show under noise $T_2$ decays to 50\% within 15 time units, versus $>$70\% under relaxation time units ($T_1$)--only. This decay quantify degradation effect of $T_2$ on preparing cluster--state preparation is more than $T_1$. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.
Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation (T1) yields >90% fidelity while pure dephasing T2 show 70% decays at fourth harmonics. We further show under noise T2 decays to 50% within 15 time units, versus >70% under relaxation time units (T1)--only. This decay quantify degradation effect of T2 on preparing cluster--state preparation is more than T1. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.
We investigate the fidelity of measurement-based quantum computation (MBQC) when it is coupled with a boson environment, by measuring the cluster-state fidelity and gate fidelity. Two schemes of cluster-state preparation are studied. In the controlled-Z (CZ) creation scheme, cluster states are prepared by entangling all qubits in $|+\ensuremath{\rangle}$ state with CZ gates at all neighboring sites. The fidelity shows an oscillation pattern over time. The influence of the environmental temperature is evaluated, and suggestions are given to enhance the performance of MBQCs realized in this way. In the Hamiltonian creation scheme, cluster states are made by cooling a system with cluster Hamiltonians, of which the ground states are cluster states. A fidelity sudden-drop phenomenon is discovered. When the coupling is below a threshold, MBQC systems are highly robust against the noise. Our main environmental model is one with a single collective bosonic mode.
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in improving scalability of quantum computing systems have enabled the generation of large cluster states for implementing MBQC on various platforms. This review focuses on three such efforts, each utilizing a different quantum computing technology viz., superconducting qubits, trapped ion qubits and squeezed photon states. MBQC is being increasingly employed on optical platforms which can generate large entangled resource states but lack the ability to perform deterministic entangling gates.
Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. Ancilla-driven schemes are important for chip-based quantum computing architectures, where the flying ancilla mediates between static qubits. Hybrid architectures form a natural substrate for measurement-based quantum computing (MBQC) [1], one type of which (the topological model) has the best error threshold for quantum computing [2]. In this type of processing a highly-entangled cluster state is generated, and then computation performed by sequential qubit measurements. The quantum processing task is to generate the cluster state, after which it becomes a matter of measurement and classical communication. In physically-realizable implementations the cluster is prepared dynamically, a few layers at a time. As the cluster state is the fundamental quantum resource of a measurement-based computation, it becomes extremely important to make it as error-free as possible. Errors in constructing the cluster can propagate rapidly through a computation because of the highly-entangled nature of the state, leading to failure of the computation. Hybrid systems are susceptible to specific error types that other systems are not, because of the use of the mediating ancilla. In cases where the ancilla is not destroyed after each gate there is a nonzero probability of errors propagating through ancilla reuse. FIG. 1: A cluster of 4 bricks of length b = 5 qubits, each made using a different bus. We present the optimal scheme for dynamic fault-tolerant 2-D cluster state generation in hybrid systems where the mediating system can be used for more than a single gate operation without being reset. We divide the cluster state into “Lego bricks”, each of which uses a single bus. We give the optimal method for constructing the bricks, reducing the number of system-bus entanglements. We then show how to determine the block size based on the error threshold of the system being used. We find that, even when the probability of error in the system is high, this scheme can still deliver significant efficiency savings through bus reuse, enabling a larger cluster to be generated. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate [3]. A simple example of the bricks is shown in figure 1. They are always the same height (m direction), but have length b (n direction) determined by [3] 1 ¡1 − exp[−(6b + 4)γτ − 16bηβ2]¢ ≤ ε. (1) 2 For a given set of experimental parameters γ, τ, η and β, and desired dephasing limit to ε, this determines b. If we use one bus per CPhase gate to generate a brick, we have 1 ¡1 − exp[−16bγτ − 4ηβ2]¢ ≤ ε. (2) 2 Comparing equations (1) and (2), we find our Lego scheme produces less qubit dephasing than using one bus per CPhase gate provided ηβ2 < ∼ γτ/2. Compared with 8mn − 4(m + n) bus operations with no bus reuse, for large clusters, the Lego scheme uses less than half for b > 2. And even for b = 1, the reduction is O(5mn) compared to O(8mn), equivalent to the method of [4] for five qubits per bus. This will thus be the method of choice for any ancilla-based cluster generation that allows bus reuse. Our results are directly applicable to bus-based experimental production of cluster states, enabling the same FIG. 2: Dynamic generation using multiple ancillas. resources to produce dynamically-generated cluster states of twice the size compared to single-gate bus use, see fig. 2. For multi-bus dynamic schemes, fully scalable operation can be achieved with half the coherence time compared to single-gate buses, needing as few as 20 CPhase gates per bus. We thank Aram Harrow, Ashley Stephens and Simon Devitt for useful discussions. CH was supported by EU project QAP and the Bristol Centre for Nanoscience and Quantum Information. KLB is supported by a UK Engineering and Physical Sciences Research Council industrial CASE studentship from Hewlett-Packard, VMK is supported by a UK Royal Society University Research Fellowship and WJM acknowledges partial support from the EU project HIP and MEXT in Japan.
Quantum computers, leveraging the principles of quantum mechanics, hold the potential to surpass classical computers in numerous applications, with implications across various domains. Besides the well-known gate model, Measurement-based Quantum Computation (MBQC) is another promising computational approach to achieve universal quantum computation. In MBQC, large ensembles of qubits are prepared in a highly entangled cluster state, forming the basis for executing quantum computations through sequential measurements. Cluster states are realized using both continuous variables (CV) and discrete variables (DV) techniques. In the CV-based methods, Frequency Domain Multiplexing (FDM), Time Domain Multiplexing (TDM), Spatial Domain Multiplexing (SDM), and hybrid schemes are employed. This paper thoroughly discusses and compares these approaches, elucidating their strengths and limitations. Additionally, the generation of photonic cluster states in DV is explored and some recent results are reported. Some recent state-of-the-art advancements in photonic and superconducting qubits entanglement, which can potentially serve as cluster states, are also presented. Finally, we highlight the approach that exhibits the most promising characteristics for achieving efficient cluster state realization in the context of MBQC.
Linear optical quantum computing in the dual-rail representation offers the practical advantage of room-temperature operation, with quantum gates implemented through beam splitters and phase shifters. Despite its appeal, this approach is fundamentally constrained by the nondeterministic nature of entangling gates, which limits scalability within the circuit-based paradigm. Measurement-based quantum computation (MBQC) addresses this issue by employing pre-generated cluster states and single-qubit projective measurements, but both frameworks remain highly susceptible to photon loss, the dominant error in photonic systems. In this work, we investigate the effects of photon loss on single-qubit gates, heralded two-qubit entangling gates, the two-qubit Grover algorithm, and the preparation of a three-qubit cluster state. By employing simplified photon-loss models, we quantify both the success probability and fidelity degradation of the resulting states. These results provide practical insight into the limitations of current photonic architectures and highlight pathways toward efficient error mitigation in near-term quantum technologies.
Photonic cluster states are fundamental resource for measurement-based quantum computing (MBQC), which is a promising approach for scalable quantum computing. These highly entangled states enable computation with applying local measurements rather than gate operations, which makes them essential for fault-tolerant quantum computing. Generation of the photonic cluster states requires high-quality entanglement and stability, which can be done by making use of cavity quantum electrodynamics (cavity QED), which is embedding quantum dots (QDs) into photonic microcavities. This method enables controlled single-photon emission and the entanglement of them, helping with key challenges in generating photonic cluster states. Enhancing the generation of the photonic cluster state requires improvement in the quality factor (Q-factor) and therefore, cooperativity of cavity and QD systems. A high Q-factor helps with reduction in photon loss and decoherence, ensuring more stable and high-fidelity quantum states. It also enables better light-matter interactions, improving cluster state quality. Cooperativity, which is a measure for the light-matter coupling strength relative to dissipation, directly impacts photon emission efficiency. Optimization of these parameters improves entanglement generation, which is essential for producing high-quality photonic cluster states. Therefore, optimized cavities are essential for improving the generation of the photonic cluster states. Scalability is also an important parameter for the generation of the large-scale cluster states used in quantum computing. In this paper, after reviewing MBQC, cluster states, and the generation of the photonic cluster states, we investigate the deterministic generation of the photonic cluster state resource for the purpose of MBQC, and highlights the importance of the inverse design techniques for this goal.