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:1604.05659 · Microprocessors and Microsystems

One-way quantum computer simulation

Eesa Nikahd, Mahboobeh Houshmand, Morteza Saheb Zamani, Mehdi Sedighi

Published Mar 11, 2015• 9 citations
arXivHTMLPDF
DOI
10.1016/j.micpro.2015.02.007

Related papers

GOWQS: Graph-based one-way quantum computation simulator

Eesa Nikahd, Mahboobeh Houshmand, Morteza Saheb Zamani +1 more

In the one-way quantum computation (1WQC) model, computations are done by correlated sequences of entanglement, measurement and local corrections commands. As scalable and reliable quantum computers have not been implemented yet, the only widely available tools for designing and testing quantum algorithms are quantum computation simulators. However, simulating quantum computations on a standard classical computer in most cases requires very large memory and time. Recently, an array-based simulator, called one-way quantum computation simulator (OWQS) has been proposed to directly simulate the 1WQC model. OWQS outperforms the previously proposed quantum computation simulators to simulate the 1WQC model. In this paper, OWQS is modified in a way that it utilizes the graph-based representation of system states using algebraic decision diagram (ADD) in order to benefit from the similarities in the quantum states of 1WQC. This simulator is called graph-based OWQS, GOWQS. Experimental results validate the considerable improvement of the proposed simulator as compared to OWQS.

Iranian Conference on Electrical Engineering•May 1, 2016•1 citation

One-way quantum computer

Noriaki Horiuchi

Nature Photonics•Dec 23, 2014•3 citations

Computational model underlying the one-way quantum computer

Robert Raussendorf, Hans J. Briegel

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. {\bf{86}}, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.

arXiv:quant-ph/0108067•Quantum Information and Computation•Oct 1, 2002•133 citations

Quantum Computer Simulation

Kluwer Academic Publishers eBooks•Jan 14, 2006•1 citation

OWQS: One-Way Quantum Computation Simulator

Eesa Nikahd, Mahboobeh Houshmand, Morteza Saheb Zamani +1 more

In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of basis for these measurements as well as the structure of the entanglements specify a quantum algorithm. Although a number of methods have been proposed to simulate quantum circuit model on classical computers, no efficient tool has been developed to simulate the 1WQC model directly. In this paper, some techniques such as qubit elimination, implicit and in-place matrix-vector multiplication and pattern reordering are utilized to considerably reduce the time and memory needed for the simulations. These techniques were implemented in a tool called One-Way Quantum computation Simulator (OWQS). Experimental results validate the efficiency of the proposed approach.

Euromicro Conference on Digital System Design (DSD)•Sep 1, 2012•2 citations

One-Way Quantum Computer

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•1 citation
In the one-way quantum computation (1WQC) model, computations are done by correlated sequences of entanglement, measurement and local corrections commands. As scalable and reliable quantum computers have not been implemented yet, the only widely available tools for designing and testing quantum algorithms are quantum computation simulators. However, simulating quantum computations on a standard classical computer in most cases requires very large memory and time. Recently, an array-based simulator, called one-way quantum computation simulator (OWQS) has been proposed to directly simulate the 1WQC model. OWQS outperforms the previously proposed quantum computation simulators to simulate the 1WQC model. In this paper, OWQS is modified in a way that it utilizes the graph-based representation of system states using algebraic decision diagram (ADD) in order to benefit from the similarities in the quantum states of 1WQC. This simulator is called graph-based OWQS, GOWQS. Experimental results validate the considerable improvement of the proposed simulator as compared to OWQS.
In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. {\bf{86}}, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of basis for these measurements as well as the structure of the entanglements specify a quantum algorithm. Although a number of methods have been proposed to simulate quantum circuit model on classical computers, no efficient tool has been developed to simulate the 1WQC model directly. In this paper, some techniques such as qubit elimination, implicit and in-place matrix-vector multiplication and pattern reordering are utilized to considerably reduce the time and memory needed for the simulations. These techniques were implemented in a tool called One-Way Quantum computation Simulator (OWQS). Experimental results validate the efficiency of the proposed approach.