analiza aiqbench
This research presents a hardware-efficient method for quantum state preparation that shifts the computational burden from the quantum circuit to classical preprocessing, achieving high fidelity with shallow circuits suitable for near-term devices. By leveraging diagonal Hamiltonians and Walsh basis expansions, the approach minimizes oracle queries while maintaining polynomial scaling for structured data, offering a practical pathway for encoding large datasets into quantum registers.
Learning Hamiltonians for $O(1)$ Oracle-Query Quantum State Preparation
arXiv:2512.19181v2 Announce Type: replace Abstract: We propose a Hamiltonian-based quantum state preparation method implemented via a shallow parametrized quantum circuit. The approach learns the parameters of a diagonal Hamiltonian through a classical training phase, while the quantum circuit itself performs only fixed-depth Hamiltonian evolution and mixing operations. With oracle access to the learned Hamiltonian parameters, $N$ classical data values can be encoded into $n=\log_2{N}$ qubits using $O(1)$ quantum queries, shifting the overall computational cost to an $O(N\log{N})$ classical preprocessing stage. For structured datasets generated by an underlying function, oracle access can be avoided by expressing the Hamiltonian in the Walsh basis and retaining only a polynomial number of significant terms. In this regime, quantum state preparation is achieved in $\text{poly}(n)$ time using $\text{poly}(n)$ parameters, reaching infidelities on the order of $10^{-5}$. By restricting the Hamiltonian to one-local and two-local terms, the method naturally yields hardware-efficient circuits suitable for near-term quantum devices. This separation keeps the quantum execution shallow while moving optimization to classical computation.
Abstract:We propose a Hamiltonian-based quantum state preparation method implemented via a shallow parametrized quantum circuit. The approach learns the parameters of a diagonal Hamiltonian through a classical training phase, while the quantum circuit itself performs only fixed-depth Hamiltonian evolution and mixing operations. With oracle access to the learned Hamiltonian parameters, $N$ classical data values can be encoded into $n=\log_2{N}$ qubits using $O(1)$ quantum queries, shifting the overall computational cost to an $O(N\log{N})$ classical preprocessing stage. For structured datasets generated by an underlying function, oracle access can be avoided by expressing the Hamiltonian in the Walsh basis and retaining only a polynomial number of significant terms. In this regime, quantum state preparation is achieved in $\text{poly}(n)$ time using $\text{poly}(n)$ parameters, reaching infidelities on the order of $10^{-5}$. By restricting the Hamiltonian to one-local and two-local terms, the method naturally yields hardware-efficient circuits suitable for near-term quantum devices. This separation keeps the quantum execution shallow while moving optimization to classical computation.
arXiv:2512.19181 [quant-ph]
(or arXiv:2512.19181v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2512.19181 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 248 cuvinte