Papers › Natural parameterized quantum circuit
Natural parameterized quantum circuit
Tobias Haug, M. S. Kim
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.
Noisy intermediate scale quantum computers are useful for various tasks such as state preparation and variational quantum algorithms. However, the non-Euclidean quantum geometry of parameterized quantum circuits is detrimental for these applications. Here, we introduce the natural parameterized quantum circuit (NPQC) that can be initialised with a Euclidean quantum geometry. The initial training of variational quantum algorithms is substantially sped up as the gradient is equivalent to the quantum natural gradient. Further, we show how to estimate the parameters of the NPQC by sampling the circuit, which could be used for benchmarking or calibrating NISQ hardware. For a general class of quantum circuits, the NPQC has the minimal quantum Cram\'er-Rao bound which highlights its potential for quantum metrology. Finally, we show how to generate arbitrary superpositions of two states with the NPQCs for state preparation tasks. Our results can be used to enhance currently available quantum processors.
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