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

Quantum Information Processing

QGoL: Quantum Game of Life

Daniel Escánez-Expósito, Jorge Garcia-Diaz, Daniel del Castillo, Pino Caballero‐Gil, Eduardo Sáenz‐de‐Cabezón

Published Jan 12, 2026• 1 citation
Publisher

Abstract

This paper proposes a novel probabilistic version of the Game of Life and a quantum model for it. Based on the study and formalisation of the traditional deterministic case, the quantum paradigm is presented as a good candidate for modelling probabilistic behaviour, providing a convenient description of the problem and efficient calculation of the necessary probabilities in an intrinsic way. To illustrate the advantages of quantum computing for this calculation, two implementations are presented: a classical version developed in Rust and a quantum version built using IBM’s Qiskit quantum circuit software. The particularities of this model are presented, its applications are discussed, and optimisations are suggested for the general case, where different neighbourhood sizes and geometries or an increased number of dimensions can be considered. For the particular case of the traditional Game of Life and for all these extended cases, competitive complexity is demonstrated through the quantum paradigm, with respect to the exhaustive classical calculation of probabilities or approximate methods. This allows cases with many dimensions or complex conditions to be executed efficiently.

DOI
10.1007/s11128-025-05022-y

Related papers

Quantum Game of Life

Daniela Bleh, Tommaso Calarco, Simone Montangero

We introduce a quantum version of the Game of Life and we use it to study the emergence of complexity in a quantum world. We show that the quantum evolution displays signatures of complex behaviour similar to the classical one, however a regime exists, where the quantum Game of Life creates more complexity, in terms of diversity, with respect to the corresponding classical reversible one.

arXiv:1010.4666•Europhysics Letters (EPL)•Jan 1, 2012•36 citations

Quantum Games and Programmable Quantum Systems

Edward W. Piotrowski, Jan Sładkowski

Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.

arXiv:quant-ph/0504010•Apr 2, 2005•3 citations

Probabilistic Simulation of Quantum Computing Algorithms using Monte Carlo Methods

Jincheng Zhang

This paper presents a novel approach to simulating quantum computing algorithms using Monte Carlo methods, specifically designed to account for the inherent probabilistic nature of quantum systems. Traditional simulation methods often rely on deterministic models, which fail to capture the fundamental uncertainty associated with quantum mechanics. Our method employs a stochastic simulation engine that accurately models the probabilistic behavior of quantum gates and measurements. The core of the approach involves generating a large number of samples, each representing a possible outcome of a quantum computation. By analyzing the statistical distribution of these samples, we can approximate the expected results of the algorithm. This technique offers a practical way to evaluate the performance of quantum algorithms, especially those with high levels of uncertainty, and provides a valuable tool for algorithm design and optimization. The method avoids the limitations of purely deterministic simulations and offers a more realistic representation of quantum computation. Key aspects include the development of a robust sampling strategy and the efficient calculation of probabilities. The approach is demonstrated through a detailed explanation and illustrative examples, focusing on the conceptual framework and the underlying mathematical principles.

•Sep 5, 2026•0 citations

Ciclo de vida de desarrollo de software cuántico estructurado (QSDLC) para la computación de próxima generación

Fabián Lizardo Caicedo Goyes

Quantum computing promises exponential advantages over classical paradigms; however, it still lacks standardized software engineering methodologies. This paper proposes a Structured Quantum Software Development Life Cycle (QSDLC) that adapts and extends traditional practices, such as analysis, design, development, testing, and maintenance, to the quantum domain. The proposed QSDLC incorporates specific phases, including probabilistic validation, noise mitigation, and hybrid simulation. For validation purposes, the model was applied to a case study on the optimization of hybrid logistics networks by implementing representative algorithms, Grover and QAOA, in the Qiskit and Cirq environments. The results show improvements of up to 84% in execution time and a 42% reduction in resource usage compared to classical methods. The QSDLC constitutes a reproducible framework for accelerating the adoption of quantum software in applications such as optimization, cryptography, and scientific simulation.

Ingenius•Jul 1, 2026•0 citations

Engineering the development of quantum programs: Application to the Boolean satisfiability problem

Diego Alonso, Pedro Sánchez, Francisco Sánchez-Rubio

The development of quantum programs is becoming a reality due to the rapid advancement of quantum computing. Over the past few years, a multitude of hardware platforms, algorithms, and programming languages have emerged to support this paradigm. By the very nature of Quantum Mechanics principles, there is an enormous change of philosophy when building quantum programs, which operate in a probabilistic space, unlike the deterministic behaviour shown by classical programming languages. These conceptual differences can be overcome by using techniques and tools of Software Engineering. In this paper, we apply Model-Driven Engineering techniques in a systematic way to ease the generation of quantum programs and we apply it to solve the satisfiability problem, very important in many engineering domains like verification of discrete systems and test of integrated circuits. To that aim, we contribute with a metamodel for representing quantum circuits and a model-to-text transformation to generate working IBM Qiskit code. This model-driven infrastructure is employed to automatically generate quantum programs from SAT equations through a model-to-model transformation that embeds Grover’s algorithm. Besides, we provide formulas for calculating the number of required quantum elements from SAT equations, crucial in the current context of limited quantum resources. The interoperability with other tools and the extensibility to target additional quantum platforms is guaranteed thanks to the use of a model-based toolchain. We cover several usage scenarios to validate the approach, providing exemplary SAT equations, the generated Qiskit code and the results of executing this code in IBM Quantum infrastructure.

