Cargando…
Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm
Quantum information processing enhances human’s power to simulate nature in quantum level and solve complex problem efficiently. During the process, a series of operators is performed to evolve the system or undertake a computing task. In recent year, research interest in non-Hermitian quantum syste...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7889913/ https://www.ncbi.nlm.nih.gov/pubmed/33597681 http://dx.doi.org/10.1038/s41598-021-83521-5 |
_version_ | 1783652402019172352 |
---|---|
author | Zheng, Chao |
author_facet | Zheng, Chao |
author_sort | Zheng, Chao |
collection | PubMed |
description | Quantum information processing enhances human’s power to simulate nature in quantum level and solve complex problem efficiently. During the process, a series of operators is performed to evolve the system or undertake a computing task. In recent year, research interest in non-Hermitian quantum systems, dissipative-quantum systems and new quantum algorithms has greatly increased, which nonunitary operators take an important role in. In this work, we utilize the linear combination of unitaries technique for nonunitary dynamics on a single qubit to give explicit decompositions of the necessary unitaries, and simulate arbitrary time-dependent single-qubit nonunitary operator F(t) using duality quantum algorithm. We find that the successful probability is not only decided by F(t) and the initial state, but also is inversely proportional to the dimensions of the used ancillary Hilbert subspace. In a general case, the simulation can be achieved in both eight- and six-dimensional Hilbert spaces. In phase matching conditions, F(t) can be simulated by only two qubits. We illustrate our method by simulating typical non-Hermitian systems and single-qubit measurements. Our method can be extended to high-dimensional case, such as Abrams–Lloyd’s two-qubit gate. By discussing the practicability, we expect applications and experimental implementations in the near future. |
format | Online Article Text |
id | pubmed-7889913 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-78899132021-02-22 Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm Zheng, Chao Sci Rep Article Quantum information processing enhances human’s power to simulate nature in quantum level and solve complex problem efficiently. During the process, a series of operators is performed to evolve the system or undertake a computing task. In recent year, research interest in non-Hermitian quantum systems, dissipative-quantum systems and new quantum algorithms has greatly increased, which nonunitary operators take an important role in. In this work, we utilize the linear combination of unitaries technique for nonunitary dynamics on a single qubit to give explicit decompositions of the necessary unitaries, and simulate arbitrary time-dependent single-qubit nonunitary operator F(t) using duality quantum algorithm. We find that the successful probability is not only decided by F(t) and the initial state, but also is inversely proportional to the dimensions of the used ancillary Hilbert subspace. In a general case, the simulation can be achieved in both eight- and six-dimensional Hilbert spaces. In phase matching conditions, F(t) can be simulated by only two qubits. We illustrate our method by simulating typical non-Hermitian systems and single-qubit measurements. Our method can be extended to high-dimensional case, such as Abrams–Lloyd’s two-qubit gate. By discussing the practicability, we expect applications and experimental implementations in the near future. Nature Publishing Group UK 2021-02-17 /pmc/articles/PMC7889913/ /pubmed/33597681 http://dx.doi.org/10.1038/s41598-021-83521-5 Text en © The Author(s) 2021 Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. |
spellingShingle | Article Zheng, Chao Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title | Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title_full | Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title_fullStr | Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title_full_unstemmed | Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title_short | Universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
title_sort | universal quantum simulation of single-qubit nonunitary operators using duality quantum algorithm |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7889913/ https://www.ncbi.nlm.nih.gov/pubmed/33597681 http://dx.doi.org/10.1038/s41598-021-83521-5 |
work_keys_str_mv | AT zhengchao universalquantumsimulationofsinglequbitnonunitaryoperatorsusingdualityquantumalgorithm |