Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.03022 · IEEE Access

Physical Realization of Measurement Based Quantum Computation

Muhammad Kashif, Saif M. Al-Kuwari

Published Jan 1, 2023• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/access.2023.3289005

Related papers

Realizations of Measurement Based Quantum Computing

Swapnil Nitin Shah

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.

arXiv:2112.11601•Dec 22, 2021•1 citation

FMCC: Flexible Measurement-based Quantum Computation over Cluster State

Yingheng Li, Aditya Pawar, Zewei Mo +3 more

Measurement-based quantum computing (MBQC) is a promising quantum computing paradigm that performs computation through "one-way" measurements on entangled quantum qubits. It is widely used in photonic quantum computing (PQC), where the computation is carried out on photonic cluster states (i.e., a 2-D mesh of entangled photons). In MBQC-based PQC, the cluster state depth (i.e., the length of one-way measurements) plays an important role in the overall execution time and circuit error. In this paper, we propose FMCC, a compilation framework that employs dynamic programming with heuristics to efficiently minimize the cluster state depth. Experimental results on six quantum applications show that FMCC achieves 51.7%, 57.4%, and 56.8% average depth reductions in small, medium, and large qubit counts compared to the state-of-the-art MBQC compilations.

International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Apr 27, 2024•6 citations

Time-Domain-Multiplexed Measurement-Based Quantum Operations with 25-MHz Clock Frequency

Warit Asavanant, Baramee Charoensombutamon, Shota Yokoyama +8 more

Continuous-variable optical quantum computation has seen much progress in recent years. In particular, cluster states---the universal resource for measurement-based quantum computation---have been realized in a scalable fashion using the time-domain multiplexing method. To utilize the cluster states in actual quantum computation, the measurement bases need to be programmed according to the desired computation. In addition, as the information is encoded in time in the time-domain multiplexing method, the measurement bases must be dynamically changed in time to fully utilize the large-scale cluster states. Here we report demonstrations of quantum operations using time-domain-multiplexed cluster states with a clock frequency of 25 MHz. This is achieved by our combining the cluster-state-generation setup with the setup to change the measurement basis in the time domain. We also formulate a method to evaluate and verify continuous-variable operations where the quantum entanglements in the cluster states are utilized. Therefore, we demonstrate the implementation of quantum operations on scalable continuous-variable cluster-state architectures. The results in this work are compatible with the developing nonlinear feedforward and non-Gaussian state generation technology, which brings the realization of the large-scale fault-tolerant universal optical quantum computer closer to reality.

arXiv:2006.11537•Physical Review Applied•Sep 2, 2021•94 citations

Minimizing Photonic Cluster State Depth in Measurement-Based Quantum Computing

Yingheng Li, Aditya Pawar, Zewei Mo +3 more

Measurement-based quantum computing (MBQC) is a promising quantum computing paradigm that performs computation through ``one-way'' measurements on entangled quantum qubits. It is widely used in photonic quantum computing (PQC), where the computation is carried out on photonic cluster states (i.e., a 2-D mesh of entangled photons). In MBQC-based PQC, the cluster state depth (i.e., the length of one-way measurements) to execute a quantum circuit plays an important role in the overall execution time and error. Thus, it is important to reduce the cluster state depth. In this paper, we propose FMCC, a compilation framework that employs dynamic programming to efficiently minimize the cluster state depth. Experimental results on five representative quantum algorithms show that FMCC achieves 53.6%, 60.6%, and 60.0% average depth reductions in small, medium, and large qubit counts compared to the state-of-the-art MBQC compilation frameworks.

arXiv:2312.10865•Dec 18, 2023•4 citations

Focus on Measurement-Based Quantum Information Processing

Terry Rudolph, Jian-Wei Pan

