Saved in:
Bibliographic Details
Main Authors: Parry, Owain, Clark, John, McMinn, Phil
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.09103
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916393756131328
author Parry, Owain
Clark, John
McMinn, Phil
author_facet Parry, Owain
Clark, John
McMinn, Phil
contents Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits that give the correct output more often than not for any input. They can be executed multiple times, with the outputs combined using a classical method (such as voting) to produce the final output, effectively creating a homogeneous ensemble of circuits (i.e., all identical). Inspired by n-version programming and ensemble learning, we developed a tool that uses an evolutionary algorithm to generate heterogeneous ensembles of circuits (i.e., all different), named QuEEn. We used it to evolve ensembles to solve the Iris classification problem. When using ideal simulation, we found the performance of heterogeneous ensembles to be greater than that of homogeneous ensembles to a statistically significant degree. When using noisy simulation, we still observed a statistically significant improvement in the majority of cases. Our results indicate that evolving heterogeneous ensembles is an effective strategy for improving the reliability of quantum circuits. This is particularly relevant in the current NISQ era of quantum computing where computers do not yet have good tolerance to quantum noise.
format Preprint
id arxiv_https___arxiv_org_abs_2409_09103
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Improving the Reliability of Quantum Circuits by Evolving Heterogeneous Ensembles
Parry, Owain
Clark, John
McMinn, Phil
Quantum Physics
Emerging Technologies
Quantum computers can perform certain operations exponentially faster than classical computers, but designing quantum circuits is challenging. To that end, researchers used evolutionary algorithms to produce probabilistic quantum circuits that give the correct output more often than not for any input. They can be executed multiple times, with the outputs combined using a classical method (such as voting) to produce the final output, effectively creating a homogeneous ensemble of circuits (i.e., all identical). Inspired by n-version programming and ensemble learning, we developed a tool that uses an evolutionary algorithm to generate heterogeneous ensembles of circuits (i.e., all different), named QuEEn. We used it to evolve ensembles to solve the Iris classification problem. When using ideal simulation, we found the performance of heterogeneous ensembles to be greater than that of homogeneous ensembles to a statistically significant degree. When using noisy simulation, we still observed a statistically significant improvement in the majority of cases. Our results indicate that evolving heterogeneous ensembles is an effective strategy for improving the reliability of quantum circuits. This is particularly relevant in the current NISQ era of quantum computing where computers do not yet have good tolerance to quantum noise.
title Improving the Reliability of Quantum Circuits by Evolving Heterogeneous Ensembles
topic Quantum Physics
Emerging Technologies
url https://arxiv.org/abs/2409.09103