Advances in Engineering Software•Aug 11, 2022•24 citations

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

Marius Nagy, Naya Nagy

We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with respect to a classical one. Our investigation also reveals that the non-determinism and complexity introduced by the principles of quantum mechanics into even the most simple games make brute-force strategies considerably more difficult to implement. Consequently, games in which machines have gained the upper hand over humans may be made fair again by upgrading them to a quantum level.

Applied Mathematics•Jan 1, 2012•4 citations
This paper proposes a novel probabilistic version of the Game of Life and a quantum model for it. Based on the study and formalisation of the traditional deterministic case, the quantum paradigm is presented as a good candidate for modelling probabilistic behaviour, providing a convenient description of the problem and efficient calculation of the necessary probabilities in an intrinsic way. To illustrate the advantages of quantum computing for this calculation, two implementations are presented: a classical version developed in Rust and a quantum version built using IBM’s Qiskit quantum circuit software. The particularities of this model are presented, its applications are discussed, and optimisations are suggested for the general case, where different neighbourhood sizes and geometries or an increased number of dimensions can be considered. For the particular case of the traditional Game of Life and for all these extended cases, competitive complexity is demonstrated through the quantum paradigm, with respect to the exhaustive classical calculation of probabilities or approximate methods. This allows cases with many dimensions or complex conditions to be executed efficiently.
Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over the classical approach. Game theory, the study of decision making in conflict situation has already been extended to the quantum domain. We would like to review the latest development in quantum game theory that is relevant to information processing. We will begin by illustrating the general idea of a quantum game and methods of gaining an advantage over "classical opponent". Then we review the most important game theoretical aspects of quantum information processing. On grounds of the discussed material, we reason about possible future development of quantum game theory and its impact on information processing and the emerging information society. The idea of quantum artificial intelligence is explained.
This paper presents a novel approach to simulating quantum computing algorithms using Monte Carlo methods, specifically designed to account for the inherent probabilistic nature of quantum systems. Traditional simulation methods often rely on deterministic models, which fail to capture the fundamental uncertainty associated with quantum mechanics. Our method employs a stochastic simulation engine that accurately models the probabilistic behavior of quantum gates and measurements. The core of the approach involves generating a large number of samples, each representing a possible outcome of a quantum computation. By analyzing the statistical distribution of these samples, we can approximate the expected results of the algorithm. This technique offers a practical way to evaluate the performance of quantum algorithms, especially those with high levels of uncertainty, and provides a valuable tool for algorithm design and optimization. The method avoids the limitations of purely deterministic simulations and offers a more realistic representation of quantum computation. Key aspects include the development of a robust sampling strategy and the efficient calculation of probabilities. The approach is demonstrated through a detailed explanation and illustrative examples, focusing on the conceptual framework and the underlying mathematical principles.
Quantum computing promises exponential advantages over classical paradigms; however, it still lacks standardized software engineering methodologies. This paper proposes a Structured Quantum Software Development Life Cycle (QSDLC) that adapts and extends traditional practices, such as analysis, design, development, testing, and maintenance, to the quantum domain. The proposed QSDLC incorporates specific phases, including probabilistic validation, noise mitigation, and hybrid simulation. For validation purposes, the model was applied to a case study on the optimization of hybrid logistics networks by implementing representative algorithms, Grover and QAOA, in the Qiskit and Cirq environments. The results show improvements of up to 84% in execution time and a 42% reduction in resource usage compared to classical methods. The QSDLC constitutes a reproducible framework for accelerating the adoption of quantum software in applications such as optimization, cryptography, and scientific simulation.
The development of quantum programs is becoming a reality due to the rapid advancement of quantum computing. Over the past few years, a multitude of hardware platforms, algorithms, and programming languages have emerged to support this paradigm. By the very nature of Quantum Mechanics principles, there is an enormous change of philosophy when building quantum programs, which operate in a probabilistic space, unlike the deterministic behaviour shown by classical programming languages. These conceptual differences can be overcome by using techniques and tools of Software Engineering. In this paper, we apply Model-Driven Engineering techniques in a systematic way to ease the generation of quantum programs and we apply it to solve the satisfiability problem, very important in many engineering domains like verification of discrete systems and test of integrated circuits. To that aim, we contribute with a metamodel for representing quantum circuits and a model-to-text transformation to generate working IBM Qiskit code. This model-driven infrastructure is employed to automatically generate quantum programs from SAT equations through a model-to-model transformation that embeds Grover’s algorithm. Besides, we provide formulas for calculating the number of required quantum elements from SAT equations, crucial in the current context of limited quantum resources. The interoperability with other tools and the extensibility to target additional quantum platforms is guaranteed thanks to the use of a model-based toolchain. We cover several usage scenarios to validate the approach, providing exemplary SAT equations, the generated Qiskit code and the results of executing this code in IBM Quantum infrastructure.
We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with respect to a classical one. Our investigation also reveals that the non-determinism and complexity introduced by the principles of quantum mechanics into even the most simple games make brute-force strategies considerably more difficult to implement. Consequently, games in which machines have gained the upper hand over humans may be made fair again by upgrading them to a quantum level.