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

Classical and Quantum Artificial Life

Asier Izquierdo Lantarón

Published Jan 16, 2020• 0 citations
OpenAlex

Abstract

[EN] We present a gradual transition from classical to quantum artificial life and shallowly prove that minimal Darwinian evolution (reproduction, interaction, aging, etc.) can be achieved on quantum computers, being them the best resource in order to surmount the exponential growth of space and time resources that arise in (here, evolutionary) computing in the quantum framework. Three different classical computing Octave codes have been made during this work.

Related papers

Toward a Framework for Quantum Evolutionary Computation

Donald Sofge

Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers

IEEE Conference on Cybernetics and Intelligent Systems•Jun 1, 2006•8 citations

QALBench: A Tiered Audit Benchmark and Reference Implementation for Quantum Artificial-Life Claims

Gabriel Kahen

Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.

•May 23, 2026•0 citations

Is life quantum Darwinian?

Erkki Brändas, Roman R. Poznański

Advances in quantum chemistry•Jan 1, 2020•3 citations

Exponential separation of quantum and classical online space complexity

François Le Gall

The main objective of quantum computation is to exploit the natural parallelism of quantum mechanics to solve problems using less computational resources than classical computers. Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we study, for the first time explicitly, spacebounded quantum algorithms for computational problems where the input is given not as a whole, but bit by bit. We show that there exist such problems that a quantum computer can solve using exponentiallyless work space than a classical computer. More precisely, we introduce a very natural and simple model of a space-bounded quantum online machine and prove an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language. The language we consider is inspired bya communication problem that Buhrman, Cleve and Wigderson used to show an almost quadratic separation of quantum and classical bounded-error communication complexity. We prove that, in the framework of online space complexity, the separation becomes exponential.

ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)•Jul 30, 2006•32 citations

Quantum computing

Lee C. Spector

This tutorial provides an introduction to quantum computing and to the use of evolutionary computation for automatic quantum computer programming. No prior experience with quantum mechanics or with evolutionary computation will be assumed. While the primary focus of the tutorial will be on general concepts, specific results will also be presented, including human-competitive results produced by genetic programming. Follow-up material is available from the presenter's book, Automatic Quantum Computer Programming: A Genetic Programming Approach, published by Springer and Kluwer Academic Publishers.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 7, 2007•0 citations

Predicting ground state, excited states and long-time evolution of many-body systems from short-time evolution on a quantum computer

Edgar Andres Ruiz Guzman, Denis Lacroix A

The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments of the Hamiltonian $\langle H^{K}\rangle$ at various orders $K$. With the constraint of minimizing the quantum resources needed on near-term quantum computers, we show that the evaluation of the generating function can be made with only one extra ancillary qubit. Due to the limited stability of actual quantum devices, the function $F(t)$ can a priori be estimated on a restricted time interval limiting automatically the orders of the moments that could be computed. Despite of this current limitation and even with a small number of moments, a post-processing on classical computers can be used to predict approximate ground or excited state energies and/or approximate long-time evolutions. This post-processing can be achieved using methods based on the Krylov space and/or on the $t$-expansion approach that is based on imaginary time evolution. Hybrid quantum-classical calculations are illustrated in many-body interacting systems using the pairing and Fermi-Hubbard models. Possible extensions using symmetry breaking and restoration as well as a multi-reference framework are discussed.

•Apr 16, 2021•2 citations
[EN] We present a gradual transition from classical to quantum artificial life and shallowly prove that minimal Darwinian evolution (reproduction, interaction, aging, etc.) can be achieved on quantum computers, being them the best resource in order to surmount the exponential growth of space and time resources that arise in (here, evolutionary) computing in the quantum framework. Three different classical computing Octave codes have been made during this work.
Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers
Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.
The main objective of quantum computation is to exploit the natural parallelism of quantum mechanics to solve problems using less computational resources than classical computers. Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we study, for the first time explicitly, spacebounded quantum algorithms for computational problems where the input is given not as a whole, but bit by bit. We show that there exist such problems that a quantum computer can solve using exponentiallyless work space than a classical computer. More precisely, we introduce a very natural and simple model of a space-bounded quantum online machine and prove an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language. The language we consider is inspired bya communication problem that Buhrman, Cleve and Wigderson used to show an almost quadratic separation of quantum and classical bounded-error communication complexity. We prove that, in the framework of online space complexity, the separation becomes exponential.
This tutorial provides an introduction to quantum computing and to the use of evolutionary computation for automatic quantum computer programming. No prior experience with quantum mechanics or with evolutionary computation will be assumed. While the primary focus of the tutorial will be on general concepts, specific results will also be presented, including human-competitive results produced by genetic programming. Follow-up material is available from the presenter's book, Automatic Quantum Computer Programming: A Genetic Programming Approach, published by Springer and Kluwer Academic Publishers.
The generating function of a Hamiltonian HHH is defined as F(t)=⟨e−itH⟩F(t)=\langle e^{-itH}\rangleF(t)=⟨e−itH⟩, where ttt is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments of the Hamiltonian ⟨HK⟩\langle H^{K}\rangle⟨HK⟩ at various orders KKK. With the constraint of minimizing the quantum resources needed on near-term quantum computers, we show that the evaluation of the generating function can be made with only one extra ancillary qubit. Due to the limited stability of actual quantum devices, the function F(t)F(t)F(t) can a priori be estimated on a restricted time interval limiting automatically the orders of the moments that could be computed. Despite of this current limitation and even with a small number of moments, a post-processing on classical computers can be used to predict approximate ground or excited state energies and/or approximate long-time evolutions. This post-processing can be achieved using methods based on the Krylov space and/or on the ttt-expansion approach that is based on imaginary time evolution. Hybrid quantum-classical calculations are illustrated in many-body interacting systems using the pairing and Fermi-Hubbard models. Possible extensions using symmetry breaking and restoration as well as a multi-reference framework are discussed.