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:2104.12775 · Physical Review Research

Quantifying entanglement in cluster states built with error-prone interactions

Zhangjie Qin, Woo‐Ram Lee, Brian DeMarco, Bryce Gadway, Svetlana Kotochigova, V. W. Scarola

Published Nov 15, 2021• 4 citations
arXivHTMLPDF

Abstract

Measurement-based quantum computing is an alternative paradigm to the circuit-based model. This approach can be advantageous in certain scenarios, such as when read-out is fast and accurate, but two-qubit gates realized via inter-particle interactions are slow and can be parallelized to efficiently create a cluster state. However, understanding how two-qubit errors impact algorithm accuracy and developing experimentally viable approaches to characterize cluster-state fidelity are outstanding challenges. Here, we consider one-dimensional cluster states built from controlled phase, Ising, and XY interactions with slow two-qubit error in the interaction strength, consistent with error models of interactions found in a variety of qubit architectures. We detail an experimentally viable teleportation fidelity that offers a measure of the impact of these errors on the cluster state. Our fidelity calculations show that the error has a distinctly different impact depending on the underlying interaction used for the two-qubit entangling gate. In particular, the Ising and XY interactions can allow perfect teleportation through the cluster state even with large errors, but the controlled phase interaction does not. Nonetheless, we find that teleportation through cluster state chains of size $N$ has a maximum two-qubit error for teleportation along a quantum channel that decreases as ${N}^{\ensuremath{-}1/2}$. To enable the construction of larger cluster states, we design lowest-order refocusing pulses for correcting these slow errors in the interaction strength. Our work generalizes to higher-dimensional cluster states and sets the stage for experiments to monitor the growth of entanglement in cluster states built from error-prone interactions.

DOI
10.1103/physrevresearch.3.043118

Related papers

Fidelity measurement of a multiqubit cluster state with minimal effort

Konstantin Tiurev, Anders Søndberg Sørensen

The size of the Hilbert space for a multiqubit state scales exponentially with the number of constituent qubits. Often this leads to a similar exponential scaling of the experimental resources required to characterize the state. Contrary to this, we propose a physically motivated method for experimentally assessing the fidelity of an important class of entangled states known as cluster states. The proposed method always yields a lower bound of the fidelity with a number of measurement settings scaling only linearly with the system size, and is tailored to correctly account for the errors most likely to occur in experiments. For one-dimensional cluster states, the constructed fidelity measure is tight to lowest order in the error probability for experimentally realistic noise sources and thus closely matches the true fidelity. Furthermore, it is tight for the majority of higher-order errors, except for a small subset of certain nonlocal multiqubit errors irrelevant in typical experimental situations. The scheme also performs very well for higher-dimensional cluster states, assessing correctly the majority of experimentally relevant errors.

arXiv:2107.10386•Physical Review Research•Aug 29, 2022•12 citations

Quantum computing via measurements only

Robert Raussendorf, Hans J. Briegel

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

arXiv:quant-ph/0010033•Oct 7, 2000•117 citations

Surprises in fault tolerance and cluster dynamics for quantum computing

Gerald N. Gilbert, Yaakov S. Weinstein

We explore basic necessary protocols to achieve fault tolerance for quantum computation in the cluster state and circuit models. For the cluster state model we simulate the implementation of an arbitrary rotation via only measurement on a decohered cluster state. Fidelity is used to quantify the accuracy of the initial cluster state and a gate fidelity for the arbitrary rotation is determined. In the circuit model we compare the accuracy of two methods that can be used to construct a logical zero state appropriate for the [7, 1, 3] Steane quantum error correction code in a non-equiprobable Pauli operator error environment: a fault tolerant method done by applying error correction on seven qubits all in the state zero, and a non-fault tolerant method done by implementing the encoding gate sequence. We find that the latter construction method, in spite of its lack of "fault tolerance," outputs a seven qubit state with a higher fidelity than the first (fault tolerant) method. However, the fidelity of the single qubit of stored information exhibits almost equivalent values between the two construction methods.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 9, 2012•0 citations

Measurements in quantum topological phases of matter and quantum computing

Gabrielle Tournaire

