Efficient quantum algorithm for solving structured problems via multistep quantum computation
In classical computation, a problem can be solved in multiple steps where the calculated results of each step can be copied and used repeatedly. However, in quantum computation, it is difficult to realize a similar multistep computation process because the no-cloning theorem forbids making copies of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2023-01-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.5.L012004 |
| Summary: | In classical computation, a problem can be solved in multiple steps where the calculated results of each step can be copied and used repeatedly. However, in quantum computation, it is difficult to realize a similar multistep computation process because the no-cloning theorem forbids making copies of an unknown quantum state perfectly. We find a method based on a quantum resonant transition to protect and reuse an unknown quantum state that encodes the calculated results of an intermediate step without copying it, and present a quantum algorithm that solves a problem via multistep quantum computation. We demonstrate that this algorithm can solve a type of structured search problems efficiently. |
|---|---|
| ISSN: | 2643-1564 |