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

Wiley eBooks

Constructing Clusters for Quantum Computing

Kuldeep Singh Kaswan, Jagjit Singh Dhatterwal, Anupam Baliyan, Shalli Rani

Published Jul 14, 2023• 0 citations
Publisher

Abstract

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.

DOI
10.1002/9781394157846.ch10

Related papers

Using the qubus for quantum computing

Katherine Louise Brown

In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matter qubits. I concentrate on using the qubus for two purposes - quantum simulation, and generating cluster states. Quantum simulation is the idea of using a quantum computer to simulate a quantum system. I focus on conducting a simulation of the BCS Hamiltonian. I demonstrate how to perform the necessary two qubit operations in a controlled fashion using the qubus. In particular I demonstrate an O(N3) saving over an implementation on an NMR computer, and a factor of 2 saving over a naıve technique. I also discuss how to perform the quantum Fourier transform on the qubus quantum computer. I show that it is possible to perform the quantum Fourier transform using just, 24⌊N/2⌋ + 7N − 6, this is an O(N) saving over a naıve method. In the second part of the thesis, I move on, and consider generating cluster states using the qubus. A cluster state, is a universal resource for one-way or measurement-based computation. In one-way computation, the pre-generated, entangled resource is used to perform calculations, which only require local corrections and measurement. I demonstrate that the qubus can generate cluster states deterministically, and in a relatively short time. I discuss several techniques of cluster state generation, one of which is optimal, given the physical architecture we are using. This can generate an n × m cluster in only 3nm − 2n − 2m + 4 operations. The alternative techniques look at generating a cluster using layers or columns, allowing it to be built dynamically, while the cluster is used to perform calculations. I then move on, and discuss problems with error accumulation in the generation process.

•Apr 1, 2011•7 citations

Realization and characterization of a 2-photon 4-qubit linear cluster state

Giuseppe Vallone, Enrico Pomarico, Paolo Mataloni +2 more

Cluster states, recently introduced as a fundamental resource for one-way quantum computation, represent genuine multiqubits entangled states. The one-way model is based on the initial preparation of entangled qubits in the cluster state, followed by single qubits measurements and feed-forwards. All the difficulties present in the standard computation model, for instance the implementation of two qubits gates, are transferred in the one-way model to the state preparation.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2007•1 citation

Analogs of quantum matrix groups from finite measurement resolution?

Matti Pitkänen

The notion of quantum group replaces ordinary matrices with matrices with non-commutative elements. In TGD framework I have proposed that the notion should relate to the inclusions of von Neumann algebras allowing one to describe mathematically the notion of finite measurement resolution. In this article I will consider the notion of quantum matrix inspired by the recent view about quantum TGD relying on the notion of finite measurement resolution. Complex matrix elements are replaced with operators expressible as products of non-negative Hermitian operators and unitary operators analogous to the products of modulus and phase as a representation for complex numbers. The condition that determinant and sub-determinants exist is crucial for the well-defined eigenvalue problem in the generalized sense.  Strong/weak permutation symmetry of determinant requires its invariance under permutations of rows and/or columns. Weak permutation symmetry means development of determinant with respect to a fixed row or column and does not pose additional conditions. For weak permutation symmetry the permutation of rows/columns would however has a natural interpretation as braiding for the Hermitian operators defined by the moduli of operator valued matrix elements and here quantum group structure emerges. The commutativity of all sub-determinants is essential for the replacement of eigenvalues with eigenvalue spectra of Hermitian operators and sub-determinants define mutually commuting set of operators. Quantum matrices define a more general structure than quantum group but provide a concrete representation and interpretation for quantum group  in terms of finite measurement resolution, in particular when q is a root of unity. One can also understand the fractal structure of inclusion sequences of hyper-finite factors resulting by replacing operators appearing as matrix elements with quantum matrices.

•Jan 1, 2015•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

Error matrices in quantum process tomography

Alexander N. Korotkov

We discuss characterization of experimental quantum gates by the error matrix, which is similar to the standard process matrix $χ$ in the Pauli basis, except the desired unitary operation is factored out, by formally placing it either before or after the error process. The error matrix has only one large element, which is equal to the process fidelity, while other elements are small and indicate imperfections. The imaginary parts of the elements along the left column and/or top row directly indicate the unitary imperfection and can be used to find the needed correction. We discuss a relatively simple way to calculate the error matrix for a composition of quantum gates. Similarly, it is rather straightforward to find the first-order contribution to the error matrix due to the Lindblad-form decoherence. We also discuss a way to identify and subtract the tomography procedure errors due to imperfect state preparation and measurement. In appendices we consider several simple examples of the process tomography and also discuss an intuitive physical interpretation of the Lindblad-form decoherence.

arXiv:1309.6405•Sep 25, 2013•39 citations

Generating large-scale cluster states

Ian S. Osborne

