Fault-tolerant quantum algorithms for quantum molecular systems: A survey
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915603231539200 |
|---|---|
| author | Zhang, Yukun Zhang, Xiaoming Sun, Jinzhao Lin, Heng Huang, Yifei Lv, Dingshun Yuan, Xiao |
| author_facet | Zhang, Yukun Zhang, Xiaoming Sun, Jinzhao Lin, Heng Huang, Yifei Lv, Dingshun Yuan, Xiao |
| contents | Solving quantum molecular systems presents a significant challenge for classical computation. The advent of early fault-tolerant quantum computing (EFTQC) devices offers a promising avenue to address these challenges, leveraging advanced quantum algorithms with reduced hardware requirements. This review surveys the latest developments in EFTQC and fully fault-tolerant quantum computing (FFTQC) algorithms for quantum molecular systems, covering encoding schemes, advanced Hamiltonian simulation techniques, and ground-state energy estimation methods. We highlight recent progress in overcoming practical barriers, such as reducing circuit depth and minimizing the use of ancillary qubits. Special attention is given to the potential quantum advantages achievable through these algorithms, as well as the limitations imposed by dequantization and classical simulation techniques. The review concludes with a discussion of future directions, emphasizing the need for optimized algorithms and experimental validation to bridge the gap between theoretical developments and practical implementation in EFTQC and FFTQC for quantum molecular systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_02139 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fault-tolerant quantum algorithms for quantum molecular systems: A survey Zhang, Yukun Zhang, Xiaoming Sun, Jinzhao Lin, Heng Huang, Yifei Lv, Dingshun Yuan, Xiao Quantum Physics Solving quantum molecular systems presents a significant challenge for classical computation. The advent of early fault-tolerant quantum computing (EFTQC) devices offers a promising avenue to address these challenges, leveraging advanced quantum algorithms with reduced hardware requirements. This review surveys the latest developments in EFTQC and fully fault-tolerant quantum computing (FFTQC) algorithms for quantum molecular systems, covering encoding schemes, advanced Hamiltonian simulation techniques, and ground-state energy estimation methods. We highlight recent progress in overcoming practical barriers, such as reducing circuit depth and minimizing the use of ancillary qubits. Special attention is given to the potential quantum advantages achievable through these algorithms, as well as the limitations imposed by dequantization and classical simulation techniques. The review concludes with a discussion of future directions, emphasizing the need for optimized algorithms and experimental validation to bridge the gap between theoretical developments and practical implementation in EFTQC and FFTQC for quantum molecular systems. |
| title | Fault-tolerant quantum algorithms for quantum molecular systems: A survey |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.02139 |