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 Letters

One-Way Quantum Computation with Cluster State and Probabilistic Gate

Da-Sheng Diao

Published Jan 1, 2013• 2 citations
Publisher

Abstract

We present a scheme for efficiently constructing a two-dimensional cluster state, which serves as the central physical resource for one-way quantum computation. In this scheme, we successfully make the required computational overhead scale efficiently with the qubit number by using a probabilistic entangling quantum gate.
DOI
10.1088/0256-307x/30/1/010303

Related papers

Efficient Construction of High-Dimensional Cluster State

Diao Da-Sheng, Zhang Yong-Sheng, Xiang-Fa Zhou +1 more

We present a scheme for efficiently constructing high-dimensional cluster state using probabilistic entangling quantum gates. It is shown that the required computational overhead scales efficiently both with 1/p and n even if all the entangling quantum gates only succeed with an arbitrary small probability, where p is the success probability of the entangling quantum gate and n is the number of qubits in the computation.

Chinese Physics Letters•Oct 1, 2008•6 citations

Efficient construction of two-dimensional cluster states with probabilistic quantum gates

Qing Chen, Jianhua Cheng, Ke-Lin Wang +1 more

We propose an efficient scheme for constructing arbitrary two-dimensional (2D) cluster states using probabilistic entangling quantum gates. In our scheme, the 2D cluster state is constructed with starlike basic units generated from 1D cluster chains. By applying parallel operations, the process of generating 2D (or higher-dimensional) cluster states is significantly accelerated, which provides an efficient way to implement realistic one-way quantum computers.

arXiv:quant-ph/0507066•Physical Review A•Jan 9, 2006•37 citations

Efficient Quantum Computation with Probabilistic Quantum Gates

Luming Duan, Robert Raussendorf

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.

arXiv:quant-ph/0502120•Physical Review Letters•Aug 17, 2005•185 citations

Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates

Keisuke Fujii, Yuuki Tokunaga

We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the unheralded error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.

arXiv:1008.3752•Physical Review Letters•Dec 14, 2010•47 citations

One-Way Quantum Computation with Two-Photon Multiqubit Cluster States

Giuseppe Vallone, A. Rossi, F. De Martini +1 more

We demonstrate one-way quantum computation by using cluster states of two photons and four-qubits. General single qubit rotations, either probabilistic or deterministic, and efficient C-NOT and C-Phase gates have been realized by this technique.

International Conference on Quantum Information•Jan 1, 2008•3 citations

Time-Domain Multiplexed Two-Dimensional Cluster State for Large-Scale Universal Multi-Input One-Way Quantum Computation

Warit Asavanant, Hidehiro Yonezawa, Akira Furusawa +8 more

One-way quantum computation is a promising scheme for realizing large-scale quantum computation, where computation is done via measurements on a universal multi-mode entangled resource called cluster state. The capability of this method is determined by the size and the dimension of the cluster state; the size is roughly equivalent to the number of input modes times number of operation steps, while the dimension determines universality and fault tolerance of the computation. To achieve universality, two-dimensional cluster state is required. Among many approaches, time-domain multiplexing using optical system [1, 2] is a promising method where quantum state is encoded in a temporal wave packet. Although universality is still lacking, one-million-mode one-dimensional cluster state has been demonstrated with this approach [3].

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2019•0 citations
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the unheralded error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.
One-way quantum computation is a promising scheme for realizing large-scale quantum computation, where computation is done via measurements on a universal multi-mode entangled resource called cluster state. The capability of this method is determined by the size and the dimension of the cluster state; the size is roughly equivalent to the number of input modes times number of operation steps, while the dimension determines universality and fault tolerance of the computation. To achieve universality, two-dimensional cluster state is required. Among many approaches, time-domain multiplexing using optical system [1, 2] is a promising method where quantum state is encoded in a temporal wave packet. Although universality is still lacking, one-million-mode one-dimensional cluster state has been demonstrated with this approach [3].