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:1201.4894 · Physical Review A

Exact dynamics of single-qubit-gate fidelities under the measurement-based quantum computation scheme

L. G. E. Arruda, F. F. Fanchini, Reginaldo de Jesus Napolitano, José Eduardo Martinho Hornos, A. O. Caldeira

Published Oct 19, 2012• 2 citations
arXivHTMLPDF

Abstract

Measurement-based quantum computation is an efficient model to perform universal computation. Nevertheless, theoretical questions have been raised, mainly with respect to realistic noise conditions. In order to shed some light on this issue, we evaluate the exact dynamics of some single-qubit-gate fidelities using the measurement-based quantum computation scheme when the qubits which are used as a resource interact with a common dephasing environment. We report a necessary condition for the fidelity dynamics of a general pure $N$-qubit state, interacting with this type of error channel, to present an oscillatory behavior, and we show that for the initial canonical cluster state, the fidelity oscillates as a function of time. This state fidelity oscillatory behavior brings significant variations to the values of the computational results of a generic gate acting on that state depending on the instants we choose to apply our set of projective measurements. As we shall see, considering some specific gates that are frequently found in the literature, the fast application of the set of projective measurements does not necessarily imply high gate fidelity, and likewise the slow application thereof does not necessarily imply low gate fidelity. Our condition for the occurrence of the fidelity oscillatory behavior shows that the oscillation presented by the cluster state is due exclusively to its initial geometry. Other states that can be used as resources for measurement-based quantum computation can present the same initial geometrical condition. Therefore, it is very important for the present scheme to know when the fidelity of a particular resource state will oscillate in time and, if this is the case, what are the best times to perform the measurements.

DOI
10.1103/physreva.86.042326

Related papers

Non-Markovian memory in a measurement-based quantum computer

Daví Filenga, Felipe Rodrigues Perche Mahlow, F. F. Fanchini

We study the exact open system dynamics of one- and two-qubit gates during a measurement-based quantum computation considering non-Markovian environments. We obtain analytical solutions for the average gate fidelities and analyze them for amplitude damping and phase damping channels. We show, for both channels, that the average fidelity is identical for the $X$ gate and $Z$ gate and very similar for the $\ensuremath{\pi}/4$ gate when considering the amplitude damping channel. Also, we show that fast application of the projective measurements does not necessarily imply high gate fidelity nor does slow application necessarily imply low gate fidelity. Indeed, for highly non-Markovian environments, it is of utmost importance to know the best time to perform the measurements, since a huge variation in the gate fidelity may occur given this scenario. Furthermore, we show that whereas for amplitude damping the knowledge of the dissipative map is sufficient to determine the best measurement times, i.e., the best times at which measures are taken, the same is not necessarily true for phase damping. For the latter, the time of the set of measures becomes crucial since a phase error in one qubit can fix the phase error that takes place in another. Finally, we show that these peculiar results disappear if all qubits are subjected to Markovian processes.

arXiv:2005.10883•Physical Review A•Oct 27, 2020•5 citations

Fidelity of measurement-based quantum computation in a bosonic environment

Jian Wang, Ding Zhong, Liang-Zhu Mu +1 more

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.

arXiv:1404.1829•Physical Review A•Nov 6, 2014•3 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

Directly estimating the fidelity of measurement-based quantum computation

David T. Stephen, Michael Foss-Feig

In measurement-based quantum computation (MBQC), quantum circuits are implemented using adaptive measurements on an entangled resource state. In practice, the resource state will always be prepared with some noise, and it is crucial to understand the effect of this noise on the operation of MBQC. Typically, one measures the fidelity of the noisy resource state with the assumption that a high fidelity state means a high fidelity computation. However, the precise relationship between these two fidelities is not known. Here, we derive an expression that equates the average fidelity of the MBQC output state to a certain correlation function evaluated on the noisy resource state. Using this expression, we show that state fidelity provides a tight lower bound on average MBQC fidelity. Conversely, we also find that state fidelity can greatly underestimate average MBQC fidelity, implying that state fidelity is not a good indicator of MBQC performance in general. In response, we formulate an efficient method to directly estimate average MBQC fidelity by measuring the aforementioned correlation function. These results therefore improve our ability to characterize noisy resource states in quantum computers and benchmark MBQC performance.

quant-pharXiv:2603.13753•Mar 17, 2026•0 citations

Measurement-based quantum computing with qudit stabilizer states

Alena Romanova, Wolfgang Dür

