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

Bulletin of the American Physical Society

Simulating the t-J Model on a Quantum Computer

Brian Rost, James K. Freericks

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

Quantum simulation of the t–J model

Fumiko Yamaguchi, Y. Yamamoto

Superlattices and Microstructures•Oct 1, 2002•4 citations

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

Quantum Monte Carlo simulations of one hole in the t-J model

Michael Brunner, A. Muramatsu

Springer eBooks•Jan 1, 1999•0 citations

Classical simulation complexity of restricted models of quantum computation

Dax Enshan Koh

Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.

•Jan 1, 2019•0 citations

Simulation on a quantum computer

Rüdiger Schack

Informatik - Forschung und Entwicklung•Sep 15, 2006•4 citations

Non-Probabilistic Termination of Measurement-based Quantum Computation

Philippe Jorrand, Simon Perdrix

Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of simulations. This means that the time when simulation terminates for a given computation is probabilistic, and this simulation may even never end. We introduce (section 3) a measurement-based model with non probabilistic termination, which permits, unlike existing models, to predict the time of termination. This new scheme is a modification of Nielsen's. After an introduction to Nielsen's scheme (section 1), an analysis of different temporal organisations of elementary simulations within Nielsen's scheme (section 2) leads to the non probabilistic model.

arXiv:quant-ph/0311142•Nov 20, 2003•4 citations
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.
Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.
Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of simulations. This means that the time when simulation terminates for a given computation is probabilistic, and this simulation may even never end. We introduce (section 3) a measurement-based model with non probabilistic termination, which permits, unlike existing models, to predict the time of termination. This new scheme is a modification of Nielsen's. After an introduction to Nielsen's scheme (section 1), an analysis of different temporal organisations of elementary simulations within Nielsen's scheme (section 2) leads to the non probabilistic model.