2025/10/02 by Chayong Ku, Calvin Ku, Yu-Cheng Chen +7 · 2 citations
Computer Science · Physics and Astronomy · #Benchmark (surveying) #Benchmarking #Encoding (memory) #Heuristic #Measure (data warehouse) #Quantization (signal processing) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum gate #Quantum system #Qubit #Scaling #Spectroscopy and Quantum Chemical Studies
paper · pdf · doi:10.1103/6q7b-h9db
openalex publication_date 2026/06/22 · openalex created_date 2026/06/23 · openalex updated_date 2026/07/25
Quantum phase estimation is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. Optimal simulation relies on a complex trade-offs across many parameters including Hamiltonian simulation techniques, basis sets, and the fermion-to-qubit encodings. Here, we characterize the trade-offs and quantify the quantum resource costs of the sorted-list encoding as a particle-conserving, low-qubit alternative to the Jordan-Wigner encoding. We identify specific regimes, across different simulation techniques and basis sets, where the sorted-list encoding would be favorable compared to existing methods. Our findings are further supported through numerical benchmarks of real-world chemical systems. We found the sorted-list encoding to be a viable alternative to the Jordan-Wigner encoding for the compact molecular orbital basis when the electron-filling ratio is low, which typically occurs when high-precision results are required. In the plane-wave basis, we found similar asymptotic gate and qubit scaling between the sorted-list and the first-quantized encoding, although the first-quantized encoding still retains lower constant factors.