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:0909.5533 · IEICE Transactions on Information and Systems

A Simple Procedure for Classical Signal-Processing in Cluster-State Quantum Computation

Kazuto Oshima

Published Jan 1, 2010• 0 citations
arXivHTMLPDF

Abstract

We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in performing cluster-state computation.
DOI
10.1587/transinf.e93.d.1291

Related papers

Classical signal-flow in cluster-state quantum computation

Kazuto Oshima

We study concretely how classical signals should be processed in quantum cluster-state computation. Deforming corresponding quantum teleportation circuit, we find a simple rule of a classical signal-flow to obtain correct quantum computation results.

arXiv:0906.2454•Jun 13, 2009•0 citations

Cluster State Quantum Computing

David McMahon

This chapter contains sections titled: Cluster States Adjacency Matrices Stabilizer States Aside: Entanglement Witness Cluster State Processing Exercises

Wiley eBooks•Mar 23, 2007•2 citations

Constructing Clusters for Quantum Computing

Kuldeep Singh Kaswan, Jagjit Singh Dhatterwal, Anupam Baliyan +1 more

In the cluster-state quantum computing concept, the processing is done without requiring quantum gates. Cluster states are multiqubit states that undergo a sequence of measurements to be processed. The cluster state model may simulate or perform quantum computing since quantum gates are built using unitary operators. Cluster state preparations begin with the creation of a product stage. Graphs, a collection of connected components, are used to represent cluster states. A numerical solution is a matrix-based representation of a graph. Matrix elements are either one or zero, depending on whether or not an edge connects the points symbolized by a specific row or column entry. A stabilizer is a simple operation that has an eigenvalue of 1. This shows that the identification of operators is a stabilizing factor, as it is the only one on the list.

Wiley eBooks•Jul 14, 2023•0 citations

Efficient Classical Simulation of Quantum Circuits beyond the Stabilizer Formalism

Patrick Rall, James E. Troupe

Bulletin of the American Physical Society•Mar 7, 2018•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•6 citations

Cluster-state quantum computation

Michael A. Nielsen

arXiv:quant-ph/0504097•Reports on Mathematical Physics•Feb 1, 2006•457 citations
In the cluster-state quantum computing concept, the processing is done without requiring quantum gates. Cluster states are multiqubit states that undergo a sequence of measurements to be processed. The cluster state model may simulate or perform quantum computing since quantum gates are built using unitary operators. Cluster state preparations begin with the creation of a product stage. Graphs, a collection of connected components, are used to represent cluster states. A numerical solution is a matrix-based representation of a graph. Matrix elements are either one or zero, depending on whether or not an edge connects the points symbolized by a specific row or column entry. A stabilizer is a simple operation that has an eigenvalue of 1. This shows that the identification of operators is a stabilizing factor, as it is the only one on the list.
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.