Quantum measurements often destroy the “quantumness” of a state. Combining measurements and entanglement, however, unlocks new opportunities in quantum computing, as it transcends the boundaries between quantum phases. Measurement-based quantum computation is a perfect example: from an array of locally entangled qubits, individual measurements teleport and modify some logical information. Since quantum operations are prone to errors, this information is encoded in the topological Toric code, thus enabling fault-tolerant computation. Since the Toric code has a 2-dimensional structure, the resource state needed to perform measurement-based quantum computation is necessarily 3-dimensional and is called the 3D cluster state. In this thesis, we provide new tools to enlarge the capabilities of topological measurement-based quantum computation and reduce its operational cost. First, we introduce a lattice defect in the underlying cluster state that improves the expressivity of the computation. Second, we develop general ideas towards circuit compaction and quantify the resources used by the new methods. Furthermore, here, the Toric code is created thanks to local measurements, while it cannot be created with local unitary operations only. We investigate the mathematical roots of this intriguing property, and we show that long-range entanglement arises from locally measuring some general short-range entangled state. Specifically, we assume that the initial short-range entangled state is in a non-trivial symmetry protected topological phase for an abelian group on an infinite spin chain. That is, there is a global operation generated by local unitary operators labeled by the element of the group that leaves the state invariant. On infinite quantum spin chains, these symmetry protected topological phases have been completely characterized. We then perform on-site measurements on increasing intervals of the chain. This creates a sequence of measured states that are eigenstates of the local unitaries associated with elements of a subgroup of the symmetry group. Using the algebraic properties of the initial state, we show that this sequence of measured states has increasing long-range correlations. The entanglement bounds necessarily deteriorate with the size of the measured intervals; thus, the measured states cannot be uniformly short-range entangled.

•Aug 28, 2026•0 citations

Redundant string symmetry-based error correction: Demonstrations on quantum devices

Zhangjie Qin, Daniel Azses, Eran Sela +2 more

Computational power in measurement-based quantum computing stems from the symmetry-protected topological (SPT) order of entangled resource states. However, resource states are prone to preparation errors. We introduce a quantum error correction approach using redundant nonlocal symmetry of the resource state. We demonstrate it within a teleportation protocol based on extending the ${\mathbb{Z}}_{2}\ifmmode\times\else\texttimes\fi{}{\mathbb{Z}}_{2}$ symmetry of one-dimensional cluster states to other graph states. Qubit ZZ-crosstalk errors, which are prominent in quantum devices, degrade the teleportation fidelity of the usual cluster state. However, as we demonstrate on quantum hardware, once we grow graph states with redundant symmetry, perfect teleportation fidelity is restored. We identify the underlying redundant-SPT order as error-protected degeneracies in the entanglement spectrum.

arXiv:2310.12854•Physical Review A•Jul 31, 2024•3 citations

Photon-loss effects on the efficiency of quantum linear-optical gates and cluster states

Lucas Reyes, André Fonseca de Oliveira, Efrain Buksman +1 more

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.