Quantum Computing The development of a practical quantum computer requires universality, scalability, and fault tolerance. Although much progress is being made in circuit platforms in which arrays of qubits are addressed and manipulated individually, scale-up of such systems is experimentally challenging. Asavanant et al. and Larsen et al. explore an alternative route: measurement-based quantum computation, which is a platform based on the generation of large-scale cluster states. As these are optically prepared and easier to handle (one simply performs local measurements on each individual component of the cluster state), such a platform is readily scalable and fault tolerant. The topology of the cluster state ensures that the approach meets the requirements for quantum computation. Science , this issue p. [373][1], p. [369][2] [1]: /lookup/doi/10.1126/science.aay2645 [2]: /lookup/doi/10.1126/science.aay4354

Science•Oct 17, 2019•0 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.
In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matter qubits. I concentrate on using the qubus for two purposes - quantum simulation, and generating cluster states. Quantum simulation is the idea of using a quantum computer to simulate a quantum system. I focus on conducting a simulation of the BCS Hamiltonian. I demonstrate how to perform the necessary two qubit operations in a controlled fashion using the qubus. In particular I demonstrate an O(N3) saving over an implementation on an NMR computer, and a factor of 2 saving over a naıve technique. I also discuss how to perform the quantum Fourier transform on the qubus quantum computer. I show that it is possible to perform the quantum Fourier transform using just, 24⌊N/2⌋ + 7N − 6, this is an O(N) saving over a naıve method. In the second part of the thesis, I move on, and consider generating cluster states using the qubus. A cluster state, is a universal resource for one-way or measurement-based computation. In one-way computation, the pre-generated, entangled resource is used to perform calculations, which only require local corrections and measurement. I demonstrate that the qubus can generate cluster states deterministically, and in a relatively short time. I discuss several techniques of cluster state generation, one of which is optimal, given the physical architecture we are using. This can generate an n × m cluster in only 3nm − 2n − 2m + 4 operations. The alternative techniques look at generating a cluster using layers or columns, allowing it to be built dynamically, while the cluster is used to perform calculations. I then move on, and discuss problems with error accumulation in the generation process.
The notion of quantum group replaces ordinary matrices with matrices with non-commutative elements. In TGD framework I have proposed that the notion should relate to the inclusions of von Neumann algebras allowing one to describe mathematically the notion of finite measurement resolution. In this article I will consider the notion of quantum matrix inspired by the recent view about quantum TGD relying on the notion of finite measurement resolution. Complex matrix elements are replaced with operators expressible as products of non-negative Hermitian operators and unitary operators analogous to the products of modulus and phase as a representation for complex numbers. The condition that determinant and sub-determinants exist is crucial for the well-defined eigenvalue problem in the generalized sense.  Strong/weak permutation symmetry of determinant requires its invariance under permutations of rows and/or columns. Weak permutation symmetry means development of determinant with respect to a fixed row or column and does not pose additional conditions. For weak permutation symmetry the permutation of rows/columns would however has a natural interpretation as braiding for the Hermitian operators defined by the moduli of operator valued matrix elements and here quantum group structure emerges. The commutativity of all sub-determinants is essential for the replacement of eigenvalues with eigenvalue spectra of Hermitian operators and sub-determinants define mutually commuting set of operators. Quantum matrices define a more general structure than quantum group but provide a concrete representation and interpretation for quantum group  in terms of finite measurement resolution, in particular when q is a root of unity. One can also understand the fractal structure of inclusion sequences of hyper-finite factors resulting by replacing operators appearing as matrix elements with quantum matrices.
We discuss characterization of experimental quantum gates by the error matrix, which is similar to the standard process matrix χχχ in the Pauli basis, except the desired unitary operation is factored out, by formally placing it either before or after the error process. The error matrix has only one large element, which is equal to the process fidelity, while other elements are small and indicate imperfections. The imaginary parts of the elements along the left column and/or top row directly indicate the unitary imperfection and can be used to find the needed correction. We discuss a relatively simple way to calculate the error matrix for a composition of quantum gates. Similarly, it is rather straightforward to find the first-order contribution to the error matrix due to the Lindblad-form decoherence. We also discuss a way to identify and subtract the tomography procedure errors due to imperfect state preparation and measurement. In appendices we consider several simple examples of the process tomography and also discuss an intuitive physical interpretation of the Lindblad-form decoherence.
Quantum Computing The development of a practical quantum computer requires universality, scalability, and fault tolerance. Although much progress is being made in circuit platforms in which arrays of qubits are addressed and manipulated individually, scale-up of such systems is experimentally challenging. Asavanant et al. and Larsen et al. explore an alternative route: measurement-based quantum computation, which is a platform based on the generation of large-scale cluster states. As these are optically prepared and easier to handle (one simply performs local measurements on each individual component of the cluster state), such a platform is readily scalable and fault tolerant. The topology of the cluster state ensures that the approach meets the requirements for quantum computation. Science , this issue p. [373][1], p. [369][2] [1]: /lookup/doi/10.1126/science.aay2645 [2]: /lookup/doi/10.1126/science.aay4354