Papers › Compact Molecular Simulation on Quantum Computers via Combinatorial Mapping and...

Compact Molecular Simulation on Quantum Computers via Combinatorial Mapping and Variational State Preparation

24 May 2022arXiv:2205.11742links table onlyarchive 2025-07-28

Diana Chamaki, Mekena Metcalf, Wibe A. de Jong

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Compact representations of fermionic Hamiltonians are necessary to perform calculations on quantum computers that lack error-correction. A fermionic system is typically defined within a subspace of fixed particle number and spin while unnecessary states are projected out of the Hilbert space. We provide a bijective mapping using combinatoric ranking to bijectively map fermion basis states to qubit basis states and express operators in the standard spin representation. We then evaluate compact mapping using the Variational Quantum Eigensolver (VQE) with the unitary coupled cluster singles and doubles excitations (UCCSD) ansatz in the compact representation. Compactness is beneficial when the orbital filling is well away from half, and we show at 30 spin orbital H₂ calculation with only 8 qubits. We find that the gate depth needed to prepare the compact wavefunction is not much greater than the full configuration space in practice. A notable observation regards the number of calls to the optimizer needed for the compact simulation compared to the full simulation. We find that the compact representation converges faster than the full representation using the ADAM optimizer in all cases. Our analysis demonstrates the effect of compact mapping in practice.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections