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

Physical Review A

Efficient construction of two-dimensional cluster states with probabilistic quantum gates (5 pages)

K.-L. Wang, Jasper Phua Sing Cheng, Q. Chen

Published Jan 1, 2006• 0 citations
OpenAlex

Related papers

Scheme for Efficient Construction of 2-Dimensional Qutrit Cluster State

Shiwei Shi, You-Min Yi

International Journal of Theoretical Physics•Sep 21, 2009•0 citations

Quantum computation based on d-level cluster state (11 pages)

Di Zhou

Physical Review A•Jan 1, 2003•0 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

Generating Pseudo-Random Quantum States with Cluster Computation

Winton Brown, Yaakov S. Weinstein, Lorenza Viola

Bulletin of the American Physical Society•Mar 11, 2008•0 citations

One-Way Quantum Computation with Cluster State and Probabilistic Gate

Da-Sheng Diao

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.

Chinese Physics Letters•Jan 1, 2013•2 citations

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