Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.16937

New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems

Alexis Gomez
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis studies exact, deterministic preparation of arbitrary dense n-qubit states, the data-loading step in quantum signal and image processing. It derives two syntheses built on the Digital Signal-induced Heap Transform (DsiHT): the QsiHT Fast Path Real Synthesis and the QsiHT Fast Path Complex Synthesis. Both are benchmarked against ten configurations spanning the UCR, isometry, multiplexor, Schmidt/SVD, QSD, and heap-transform families. Several of those are realizations through Qiskit builders or compiler optimization, not from-scratch reimplementations. The n=3 noisy comparison spans ibm_fez, ibm_kingston, and ibm_marrakesh, three 156-qubit IBM Heron r2 processors, where single-submission nine-method jobs permit within-session family-wide Benjamini-Hochberg-corrected comparisons. The frontier-versus-QSD separation reproduces within one calibration on every device, but the within-frontier order does not reproduce across devices or calibration days. A deep-circuit n=8 run on ibm_fez shows the executed-count ordering re-emerge outside the run-to-run spread on the complex target. Depth was not isolated from mapping, gate composition, calibration, or session effects. All methods are exact to machine precision and differ only in cost. Under noise the coarse error tier tracks the executed (routed) two-qubit count, separating the Theta(2^n) frontier from QSD's Theta(4^n) and nothing finer. Both syntheses realize the deployed Qiskit StatePreparation floor of 2^n-n-1 CNOTs, undercutting every other from-scratch method on the as-built CNOT axis. The Real Synthesis serves real (sign-bearing) targets and holds the lowest classical build cost among the exact loaders at large register sizes, through one fast Walsh-Hadamard pass. The Complex Synthesis serves arbitrary complex targets and ties Qiskit's StatePreparation for the lowest simulated sampled error.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Alexis Gomez. 2026-08-10. New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems. https://arxiv.org/abs/2608.16937

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