GASP: a genetic algorithm for state preparation on quantum computers
Abstract The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2023-07-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-023-37767-w |
| _version_ | 1797769563143667712 |
|---|---|
| author | Floyd M. Creevey Charles D. Hill Lloyd C. L. Hollenberg |
| author_facet | Floyd M. Creevey Charles D. Hill Lloyd C. L. Hollenberg |
| author_sort | Floyd M. Creevey |
| collection | DOAJ |
| description | Abstract The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be implemented on physical devices. We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. The method uses a basis set of $$R_x$$ R x , $$R_y$$ R y , $$R_z$$ R z , and CNOT gates and a genetic algorithm to systematically generate circuits to synthesize the target state to the required fidelity. GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods. This variability of the required accuracy facilitates overall higher accuracy on implementation, as error accumulation in high-depth circuits can be avoided. We directly compare the method to the state initialisation technique based on an exact synthesis technique by implemented in IBM Qiskit simulated with noise and implemented on physical IBM Quantum devices. Results achieved by GASP outperform Qiskit’s exact general circuit synthesis method on a variety of states such as Gaussian states and W-states, and consistently show the method reduces the number of gates required for the quantum circuits to generate these quantum states to the required accuracy. |
| first_indexed | 2024-03-12T21:10:52Z |
| format | Article |
| id | doaj.art-4938a616e89b4458aee13489864d0bf7 |
| institution | Directory Open Access Journal |
| issn | 2045-2322 |
| language | English |
| last_indexed | 2024-03-12T21:10:52Z |
| publishDate | 2023-07-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj.art-4938a616e89b4458aee13489864d0bf72023-07-30T11:12:03ZengNature PortfolioScientific Reports2045-23222023-07-011311810.1038/s41598-023-37767-wGASP: a genetic algorithm for state preparation on quantum computersFloyd M. Creevey0Charles D. Hill1Lloyd C. L. Hollenberg2School of Physics, University of MelbourneSchool of Physics, University of MelbourneSchool of Physics, University of MelbourneAbstract The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce and typically only low-depth quantum circuits can be implemented on physical devices. We present a genetic algorithm for state preparation (GASP) which generates relatively low-depth quantum circuits for initialising a quantum computer in a specified quantum state. The method uses a basis set of $$R_x$$ R x , $$R_y$$ R y , $$R_z$$ R z , and CNOT gates and a genetic algorithm to systematically generate circuits to synthesize the target state to the required fidelity. GASP can produce more efficient circuits of a given accuracy with lower depth and gate counts than other methods. This variability of the required accuracy facilitates overall higher accuracy on implementation, as error accumulation in high-depth circuits can be avoided. We directly compare the method to the state initialisation technique based on an exact synthesis technique by implemented in IBM Qiskit simulated with noise and implemented on physical IBM Quantum devices. Results achieved by GASP outperform Qiskit’s exact general circuit synthesis method on a variety of states such as Gaussian states and W-states, and consistently show the method reduces the number of gates required for the quantum circuits to generate these quantum states to the required accuracy.https://doi.org/10.1038/s41598-023-37767-w |
| spellingShingle | Floyd M. Creevey Charles D. Hill Lloyd C. L. Hollenberg GASP: a genetic algorithm for state preparation on quantum computers Scientific Reports |
| title | GASP: a genetic algorithm for state preparation on quantum computers |
| title_full | GASP: a genetic algorithm for state preparation on quantum computers |
| title_fullStr | GASP: a genetic algorithm for state preparation on quantum computers |
| title_full_unstemmed | GASP: a genetic algorithm for state preparation on quantum computers |
| title_short | GASP: a genetic algorithm for state preparation on quantum computers |
| title_sort | gasp a genetic algorithm for state preparation on quantum computers |
| url | https://doi.org/10.1038/s41598-023-37767-w |
| work_keys_str_mv | AT floydmcreevey gaspageneticalgorithmforstatepreparationonquantumcomputers AT charlesdhill gaspageneticalgorithmforstatepreparationonquantumcomputers AT lloydclhollenberg gaspageneticalgorithmforstatepreparationonquantumcomputers |