International Journal of Quantum Information•Nov 20, 2025•0 citations
Measurement-based quantum computing is an alternative paradigm to the circuit-based model. This approach can be advantageous in certain scenarios, such as when read-out is fast and accurate, but two-qubit gates realized via inter-particle interactions are slow and can be parallelized to efficiently create a cluster state. However, understanding how two-qubit errors impact algorithm accuracy and developing experimentally viable approaches to characterize cluster-state fidelity are outstanding challenges. Here, we consider one-dimensional cluster states built from controlled phase, Ising, and XY interactions with slow two-qubit error in the interaction strength, consistent with error models of interactions found in a variety of qubit architectures. We detail an experimentally viable teleportation fidelity that offers a measure of the impact of these errors on the cluster state. Our fidelity calculations show that the error has a distinctly different impact depending on the underlying interaction used for the two-qubit entangling gate. In particular, the Ising and XY interactions can allow perfect teleportation through the cluster state even with large errors, but the controlled phase interaction does not. Nonetheless, we find that teleportation through cluster state chains of size NNN has a maximum two-qubit error for teleportation along a quantum channel that decreases as N\ensuremath−1/2{N}^{\ensuremath{-}1/2}N\ensuremath−1/2. To enable the construction of larger cluster states, we design lowest-order refocusing pulses for correcting these slow errors in the interaction strength. Our work generalizes to higher-dimensional cluster states and sets the stage for experiments to monitor the growth of entanglement in cluster states built from error-prone interactions.
The size of the Hilbert space for a multiqubit state scales exponentially with the number of constituent qubits. Often this leads to a similar exponential scaling of the experimental resources required to characterize the state. Contrary to this, we propose a physically motivated method for experimentally assessing the fidelity of an important class of entangled states known as cluster states. The proposed method always yields a lower bound of the fidelity with a number of measurement settings scaling only linearly with the system size, and is tailored to correctly account for the errors most likely to occur in experiments. For one-dimensional cluster states, the constructed fidelity measure is tight to lowest order in the error probability for experimentally realistic noise sources and thus closely matches the true fidelity. Furthermore, it is tight for the majority of higher-order errors, except for a small subset of certain nonlocal multiqubit errors irrelevant in typical experimental situations. The scheme also performs very well for higher-dimensional cluster states, assessing correctly the majority of experimentally relevant errors.
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.
We explore basic necessary protocols to achieve fault tolerance for quantum computation in the cluster state and circuit models. For the cluster state model we simulate the implementation of an arbitrary rotation via only measurement on a decohered cluster state. Fidelity is used to quantify the accuracy of the initial cluster state and a gate fidelity for the arbitrary rotation is determined. In the circuit model we compare the accuracy of two methods that can be used to construct a logical zero state appropriate for the [7, 1, 3] Steane quantum error correction code in a non-equiprobable Pauli operator error environment: a fault tolerant method done by applying error correction on seven qubits all in the state zero, and a non-fault tolerant method done by implementing the encoding gate sequence. We find that the latter construction method, in spite of its lack of "fault tolerance," outputs a seven qubit state with a higher fidelity than the first (fault tolerant) method. However, the fidelity of the single qubit of stored information exhibits almost equivalent values between the two construction methods.
Quantum measurements often destroy the “quantumness” of a state. Combining measurements and entanglement, however, unlocks new opportunities in quantum computing, as it transcends the boundaries between quantum phases. Measurement-based quantum computation is a perfect example: from an array of locally entangled qubits, individual measurements teleport and modify some logical information. Since quantum operations are prone to errors, this information is encoded in the topological Toric code, thus enabling fault-tolerant computation. Since the Toric code has a 2-dimensional structure, the resource state needed to perform measurement-based quantum computation is necessarily 3-dimensional and is called the 3D cluster state. In this thesis, we provide new tools to enlarge the capabilities of topological measurement-based quantum computation and reduce its operational cost. First, we introduce a lattice defect in the underlying cluster state that improves the expressivity of the computation. Second, we develop general ideas towards circuit compaction and quantify the resources used by the new methods. Furthermore, here, the Toric code is created thanks to local measurements, while it cannot be created with local unitary operations only. We investigate the mathematical roots of this intriguing property, and we show that long-range entanglement arises from locally measuring some general short-range entangled state. Specifically, we assume that the initial short-range entangled state is in a non-trivial symmetry protected topological phase for an abelian group on an infinite spin chain. That is, there is a global operation generated by local unitary operators labeled by the element of the group that leaves the state invariant. On infinite quantum spin chains, these symmetry protected topological phases have been completely characterized. We then perform on-site measurements on increasing intervals of the chain. This creates a sequence of measured states that are eigenstates of the local unitaries associated with elements of a subgroup of the symmetry group. Using the algebraic properties of the initial state, we show that this sequence of measured states has increasing long-range correlations. The entanglement bounds necessarily deteriorate with the size of the measured intervals; thus, the measured states cannot be uniformly short-range entangled.
Computational power in measurement-based quantum computing stems from the symmetry-protected topological (SPT) order of entangled resource states. However, resource states are prone to preparation errors. We introduce a quantum error correction approach using redundant nonlocal symmetry of the resource state. We demonstrate it within a teleportation protocol based on extending the ${\mathbb{Z}}_{2}\ifmmode\times\else\texttimes\fi{}{\mathbb{Z}}_{2}$ symmetry of one-dimensional cluster states to other graph states. Qubit ZZ-crosstalk errors, which are prominent in quantum devices, degrade the teleportation fidelity of the usual cluster state. However, as we demonstrate on quantum hardware, once we grow graph states with redundant symmetry, perfect teleportation fidelity is restored. We identify the underlying redundant-SPT order as error-protected degeneracies in the entanglement spectrum.
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.