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

Chinese Physics B

Delayed-measurement one-way quantum computing on cloud quantum computer

Zhi-Peng 智鹏 Yang 杨, Yu-Ran 煜然 Zhang 张, Fu-Li 福利 Li 李, Heng 桁 Fan 范

Published Jul 12, 2024• 1 citation
Publisher

Abstract

Abstract One-way quantum computation focuses on initially generating an entangled cluster state followed by a sequence of measurements with classical communication of their individual outcomes. Recently, a delayed-measurement approach has been applied to replace classical communication of individual measurement outcomes. In this work, by considering the delayed-measurement approach, we demonstrate a modified one-way CNOT gate using the on-cloud superconducting quantum computing platform: Quafu. The modified protocol for one-way quantum computing requires only three qubits rather than the four used in the standard protocol. Since this modified cluster state decreases the number of physical qubits required to implement one-way computation, both the scalability and complexity of the computing process are improved. Compared to previous work, this modified one-way CNOT gate is superior to the standard one in both fidelity and resource requirements. We have also numerically compared the behavior of standard and modified methods in large-scale one-way quantum computing. Our results suggest that in a noisy intermediate-scale quantum (NISQ) era, the modified method shows a significant advantage for one-way quantum computation.

DOI
10.1088/1674-1056/ad6253

Related papers

Deterministic one-way logic gates on a cloud quantum computer

Zhi-Peng Yang, Huan-Yu Ku, Alakesh Baishya +6 more

One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose protocols to realize a deterministic one-way controlled-not (cnot) gate and one-way $X$ rotations on current quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication. In addition, we apply our deterministic one-way cnot gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.

arXiv:2108.03865•Physical Review A•Apr 18, 2022•13 citations

One-way quantum computing in superconducting circuits

F. Albarrán-Arriagada, G. Alvarado Barrios, Mikel Sanz +4 more

We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path toward quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.

arXiv:1711.10902•Physical Review A•Mar 16, 2018•22 citations

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

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.14656•May 15, 2026•0 citations

Real-time measurement error mitigation for one-way quantum computation

Tobias Hartung, S. Schuster, Joachim von Zanthier +1 more

Abstract We propose a quantum error mitigation scheme for single-qubit measurement errors, particularly suited for one-way quantum computation. Contrary to well established error mitigation methods for circuit-based quantum computation that require the circuits to be run several times, our method is capable of mitigating measurement errors in real time during the processing measurements in the one-way computation. For that, an ancillary qubit register is entangled with the to-be-measured qubit and additionally measured afterwards. By using a voting protocol on all measurement outcomes, occurring measurement errors can be mitigated in real time while the one-way computation continues. We provide an analytical expression for the probability to detect a measurement error depending on the error rate and the number of ancilla qubits. From this, we derive an estimate of the ancilla register size for a given measurement error rate and a required success probability to detect a measurement error. Additionally, we consider the CNOT gate error in our mitigation method and investigate how this influences the probability to detect a measurement error. Finally, we show in proof-of-principle simulations and in experiments executed on IBM quantum hardware that our method is capable of reducing the measurement errors significantly in a one-way quantum computation with only a small number of ancilla qubits.

arXiv:2411.09084•Scientific Reports•Sep 19, 2026•0 citations

Extracting one-way quantum computation patterns from quantum circuits

Mahboobeh Houshmand, Mohammad Hossein Samavatian, Morteza Saheb Zamani +1 more

In one-way quantum computations (1WQC), quantum correlations in an entangled state, called a cluster or graph state, are exploited to perform universal quantum computations using single-qubit measurements. The choices of bases for these measurements as well as the structure of the entanglements specify a quantum algorithm. The needed computations in this model are organized as patterns. Previously, an approach to extract a 1WQC pattern from a quantum circuit was proposed. The approach takes a quantum circuit consisting of only CZ andj(oc) gates and translates it into a 1WQC pattern after performing some known optimizations. However, most quantum synthesis algorithms decompose circuits using a library containing CNOT and any single-qubit gates. In this paper, we show how this approach can be modified in a way that it can take a circuit consisting of CNOT and any single-qubit gates as well as CZ and J(oc) gates to produce a 1WQC pattern. Experimental results show that adding CNOT gate directly to the pattern decreases the translation run-time.

CSI International Symposium on Computer Architecture and Digital Systems (CADS)•May 1, 2012•4 citations
Abstract One-way quantum computation focuses on initially generating an entangled cluster state followed by a sequence of measurements with classical communication of their individual outcomes. Recently, a delayed-measurement approach has been applied to replace classical communication of individual measurement outcomes. In this work, by considering the delayed-measurement approach, we demonstrate a modified one-way CNOT gate using the on-cloud superconducting quantum computing platform: Quafu. The modified protocol for one-way quantum computing requires only three qubits rather than the four used in the standard protocol. Since this modified cluster state decreases the number of physical qubits required to implement one-way computation, both the scalability and complexity of the computing process are improved. Compared to previous work, this modified one-way CNOT gate is superior to the standard one in both fidelity and resource requirements. We have also numerically compared the behavior of standard and modified methods in large-scale one-way quantum computing. Our results suggest that in a noisy intermediate-scale quantum (NISQ) era, the modified method shows a significant advantage for one-way quantum computation.
One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose protocols to realize a deterministic one-way controlled-not (cnot) gate and one-way XXX rotations on current quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication. In addition, we apply our deterministic one-way cnot gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path toward quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.
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.
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.
Abstract We propose a quantum error mitigation scheme for single-qubit measurement errors, particularly suited for one-way quantum computation. Contrary to well established error mitigation methods for circuit-based quantum computation that require the circuits to be run several times, our method is capable of mitigating measurement errors in real time during the processing measurements in the one-way computation. For that, an ancillary qubit register is entangled with the to-be-measured qubit and additionally measured afterwards. By using a voting protocol on all measurement outcomes, occurring measurement errors can be mitigated in real time while the one-way computation continues. We provide an analytical expression for the probability to detect a measurement error depending on the error rate and the number of ancilla qubits. From this, we derive an estimate of the ancilla register size for a given measurement error rate and a required success probability to detect a measurement error. Additionally, we consider the CNOT gate error in our mitigation method and investigate how this influences the probability to detect a measurement error. Finally, we show in proof-of-principle simulations and in experiments executed on IBM quantum hardware that our method is capable of reducing the measurement errors significantly in a one-way quantum computation with only a small number of ancilla qubits.
In one-way quantum computations (1WQC), quantum correlations in an entangled state, called a cluster or graph state, are exploited to perform universal quantum computations using single-qubit measurements. The choices of bases for these measurements as well as the structure of the entanglements specify a quantum algorithm. The needed computations in this model are organized as patterns. Previously, an approach to extract a 1WQC pattern from a quantum circuit was proposed. The approach takes a quantum circuit consisting of only CZ andj(oc) gates and translates it into a 1WQC pattern after performing some known optimizations. However, most quantum synthesis algorithms decompose circuits using a library containing CNOT and any single-qubit gates. In this paper, we show how this approach can be modified in a way that it can take a circuit consisting of CNOT and any single-qubit gates as well as CZ and J(oc) gates to produce a 1WQC pattern. Experimental results show that adding CNOT gate directly to the pattern decreases the translation run-time.