The last two decades have witnessed the rapid growth of quantum information processing as an active field of multidisciplinary science and technology. Tremendous theoretical and experimental progress has been made in quantum communication and quantum computation, and it seems clear that some of this progress will soon result in practical applications outside the laboratory. Quantum computation aims to build a quantum computer and to explore the origins and limits of quantum computing power. The original circuit model of a quantum computer, due to Deutsch, has a strong formal similarity with the circuit model of a classical computer. Both models depict a computation as processing via the wiring of a number of fiducial gates, each of which dynamically couples a small number of input (qu)bits in a controlled manner. In other words, unitary evolution is the basic mechanism of information processing in the circuit model of quantum computers. Starting with a given fixed state of many qubits, measurement based quantum computation (MBQC) processes information by applying a sequence of measurements to designated qubits in designated bases. This is remarkable, given the probabilistic nature of quantum measurement and the murky physical status of the dynamics of 'wavefunction collapse'. The final result of the computation is determined from the classical data of all the measurement outcomes. There exist two principle models: the teleportation based model and the 'one-way quantum computer' of 'cluster state computation'. The formalism of cluster states has proven to be a powerful way of describing the essential entanglement resources needed to perform quantum information processing. Unlike the circuit model, the MBQC models have no natural classical counterpart. There are a number of physical architectures for which measurements on the relevant systems are more easily performed than controlled unitary evolution. Moreover, it appears the MBQC models can offer novel computational benefits, especially regarding issues of fault-tolerance and parallelizability of algorithms. As a result, the theory of MBQC is now shaping the latest experimental proposals across the full spectrum of quantum information processing technologies. Naturally, understanding the scope of measurement based quantum computation is also yielding many insights into what is necessary (as opposed to merely sufficient) for us to harness the power of quantum computers. Quantum communication aims to offer efficient and secure ways of information exchange, directly based on quantum mechanics. Photons serve as natural information carriers, owing to their robustness against decoherence. A major problem for photonic communication systems is due to photon loss. It turns out that this difficulty can be overcome by the quantum repeater, a measurement-based technique. The basic idea is to divide the transmission channel into many segments and perform some quantum measurement on each segment. Additional measurement-based protocols and technologies have also been demonstrated to improve the quality of quantum communication, such as entanglement swapping and purification. The articles in this invited Focus Issue cover topics both in measurement-based quantum communication and computation, but the emphasis is given to quantum computation. A significant number of articles deal with the preparation of cluster states, the experimental realization of a one-way quantum computer, and the associated efficiency and benefits. We hope that you will find that some of these new results are of interest to you, and further hope that the issue will increase your interest in this interdisciplinary research field if you are a non-expert. Focus on Measurement-Based Quantum Information Processing Contents A proof-of-principle experiment of eliminating photon-loss errors in cluster states Wei-Bo Gao, Xiao-Qi Zhou, Jin Zhang, Tao Yang and Jian-Wei Pan Continuous variable multipartite entanglement and optical implementations of quantum communication networks Yimin Lian, Changde Xie and Kunchi Peng Generalized flow and determinism in measurement-based quantum computation Daniel E Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix The entanglement of the four-photon cluster state C Schmid, N Kiesel, W Wieczorek and H Weinfurter Optical zeno gate: bounds for fault tolerant operation Patrick M Leung and Timothy C Ralph Towards experimental entanglement connection with atomic ensembles in the single excitation regime Julien Laurat, Chin-wen Chou, Hui Deng, Kyung Soo Choi, Daniel Felinto, Hugues de Riedmatten and H J Kimble Towards minimal resources of measurement-based quantum computation Simon Perdrix Experimental realization of a quantum game on a one-way quantum computer Robert Prevedel, Andre Stefanov, Philip Walther and Anton Zeilinger Fundamentals of universality in one-way quantum computation M Van den Nest, W Dur, A Miyake and H J Briegel Loss tolerant linear optical quantum memory by measurement-based quantum computing Michael Varnava, Daniel E Browne and Terry Rudolph Graph state generation with noisy mirror-inverting spin chains Stephen R Clark, Alexander Klein, Martin Bruderer and Dieter Jaksch One-way quantum computing in adecoherence-free subspace M S Tame, M Paternostro and M S Kim Cluster state preparation using gates operating at arbitrary success probabilities K Kieling, D Gross and J Eisert Topological fault-tolerance in cluster state quantum computation R Raussendorf, J Harrington and K Goyal Strategies for the preparation of large cluster states using non-deterministic gates Peter P Rohde and Sean D Barrett A repeat-until-success quantum computing scheme A Beige, Y L Lim and L C Kwek Efficient growth of complex graph states via imperfect path erasure Earl T Campbell, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok Investigation of a single-photon source based on quantum interference T B Pittman, J D Franson and B C Jacobs Entanglement and local information access for graph states Damian Markham, Akimasa Miyake and Shashank Virmani The efficiencies of generating cluster states with weak nonlinearities Sebastien G R Louis, Kae Nemoto, W J Munro and T P Spiller A direct approach to fault-tolerance in measurement-based quantum computation via teleportation Marcus Silva, Vincent Danos, Elham Kashefi and Harold Ollivier Experimental ancilla-assisted qubit transmission against correlated noise T Yamamoto, R Nagase, J Shimamura, S K Ozdemir, M Koashi and N Imoto Terry Rudolph, Imperial College, London, UK Jian-Wei Pan, University of Science and Technology of China, Hefei, People's Republic of China and Universitat Heidelberg, Germany

