Papers › Loading N-Dimensional Vector into Quantum Registers from Classical Memory with O(logN) Steps
Loading N-Dimensional Vector into Quantum Registers from Classical Memory with O(logN) Steps
Chao-Yang Pang
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.
Vector is the general format of input data of most algorithms. Designing unitary operation to load all information of vector into quantum registers of quantum CPU from classical memory is called quantum loading scheme (QLS). QLS assembles classical memory and quantum CPU as a whole computer, which will be important for further quantum computation. We present a QLS based on path interference with time complexity O(logN), while classical loading scheme has time complexity O(N), that is the efficiency bottleneck of classical computer.
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