Feasibility of Distributed Measurement-Based Quantum Computing in Quantum Data Centers

Seyed Navid Elyasi, Rui Lin, Paolo Monti A

Published Jan 1, 2026• 0 citations

Abstract

We evaluate entanglement requirements, preparation, and execution times for QFT and Grover algorithms in distributed measurement-based quantum computation, and compare them with gate-based implementations on modular superconducting architectures, identifying regimes where measurement-based approaches outperform gate-based ones.

Related papers

Circuit-based vs. measurement-based quantum computing: a comparative analysis, layered metrics, and decision flow for approach selection

Harashta Tatimma Larasati, Byung-Soo Choi

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.

EPJ Quantum TechnologyFeb 27, 20260 citations

Framework for quantum data center emulation using digital quantum computers

Seyed Navid Elyasi, Paolo Monti A, Jun Li +1 more

As quantum computers scale, single-chip architectures face inherent limitations in qubit count. This drives the need for modular quantum computing and quantum data centers (QDCs), where multiple quantum processor units (QPUs) are interconnected to enable the distributed execution of a quantum algorithm. However, evaluating distributed quantum computing (DQC) architectures is challenging. Classical simulation is limited by the exponential growth of the state vector, limiting its ability to model large systems and realistically capture hardware noise and timing. Meanwhile, implementing QDC introduces interconnect noise challenges such as transduction inefficiency and optical fiber loss. In this work, we introduce a hardware-based emulation framework by partitioning a single quantum processor’s qubit coupling map into multiple logical QPUs. We show how noise arising from transduction and optical fibers can be modeled by adding an ancilla qubit representing the environment, based on quantum collision dynamics. This model is then translated into a gate-based circuit, in which the couplings between each portion act as controllable noisy quantum communication channels. We demonstrate the framework on IBM quantum hardware by executing remote gates under controllable communication noise. To highlight the flexibility of the platform, we further replicate the implementation results of the distributed Grover’s search algorithm on an ion-trap system. Finally, we test a larger circuit, i.e., a five-qubit quantum Fourier transform (QFT), achieving reasonable fidelity across logical QPUs. Overall, the framework provides a scalable hardware-level emulation platform that captures noise sources through physical qubits and is compatible with any platform supporting the Qiskit SDK.

arXiv:2509.04029Journal of Optical Communications and NetworkingJun 30, 20261 citation

Measurement-based quantum computing

Steven Anatolievich Duplij, Raimund Vogl

In this chapter, the measurement-based quantum computation model is overviewed and comprehensive references are given. The computation process starts with several entangled qubits and measurements act on each qubit separately. The result is then exploited for next measurements. To avoid measurement indeterminacy, local unitary operations (named corrections) are implemented, which give the one-way computation.

Institute of Physics eBooksNov 1, 20230 citations

Modular architectures and entanglement schemes for error-corrected distributed quantum computation

Siddhant Singh, Fenglei Gu, Sébastian de Bone +3 more

Abstract Connecting multiple smaller qubit modules by generating high-fidelity entanglement is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer depends on the quality and rate of entanglement generation. However, identifying optimal architectures and entanglement generation protocols remains an open question. How can modular quantum architectures be designed to achieve fault tolerance while requiring only feasible entanglement rates and hardware? Focusing on solid-state quantum hardware, we investigate the threshold and logical failure rate of a fully distributed surface code. We consider both emission-based and scattering-based entanglement schemes between the modules to link the performance to the physical hardware and identify the regime for fault tolerance. We compare architectures with one or two data qubits per module. For some entanglement schemes, thresholds nearing the thresholds of non-distributed implementations (~ 0.4%) appear feasible with future parameters minimizing the performance gap between modular and monolithic quantum processors.

arXiv:2408.02837npj Quantum InformationDec 2, 20259 citations

Optimized quantum circuit partitioning across multiple quantum processors

Eneet Kaur, Hassan Shapourian, Jiapeng Zhao +3 more

This paper addresses the challenge of scaling quantum computing using distributed quantum algorithms across multiple processors. We propose methods to optimize entanglement consumption for a quantum algorithm, and account for network constraints in the proposed solution.

Quantum Computing, Communication, and SimulationMar 19, 20256 citations

Blind Quantum Computation on a Modular Superconducting Processor

Yongxin Song, Johannes Knörzer, Kieran Dalton +2 more

Current cloud-based quantum processors offer access to advanced hardware hosted on a remote server, but do not guarantee data or algorithm privacy. Blind quantum computation provides information-theoretic privacy by enabling a client to execute an algorithm without disclosing information about either the task or the final result. Here, we execute a measurement-based blind quantum computation protocol on a superconducting processor comprising two flip-chip-bonded modules, one acting as a server and the other as a client. The server generates a two-dimensional cluster state and forwards it to the client. Using this resource, the client implements a universal gate set with only adaptive single-qubit rotations and measurements. To illustrate this approach, we execute a three-qubit instance of the Deutsch-Jozsa algorithm. We analyze the server's quantum state after each rotation of a measurement-based single-qubit gate to verify that negligible information about the computation is revealed to the server, consistent with the one-way flow of information that guarantees blindness. This proof-of-principle demonstration establishes key elements of blind quantum computation in superconducting-circuit architectures, indicating that intermediate-scale implementations of blind protocols may become feasible with realistic near-term improvements in gate fidelities.

quant-pharXiv:2605.14656May 15, 20260 citations