New Journal of Physics•Jun 29, 2007•2 citations

Measurement-based quantum computation with qubit and continuous-variable systems

Rafael N. Alexander

Quantum computers offer impressive computational speed-ups over their present-day (classical) counterparts. In the measurement-based model, quantum computation is driven by single-site measurements on a large entangled quantum state known as a cluster state. This thesis explores extensions of the measurement-based model for quantum computation in qubit and continuous-variable systems. Within the qubit setting, we consider the task of characterizing how well a small-scale measurement-based quantum device can perform logic gates. We adapt a pre-existing scheme known as randomized benchmarking into the setting of measurement-based quantum computation on a one-dimensional cluster state. A key feature of randomized benchmarking is that it uses random sequences of gates. We show how the intrinsic randomness of measurement-based quantum computation can be harnessed when implementing them. Within the continuous-variable setting, we consider optical cluster states that can be generated with current technology. We propose a compact method for generating universal cluster states based on optical-parametric-oscillator technology. We consider how finite squeezing effects manifest in computation and show that pre-existing measurement-based protocols are suboptimal. We propose new measurement-based protocols that have better noise properties, compactness, and circuit flexibility. As an application, we introduce a measurement-based method for implementing interferometry. In this model, the finite squeezing noise can be dealt with as a photon-loss process. Building further on this work, we investigate the resource requirements of a measurement-based boson-sampling device, proving simultaneous efficiency in time, space, and squeezing (energy) resources. These results offer new insights into how to build, use, and characterize a measurement-based quantum computer.

•Sep 21, 2016•0 citations
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.
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.
Measurement-based quantum computing (MBQC) is a promising quantum computing paradigm that performs computation through "one-way" measurements on entangled quantum qubits. It is widely used in photonic quantum computing (PQC), where the computation is carried out on photonic cluster states (i.e., a 2-D mesh of entangled photons). In MBQC-based PQC, the cluster state depth (i.e., the length of one-way measurements) plays an important role in the overall execution time and circuit error. In this paper, we propose FMCC, a compilation framework that employs dynamic programming with heuristics to efficiently minimize the cluster state depth. Experimental results on six quantum applications show that FMCC achieves 51.7%, 57.4%, and 56.8% average depth reductions in small, medium, and large qubit counts compared to the state-of-the-art MBQC compilations.
Continuous-variable optical quantum computation has seen much progress in recent years. In particular, cluster states---the universal resource for measurement-based quantum computation---have been realized in a scalable fashion using the time-domain multiplexing method. To utilize the cluster states in actual quantum computation, the measurement bases need to be programmed according to the desired computation. In addition, as the information is encoded in time in the time-domain multiplexing method, the measurement bases must be dynamically changed in time to fully utilize the large-scale cluster states. Here we report demonstrations of quantum operations using time-domain-multiplexed cluster states with a clock frequency of 25 MHz. This is achieved by our combining the cluster-state-generation setup with the setup to change the measurement basis in the time domain. We also formulate a method to evaluate and verify continuous-variable operations where the quantum entanglements in the cluster states are utilized. Therefore, we demonstrate the implementation of quantum operations on scalable continuous-variable cluster-state architectures. The results in this work are compatible with the developing nonlinear feedforward and non-Gaussian state generation technology, which brings the realization of the large-scale fault-tolerant universal optical quantum computer closer to reality.
Measurement-based quantum computing (MBQC) is a promising quantum computing paradigm that performs computation through ``one-way'' measurements on entangled quantum qubits. It is widely used in photonic quantum computing (PQC), where the computation is carried out on photonic cluster states (i.e., a 2-D mesh of entangled photons). In MBQC-based PQC, the cluster state depth (i.e., the length of one-way measurements) to execute a quantum circuit plays an important role in the overall execution time and error. Thus, it is important to reduce the cluster state depth. In this paper, we propose FMCC, a compilation framework that employs dynamic programming to efficiently minimize the cluster state depth. Experimental results on five representative quantum algorithms show that FMCC achieves 53.6%, 60.6%, and 60.0% average depth reductions in small, medium, and large qubit counts compared to the state-of-the-art MBQC compilation frameworks.
The last two decades have witnessed the rapid growth of quantum information processing as an active field of multidisciplinary science and technology. Tremendous theoretical and experimental progress has been made in quantum communication and quantum computation, and it seems clear that some of this progress will soon result in practical applications outside the laboratory. Quantum computation aims to build a quantum computer and to explore the origins and limits of quantum computing power. The original circuit model of a quantum computer, due to Deutsch, has a strong formal similarity with the circuit model of a classical computer. Both models depict a computation as processing via the wiring of a number of fiducial gates, each of which dynamically couples a small number of input (qu)bits in a controlled manner. In other words, unitary evolution is the basic mechanism of information processing in the circuit model of quantum computers. Starting with a given fixed state of many qubits, measurement based quantum computation (MBQC) processes information by applying a sequence of measurements to designated qubits in designated bases. This is remarkable, given the probabilistic nature of quantum measurement and the murky physical status of the dynamics of 'wavefunction collapse'. The final result of the computation is determined from the classical data of all the measurement outcomes. There exist two principle models: the teleportation based model and the 'one-way quantum computer' of 'cluster state computation'. The formalism of cluster states has proven to be a powerful way of describing the essential entanglement resources needed to perform quantum information processing. Unlike the circuit model, the MBQC models have no natural classical counterpart. There are a number of physical architectures for which measurements on the relevant systems are more easily performed than controlled unitary evolution. Moreover, it appears the MBQC models can offer novel computational benefits, especially regarding issues of fault-tolerance and parallelizability of algorithms. As a result, the theory of MBQC is now shaping the latest experimental proposals across the full spectrum of quantum information processing technologies. Naturally, understanding the scope of measurement based quantum computation is also yielding many insights into what is necessary (as opposed to merely sufficient) for us to harness the power of quantum computers. Quantum communication aims to offer efficient and secure ways of information exchange, directly based on quantum mechanics. Photons serve as natural information carriers, owing to their robustness against decoherence. A major problem for photonic communication systems is due to photon loss. It turns out that this difficulty can be overcome by the quantum repeater, a measurement-based technique. The basic idea is to divide the transmission channel into many segments and perform some quantum measurement on each segment. Additional measurement-based protocols and technologies have also been demonstrated to improve the quality of quantum communication, such as entanglement swapping and purification. The articles in this invited Focus Issue cover topics both in measurement-based quantum communication and computation, but the emphasis is given to quantum computation. A significant number of articles deal with the preparation of cluster states, the experimental realization of a one-way quantum computer, and the associated efficiency and benefits. We hope that you will find that some of these new results are of interest to you, and further hope that the issue will increase your interest in this interdisciplinary research field if you are a non-expert. Focus on Measurement-Based Quantum Information Processing Contents A proof-of-principle experiment of eliminating photon-loss errors in cluster states Wei-Bo Gao, Xiao-Qi Zhou, Jin Zhang, Tao Yang and Jian-Wei Pan Continuous variable multipartite entanglement and optical implementations of quantum communication networks Yimin Lian, Changde Xie and Kunchi Peng Generalized flow and determinism in measurement-based quantum computation Daniel E Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix The entanglement of the four-photon cluster state C Schmid, N Kiesel, W Wieczorek and H Weinfurter Optical zeno gate: bounds for fault tolerant operation Patrick M Leung and Timothy C Ralph Towards experimental entanglement connection with atomic ensembles in the single excitation regime Julien Laurat, Chin-wen Chou, Hui Deng, Kyung Soo Choi, Daniel Felinto, Hugues de Riedmatten and H J Kimble Towards minimal resources of measurement-based quantum computation Simon Perdrix Experimental realization of a quantum game on a one-way quantum computer Robert Prevedel, Andre Stefanov, Philip Walther and Anton Zeilinger Fundamentals of universality in one-way quantum computation M Van den Nest, W Dur, A Miyake and H J Briegel Loss tolerant linear optical quantum memory by measurement-based quantum computing Michael Varnava, Daniel E Browne and Terry Rudolph Graph state generation with noisy mirror-inverting spin chains Stephen R Clark, Alexander Klein, Martin Bruderer and Dieter Jaksch One-way quantum computing in adecoherence-free subspace M S Tame, M Paternostro and M S Kim Cluster state preparation using gates operating at arbitrary success probabilities K Kieling, D Gross and J Eisert Topological fault-tolerance in cluster state quantum computation R Raussendorf, J Harrington and K Goyal Strategies for the preparation of large cluster states using non-deterministic gates Peter P Rohde and Sean D Barrett A repeat-until-success quantum computing scheme A Beige, Y L Lim and L C Kwek Efficient growth of complex graph states via imperfect path erasure Earl T Campbell, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok Investigation of a single-photon source based on quantum interference T B Pittman, J D Franson and B C Jacobs Entanglement and local information access for graph states Damian Markham, Akimasa Miyake and Shashank Virmani The efficiencies of generating cluster states with weak nonlinearities Sebastien G R Louis, Kae Nemoto, W J Munro and T P Spiller A direct approach to fault-tolerance in measurement-based quantum computation via teleportation Marcus Silva, Vincent Danos, Elham Kashefi and Harold Ollivier Experimental ancilla-assisted qubit transmission against correlated noise T Yamamoto, R Nagase, J Shimamura, S K Ozdemir, M Koashi and N Imoto Terry Rudolph, Imperial College, London, UK Jian-Wei Pan, University of Science and Technology of China, Hefei, People's Republic of China and Universitat Heidelberg, Germany
Quantum computers offer impressive computational speed-ups over their present-day (classical) counterparts. In the measurement-based model, quantum computation is driven by single-site measurements on a large entangled quantum state known as a cluster state. This thesis explores extensions of the measurement-based model for quantum computation in qubit and continuous-variable systems. Within the qubit setting, we consider the task of characterizing how well a small-scale measurement-based quantum device can perform logic gates. We adapt a pre-existing scheme known as randomized benchmarking into the setting of measurement-based quantum computation on a one-dimensional cluster state. A key feature of randomized benchmarking is that it uses random sequences of gates. We show how the intrinsic randomness of measurement-based quantum computation can be harnessed when implementing them. Within the continuous-variable setting, we consider optical cluster states that can be generated with current technology. We propose a compact method for generating universal cluster states based on optical-parametric-oscillator technology. We consider how finite squeezing effects manifest in computation and show that pre-existing measurement-based protocols are suboptimal. We propose new measurement-based protocols that have better noise properties, compactness, and circuit flexibility. As an application, we introduce a measurement-based method for implementing interferometry. In this model, the finite squeezing noise can be dealt with as a photon-loss process. Building further on this work, we investigate the resource requirements of a measurement-based boson-sampling device, proving simultaneous efficiency in time, space, and squeezing (energy) resources. These results offer new insights into how to build, use, and characterize a measurement-based quantum computer.