Papers › Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers

Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers

26 Oct 2021arXiv:2110.13454links table onlyarchive 2025-07-28

Prithvi Gundlapalli, Junyi Lee

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.

Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector 𝐛 is encoded in the amplitudes of a quantum state |b >. However, efficiently preparing |b > is known to be a difficult problem because an arbitrary state of Q qubits generally requires approximately 2^Q entangling gates, which results in significant decoherence on today's Noisy Intermediate Scale Quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows one to flexibly reduce the quantum resources required for state preparation in an entanglement efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest such as the normal and log-normal distributions. For low entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared to isometric decomposition.

PaperPDFCode

Code

QuantumSensors/mps-state-preparation officialmentioned on GitHub report

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