Skip to content
Preprint

Clifford-efficient sparse state preparation for molecular wavefunctions

Aug 2026 · 0 citations · 44 references
Physics

TL;DR

This work exploits affine relationships among the binary configurations over the finite field $\operatorname{GF}(2)$ to reduce both the non-Clifford gate count and the ancillary qubit count before binary encoding.

Abstract

Sparse quantum state preparation concerns an $n$-qubit target state that is a superposition of only $d \ll 2^n$ computational basis states. Existing approaches exploit this sparsity by compressing these $d$ basis states and their amplitudes onto a smaller set of qubits, called the dense register, before expanding the prepared state to the full register. Rather than relying on the permutation-based compression used in prior work, we exploit affine relationships among the binary configurations over the finite field $\operatorname{GF}(2)$ to reduce both the non-Clifford gate count and the ancillary qubit count. Invertible affine transformations over $\operatorname{GF}(2)$, comprising Gaussian elimination and all-ones-row removal, first reduce the dense register from $n$ to the rank $r$ using only Clifford gates and no ancillary qubits. An optional binary encoding stage then trades additional Toffoli gates and ancillary qubits for further compression to the minimum $\lceil\log_2 d\rceil$ dense qubits needed to represent $d$ distinct configurations. For chemically relevant wavefunctions, such as those obtained from selected configuration interaction calculations, shared electronic excitation patterns produce many of these affine relationships, enabling substantial Clifford-only compression before binary encoding. Across the molecular benchmarks, our method requires the fewest ancillary qubits among the evaluated sparse state preparation methods while maintaining comparable non-Clifford gate counts when using binary encoding.

View source

Similar papers

Preprint Sep 2026

Fast Cliffords When Your Quantum Memory Is Full

Additional qubits can reduce the depth of a quantum circuit by providing workspace for parallel computation, but standard constructions assume that this workspace is initialized in a known state. In this work we study catalytic implementations, i.e. asking whether dirty qubits can instead be used provided that their jo...

Marten Folkertsma, Ian Mertz, S. Strelchuk et al. · 0 citations
Preprint Sep 2026

Ultra-Precise Quantum Projective Designs in Constant Depth

The results show that precise Haar-like statistics can emerge from sparse commuting dynamics with remarkably low quantum resources, with applications to randomized characterization, quantum metrology, quantum algorithms, and many-body physics.

Qing-Yue Zhang, Jun-Jie Chen, Zhou You et al. · 0 citations
Preprint Aug 2026

Exact Fock-State Preparation with $n^{1/4}$ Circuit Depth

Efficient, deterministic, and high-fidelity preparation of large Fock states is essential for scaling bosonic quantum technologies and exploring quantum phenomena at large excitation energies. We introduce a deterministic one-parameter (D1p) protocol that maps Fock-state preparation in an infinite-dimensional Hilbert s...

Tanay Roy · 1 citation
Preprint Oct 2026

From Steane to A7: Quantum Codes from Invariant States

We construct a two-parameter family of single-error-correcting seven-ququart codes with transversal $\tilde{A_7}$ symmetry, realizing the finite component of a two-qubit super-golden gate set. These $((7,4,3))_4$ codes encode two logical qubits and support non-Clifford operations by applying the same gate to each physi...

Ian Teixeira · 0 citations
Preprint Aug 2026

No Free Compression in Quantum Relaxations for Optimization

This work defines the universal margin as the smallest correlator magnitude that can be guaranteed with prescribed signs for every target sign assignment, and shows that it is exactly $\Delta_{\rm Maj}(n)=\tan\!\left(\frac{\pi}{4n}\right)=\Theta(1/n)$, whereas uniformly random sign assignments retain $\Theta(1/\sqrt n)...

Stuart Hadfield · 3 citations
Preprint Sep 2026

Optimal T-Count for Block Encodings of Fermionic and Spin Hamiltonians

We determine the non-Clifford $T$-gate cost of constructing block encodings of structured fermionic and spin Hamiltonians in a unitary Clifford$+T$ model, when arbitrarily many clean ancillas and unrestricted block-encoding subnormalization are allowed, but without mid-circuit measurements or classical feed-forward. Ou...

Jia-Xin Ma, K. J. Joven, Yuan Liu · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.