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

• URL: http://arxiv.org/abs/2608.16937v1
• Date: Mon, 10 Aug 2026 17:32:27 GMT
• Title: New Methods and Frameworks for Quantum State Preparation in Modern Quantum Systems
• Abstract summary: 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.<n>Both are benchmarked against ten configurations spanning the UCR, isometry, multiplexor, Schmidt/SVD, QSD, and heap-transform families.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• SSTQ:Privacy-Preserving Vector Quantization via Subsampled Stochastic TurboQuant [79.24089819400126]
  Subsampled TurboQuant (SSTQ) is a framework that combines overcomplete equal-width tight frames, coordinate subsampling, and privacy-aware quantization.<n>SSTQ achieves mean squared error scaling while using only $lceil log N il + b$ bits per client, where $N = (d)$ is the frame size.<n>We also derive a surrogate privacy-aware codebook objective that reduces the codebook-dependent MSE scaling from $O(4b)$ to $O(2b)$.
  arXiv  Detail & Related papers  (2026-08-05T17:51:25Z)
• Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product [5.247996019685446]
  This paper introduces an exact framework for CNOT and undirected phase circuits.<n>By enumerating partial-gate topologies and solving the missing gate directions separately, we are able to parallelize both stages.<n>Our algorithm outperforms the SAT-based approach on 89% of cases in QASM.
  arXiv  Detail & Related papers  (2026-07-27T09:14:53Z)
• From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware [3.652509571098291]
  We benchmark gate-based quantum optimization on four NP-hard problems.<n>We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO.<n>Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy.
  arXiv  Detail & Related papers  (2026-07-13T14:53:50Z)
• Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains [0.0]
  We present a new end-to-end framework requiring only one ancilla qubit in the working register.<n>The key technical ingredient is a selective phase compiler circuit using one ancilla qubit.<n>As a direct application, we apply the quantum algorithm to prepare a Gibbs QSAMPLE and obtain a rigorous complexity analysis.
  arXiv  Detail & Related papers  (2026-05-22T09:55:28Z)
• Efficient Complex-Valued State Preparation on Bucket Brigade QRAM [47.72095699729477]
  Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data.<n>We present two improvements within the same architecture-aware framework.
  arXiv  Detail & Related papers  (2026-04-28T13:43:29Z)
• INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
  We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
  arXiv  Detail & Related papers  (2025-11-16T20:14:28Z)
• Gradient-descent methods for fast quantum state tomography [0.24999074238880484]
  We introduce gradient-descent (GD) algorithms for the post-processing step of quantum state tomography (QST)<n>We use various density-matrix parameterizations: Cholesky decomposition, Stiefel manifold, and projective normalization.<n>We find that rank-controlled ansatzes in our mini-batch GD-QST algorithms effectively handle noisy and data sets.
  arXiv  Detail & Related papers  (2025-03-06T15:13:45Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• Paraformer: Fast and Accurate Parallel Transformer for Non-autoregressive End-to-End Speech Recognition [62.83832841523525]
  We propose a fast and accurate parallel transformer, termed Paraformer. It accurately predicts the number of output tokens and extract hidden variables. It can attain comparable performance to the state-of-the-art AR transformer, with more than 10x speedup.
  arXiv  Detail & Related papers  (2022-06-16T17:24:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.