Efficient Sparse State Preparation via Quantum Walks

• URL: http://arxiv.org/abs/2405.20273v3
• Date: Thu, 25 Sep 2025 23:25:25 GMT
• Title: Efficient Sparse State Preparation via Quantum Walks
• Abstract summary: We develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation.<n>We use this mapping to introduce an efficient quantum state preparation framework based on dynamic CTQWs.
• Score: 4.864856930458624
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

Related papers

• Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive [0.9236074230806578]
  VarQTE is a primitive for the preparation of physically structured quantum states.<n>It reduces requirements on quantum resources by leveraging existing structures and the associated possibility of enabling classical simulations.<n>Results on 2D systems show how bowtie VarQTE can reduce the quantum requirements compared to standard, sample-based Krylov diagonalization calculations.
  arXiv  Detail & Related papers  (2026-05-19T18:00:03Z)
• Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning [38.502127166117674]
  We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN)<n>We use single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN)<n>We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result.
  arXiv  Detail & Related papers  (2026-05-07T13:04:09Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Quantum Tensor Representation via Circuit Partitioning and Reintegration [0.6766416093990318]
  We introduce shardQ, a method that leverages the SparseCut algorithm with matrix product state compilation and a global knitting technique.<n>This study also presents the results regarding application readiness.
  arXiv  Detail & Related papers  (2025-11-07T18:59:58Z)
• Efficient Variational Quantum Algorithms via Circuit Knitting and Architecture Search [14.667623160371013]
  We introduce CKVQA, a framework that applies circuit knitting to variational quantum algorithms (VQAs)<n>CKVQA aims to minimize the sampling overhead by identifying parameterized quantum circuits that achieve a favorable balance between algorithmic performance and sampling overhead.<n>We have developed a subcircuit-level optimization method to accelerate the training of VQAs and reduce overall execution time.
  arXiv  Detail & Related papers  (2025-08-05T12:27:19Z)
• Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis [0.0]
  A reinforcement learning framework is introduced for the efficient synthesis of quantum circuits.<n>The framework combines a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties.<n> Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits.
  arXiv  Detail & Related papers  (2025-07-22T14:39:20Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG force to demonstrate that its discrete-time solution gives a generalized form, which we call Momentum-QNG.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models [0.0]
  We introduce a systematic procedure for ansatz building based on approximate Quantum Mutual Information (QMI) Our approach generates a layered-structured ansatz, where each layer's qubit pairs are selected based on their QMI values, resulting in more efficient state preparation and optimization routines. Our results show that the Multi-QIDA method reduces the computational complexity while maintaining high precision, making it a promising tool for quantum simulations in lattice spin models.
  arXiv  Detail & Related papers  (2024-08-05T17:07:08Z)
• Improved Quantum Power Method and Numerical Integration Using Quantum Singular Value Transformation [1.0687104237121408]
  We first show that the QSVT framework can accelerate one recently introduced quantum power method, which substantially improves its running time. We incorporate several elementary numerical integration techniques, such as the rectangular method, into the QSVT framework, which results in speedup with respect to the size or the number of points of the grid.
  arXiv  Detail & Related papers  (2024-07-16T14:11:35Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Completely Positive Map for Noisy Driven Quantum Systems Derived by Keldysh Expansion [39.58317527488534]
  We introduce a decoherence model based on the Keldysh formalism. This formalism allows us to include non-periodic drives and correlated quantum noise in our model. We demonstrate that this strategy generates pulses that mitigate correlated quantum noise in qubit state-transfer and gate operations.
  arXiv  Detail & Related papers  (2023-03-20T23:05:24Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [48.491303218786044]
  TeD-Q is an open-source software framework for quantum machine learning.<n>It seamlessly integrates classical machine learning libraries with quantum simulators.<n>It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• A kernel-based quantum random forest for improved classification [0.0]
  Quantum Machine Learning (QML) to enhance traditional classical learning methods has seen various limitations to its realisation. We extend the linear quantum support vector machine (QSVM) with kernel function computed through quantum kernel estimation (QKE) To limit overfitting, we further extend the model to employ a low-rank Nystr"om approximation to the kernel matrix.
  arXiv  Detail & Related papers  (2022-10-05T15:57:31Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations [0.0]
  Quantum Annealing (QA) is one of the most promising frameworks for quantum optimization. We show that the adiabatic time evolution of QA can be efficiently represented as a suitable Network. We show that the optimized state, expressed as a Matrix Product State (MPS), can be recast into a Quantum Circuit.
  arXiv  Detail & Related papers  (2022-08-30T18:00:14Z)
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices [3.1952399274829775]
  We develop a tool called quantum eigenvalue transformation of unitary matrices with reals (QET-U) This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model.
  arXiv  Detail & Related papers  (2022-04-12T17:11:40Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach [0.0]
  We propose a method for computing space-resolved correlation properties of the two-dimensional Hubbard model within a quantum-classical embedding strategy. We solve a two-impurity embedded model requiring eight qubits with an advanced hybrid scheme on top of the Variational Quantum Eigensolver algorithm. This paves the way to a controlled solution of the Hubbard model with larger and larger embedded problems solved by quantum computers.
  arXiv  Detail & Related papers  (2021-08-24T14:58:14Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.