Approximate Quantum State Preparation Through Proximal Policy Optimization

• URL: http://arxiv.org/abs/2607.21121v1
• Date: Thu, 23 Jul 2026 09:55:58 GMT
• Title: Approximate Quantum State Preparation Through Proximal Policy Optimization
• Abstract summary: A quantum architecture search framework for approximate quantum state preparation is proposed.<n>The framework is able to achieve approximation errors of $10-14$.
• Score: 0.6875312133832078
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, a quantum architecture search framework for approximate quantum state preparation (QSP) is proposed. QSP is a challenging task, since the search space grows exponentially with the number of qubits, making the identification of the optimal circuit non-trivial. To address this problem, deep reinforcement learning is employed through an agent based on proximal policy optimization. The objective of the agent is to identify the best possible approximation of the target state while simultaneously minimizing the number of gates used. At each step, the agent appends a new gate to the circuit and recomputes the fidelity between the approximated state and the target states. Various experiments have been performed from 2 to 5 qubits. Both predefined states, such as Bell, GHZ, W, and Dicke states, and completely random states are considered. The proposed framework is able to achieve approximation errors of $10^{-14}$.

Related papers

• 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)
• Sparse quantum state preparation with improved Toffoli cost [0.0]
  Preparation of quantum states is one of the most fundamental tasks in quantum computing.<n>We present an approach that prepares sparse quantum states on $n$ qubits.<n>The speed-up is achieved by designing an efficient algorithm for finding and implementing the isometry.
  arXiv  Detail & Related papers  (2026-01-14T11:28:27Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Double-bracket quantum algorithms for high-fidelity ground state preparation [0.6832937136783648]
  Ground state preparation is a central application for quantum computers.<n>We investigate the performance and gate counts of double-bracket quantum algorithms (DBQAs) for ground state preparation.
  arXiv  Detail & Related papers  (2024-08-07T18:00:00Z)
• A Quantum States Preparation Method Based on Difference-Driven Reinforcement Learning [7.595208396761107]
  This paper proposes a difference-driven reinforcement learning algorithm for quantum state preparation of two-qubit system. It has different degrees of improvement in convergence speed and fidelity of the final quantum state.
  arXiv  Detail & Related papers  (2023-09-29T04:42:11Z)
• 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)
• Quantum Speedup for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection [2.5272389610447856]
  We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem. The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
  arXiv  Detail & Related papers  (2022-05-31T00:14:49Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• The optimal approximation of qubit states with limited quantum states [0.7221806038989489]
  We analytically solve the optimal scheme to find out the closest distance between the objective qubit state and all the possible states convexly mixed by some limited states. We find the least number of states within a given set to optimally construct the objective state and also find that any state can be optimally established by at most four quantum states of the set.
  arXiv  Detail & Related papers  (2022-03-15T12:01:41Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Quantum Logic Gate Synthesis as a Markov Decision Process [0.0]
  We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state or compile a gate. In the presence of gate noise, we demonstrate how the optimal policy adapts to the effects of noisy gates. Our work shows that one can meaningfully impose a discrete, deterministic and non-Markovian quantum evolution.
  arXiv  Detail & Related papers  (2019-12-27T06:36:09Z)

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.