Abstract We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing standard qubit measurement patterns to the qudit cluster state is suboptimal in most dimensions, so that alternative qudit resource states could enable enhanced computational efficiency. In these resources, the entangling interaction is a block-diagonal Clifford operation rather than the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, we demonstrate for prime-power-dimensional qudits that the complexity of the realization depends linearly both on the dimension and the Pauli order of the intrinsic gate. These insights also allow us to optimize the efficiency of the standard qudit cluster state by effectively mimicking more favorable intrinsic-gate structures, thereby reducing the required measurement depth. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing. As concrete examples, we present multiple alternative resource states. In certain dimensions, we show the existence of resource states achieving optimal intrinsic gates, enabling more efficient measurement-based quantum information processing than the qudit cluster state and highlighting the potential of qudit stabilizer state resources for future quantum computing architectures.

arXiv:2506.20724•Quantum Science and Technology•Jan 21, 2026•1 citation

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
Measurement-based quantum computation is an efficient model to perform universal computation. Nevertheless, theoretical questions have been raised, mainly with respect to realistic noise conditions. In order to shed some light on this issue, we evaluate the exact dynamics of some single-qubit-gate fidelities using the measurement-based quantum computation scheme when the qubits which are used as a resource interact with a common dephasing environment. We report a necessary condition for the fidelity dynamics of a general pure NNN-qubit state, interacting with this type of error channel, to present an oscillatory behavior, and we show that for the initial canonical cluster state, the fidelity oscillates as a function of time. This state fidelity oscillatory behavior brings significant variations to the values of the computational results of a generic gate acting on that state depending on the instants we choose to apply our set of projective measurements. As we shall see, considering some specific gates that are frequently found in the literature, the fast application of the set of projective measurements does not necessarily imply high gate fidelity, and likewise the slow application thereof does not necessarily imply low gate fidelity. Our condition for the occurrence of the fidelity oscillatory behavior shows that the oscillation presented by the cluster state is due exclusively to its initial geometry. Other states that can be used as resources for measurement-based quantum computation can present the same initial geometrical condition. Therefore, it is very important for the present scheme to know when the fidelity of a particular resource state will oscillate in time and, if this is the case, what are the best times to perform the measurements.
We study the exact open system dynamics of one- and two-qubit gates during a measurement-based quantum computation considering non-Markovian environments. We obtain analytical solutions for the average gate fidelities and analyze them for amplitude damping and phase damping channels. We show, for both channels, that the average fidelity is identical for the XXX gate and ZZZ gate and very similar for the $\ensuremath{\pi}/4$ gate when considering the amplitude damping channel. Also, we show that fast application of the projective measurements does not necessarily imply high gate fidelity nor does slow application necessarily imply low gate fidelity. Indeed, for highly non-Markovian environments, it is of utmost importance to know the best time to perform the measurements, since a huge variation in the gate fidelity may occur given this scenario. Furthermore, we show that whereas for amplitude damping the knowledge of the dissipative map is sufficient to determine the best measurement times, i.e., the best times at which measures are taken, the same is not necessarily true for phase damping. For the latter, the time of the set of measures becomes crucial since a phase error in one qubit can fix the phase error that takes place in another. Finally, we show that these peculiar results disappear if all qubits are subjected to Markovian processes.
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.
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.
In measurement-based quantum computation (MBQC), quantum circuits are implemented using adaptive measurements on an entangled resource state. In practice, the resource state will always be prepared with some noise, and it is crucial to understand the effect of this noise on the operation of MBQC. Typically, one measures the fidelity of the noisy resource state with the assumption that a high fidelity state means a high fidelity computation. However, the precise relationship between these two fidelities is not known. Here, we derive an expression that equates the average fidelity of the MBQC output state to a certain correlation function evaluated on the noisy resource state. Using this expression, we show that state fidelity provides a tight lower bound on average MBQC fidelity. Conversely, we also find that state fidelity can greatly underestimate average MBQC fidelity, implying that state fidelity is not a good indicator of MBQC performance in general. In response, we formulate an efficient method to directly estimate average MBQC fidelity by measuring the aforementioned correlation function. These results therefore improve our ability to characterize noisy resource states in quantum computers and benchmark MBQC performance.
Abstract We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing standard qubit measurement patterns to the qudit cluster state is suboptimal in most dimensions, so that alternative qudit resource states could enable enhanced computational efficiency. In these resources, the entangling interaction is a block-diagonal Clifford operation rather than the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, we demonstrate for prime-power-dimensional qudits that the complexity of the realization depends linearly both on the dimension and the Pauli order of the intrinsic gate. These insights also allow us to optimize the efficiency of the standard qudit cluster state by effectively mimicking more favorable intrinsic-gate structures, thereby reducing the required measurement depth. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing. As concrete examples, we present multiple alternative resource states. In certain dimensions, we show the existence of resource states achieving optimal intrinsic gates, enabling more efficient measurement-based quantum information processing than the qudit cluster state and highlighting the potential of qudit stabilizer state resources for future quantum computing architectures.
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.