Learning Hamiltonians for O(1) Oracle-Query Quantum State Preparation
quant-ph
Submitted: 2025-12-22
Updated: 2026-10-20
Comments: 11 pages, 7 figures
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: We propose a Hamiltonian-based quantum state preparation method implemented via a shallow parametrized quantum circuit.
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= 2 N qubits using O(1) quantum queries, shifting the overall computational cost to an O(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 poly(n) time using 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.
Sources
- Parallel Data Processing in Quantum Machine Learning
- Quantum Amplitude Amplification and Estimation
- Creating superpositions that correspond to efficiently integrable probability distributions
- Low-depth measurement-based deterministic quantum state preparation
- Hybrid Quantum State Preparation via Data Compression
- Quantum state preparation without coherent arithmetic
- Black-box Hamiltonian simulation and unitary implementation
- Hamiltonian Simulation by Uniform Spectral Amplification
- Reducing the Number of Qubits from $n^2$ to $n\log_{2} (n)$ to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources