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:0906.2454

Classical signal-flow in cluster-state quantum computation

Kazuto Oshima

Published Jun 13, 2009• 0 citations
arXivHTMLPDF

Abstract

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.
DOI
10.48550/arxiv.0906.2454

Related papers

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

Kazuto Oshima

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.

arXiv:0909.5533•IEICE Transactions on Information and Systems•Jan 1, 2010•0 citations

Measurement-Based Quantum Computing as a Tangram Puzzle

Ashlesha Patil, Yosef P. Jacobson, Don Towsley +1 more

Measurement-Based Quantum Computing (MBQC), proposed in 2001 is a model of quantum computing that achieves quantum computation by performing a series of adaptive single-qubit measurements on an entangled cluster state. Our project is aimed at introducing MBQC to a wide audience ranging from high school students to quantum computing researchers through a Tangram puzzle with a modified set of rules played on an applet. The player is provided a quantum circuit which they have to map to MBQC using polyominos. Polyominos, the building blocks of our game, consist of square tiles joined edge-to-edge to form different shapes. Each tile represents a measurement basis, differentiated by its color. Polyominos rest on a square-grid playing board, which signifies a cluster state. We show that mapping a quantum circuit to MBQC is equivalent to arranging a set of polyominos—each corresponding to a gate in the circuit—on the playing board, subject to certain rules. We state the rules in simple terms with no reference to quantum computing. One such rule describes ways to deform a polyomino while it still correctly realizes a given quantum gate. The player has to place polyominos on the playing board conforming to the rules. Any correct solution creates a valid realization of the quantum circuit in MBQC. A higher-scoring correct solution fills up less space on the board, resulting in a lower-overhead embedding of the circuit in MBQC, a challenging research problem.

arXiv:2210.11465•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•3 citations

What Exactly Are Quantum Computations? Classical and Quantum Turing Machines

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•2 citations

Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer

Ni-Ni Huang, Wei-Hao Huang, Che‐Ming Li

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.

arXiv:2002.08671•Scientific Reports•Feb 20, 2020•21 citations

Quantum teleportation in terms of creation operators of photons

M V Fedorov, A A Sysoeva

Abstract By using the formalism of photon creation operators, we present the simplest description of the effect of quantum teleportation and describe its closest classical analog.

arXiv:1810.08916•Laser Physics Letters•Nov 27, 2018•3 citations

Quantum Teleportation of Arbitrary Two-qubit State by using a Four-qubit Cluster State

Yin Yi-fe

In order to complete the quantum teleportation,we propose a quantum teleportation scheme of arbitrary twoqubit cluster state by using a four-qubit cluster state based on quantum entanglementphenomenon in this paper. In this scheme,the sender and the receiver share a four-qubit cluster state. The sender first performs a joint von-Neumann measurement on the qubits in his hand. And he sends the measurement results to the receiver through the classical channel. The receiver performs corresponding unitary operation according to the measurement results he received. In the process of this communication,the sender does not tell the original arbitrary two-qubit cluster state to the receiver,but he reconstructs the arbitrary two-qubit state. The quantum teleportation comes true through these processes and the mutual communication is completed.

Journal of Chengdu University of Information Technology•Jan 1, 2015•0 citations
Measurement-Based Quantum Computing (MBQC), proposed in 2001 is a model of quantum computing that achieves quantum computation by performing a series of adaptive single-qubit measurements on an entangled cluster state. Our project is aimed at introducing MBQC to a wide audience ranging from high school students to quantum computing researchers through a Tangram puzzle with a modified set of rules played on an applet. The player is provided a quantum circuit which they have to map to MBQC using polyominos. Polyominos, the building blocks of our game, consist of square tiles joined edge-to-edge to form different shapes. Each tile represents a measurement basis, differentiated by its color. Polyominos rest on a square-grid playing board, which signifies a cluster state. We show that mapping a quantum circuit to MBQC is equivalent to arranging a set of polyominos—each corresponding to a gate in the circuit—on the playing board, subject to certain rules. We state the rules in simple terms with no reference to quantum computing. One such rule describes ways to deform a polyomino while it still correctly realizes a given quantum gate. The player has to place polyominos on the playing board conforming to the rules. Any correct solution creates a valid realization of the quantum circuit in MBQC. A higher-scoring correct solution fills up less space on the board, resulting in a lower-overhead embedding of the circuit in MBQC, a challenging research problem.
Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.
In order to complete the quantum teleportation,we propose a quantum teleportation scheme of arbitrary twoqubit cluster state by using a four-qubit cluster state based on quantum entanglementphenomenon in this paper. In this scheme,the sender and the receiver share a four-qubit cluster state. The sender first performs a joint von-Neumann measurement on the qubits in his hand. And he sends the measurement results to the receiver through the classical channel. The receiver performs corresponding unitary operation according to the measurement results he received. In the process of this communication,the sender does not tell the original arbitrary two-qubit cluster state to the receiver,but he reconstructs the arbitrary two-qubit state. The quantum teleportation comes true through these processes and the mutual communication is completed.