T-Count Optimizing Genetic Algorithm for Quantum State Preparation
Andrew Wright, Marco Lewis, Paolo Zuliani, Sadegh Soudjani

TL;DR
This paper introduces a genetic algorithm that optimizes quantum state preparation circuits by minimizing T-Count, aiming to reduce noise impact and improve the fidelity of quantum states in scalable quantum computing.
Contribution
It presents a novel genetic algorithm approach for T-Count optimization in Clifford + T circuits, balancing fidelity and noise reduction in quantum state preparation.
Findings
The algorithm can generate high-fidelity quantum states like Fourier transform states.
It automatically produces fault-tolerant solutions with fewer error-prone components.
Scalability issues increase with more qubits, indicating a need for further optimization.
Abstract
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the number of qubits to be initialized grows, the circuits required to implement the desired state also exponentially increase in size leading to loss of fidelity to noise. This is mainly due to the susceptibility to environmental effects of the non-Clifford T gate, whose use should thus be reduced as much as possible. In this paper, we present and utilize a genetic algorithm for state preparation circuits consisting of gates from the Clifford + T gate set and optimize them in T-Count as to reduce the impact of noise. Whilst the method presented here does not always produce the most accurate circuits in terms of fidelity, it can generate high-fidelity,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
