Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.02367

Quantum State Engineering Under Multiple Expectation-Value Constraints

Anjali Mahapatra, Gururaj Kadiri

quant-phSubmitted May 4, 2026• Announced May 5, 2026• 0 citations
arXivHTMLPDF

Abstract

This work introduces a formulation of quantum state engineering termed expectation-value targeting: the task of preparing a pure state whose expectation values with respect to a prescribed set of observables attain specified targets. This formulation subsumes standard ground-state preparation problems in quantum chemistry and many-body physics, while extending beyond variational energy minimization to multi-constraint state synthesis. The problem amounts to solving a system of nonlinear constraints on an exponentially large state space, for which no general efficient classical approaches are known. Variational quantum algorithms tackle this problem by restricting the search to a low-dimensional parameter space, and relying on classical optimization techniques for solutions. However, these approaches can become extremely ineffective for the present problem, where competing constraints can induce rugged landscapes and vanishing gradients (barren plateaus). Adaptive variational methods, in which the ansatz is constructed iteratively from a pool of candidate operators rather than fixed in advance, have been developed primarily for ground-state preparation. However, we show that the present problem also admits a similar construction. We introduce QUEST (Quantum Unitary Engineering of States to Target), a framework purpose-built for expectation-value targeting, in which the engineered state is constructed as a depth-adaptive sequence of Pauli rotations, with each rotation chosen to descend a sum-of-squared-residuals cost. QUEST provides a constructive route to expectation-value targeting, building the engineered state one Pauli rotation at a time, and establishes adaptive synthesis as a primitive for state preparation under multiple, potentially inconsistent target constraints.

Related papers

Efficient estimation and sequential optimization of cost functions in variational quantum algorithms

Muhammad Umer, Eleftherios Mastorakis, Dimitris G. Angelakis

Abstract Classical optimization is a cornerstone of the success of variational quantum algorithms, which often require determining the derivatives of the cost function relative to variational parameters. The computation of the cost function and its derivatives, coupled with their effective utilization, facilitates faster convergence by enabling smooth navigation through complex landscapes, ensuring the algorithm’s success in addressing challenging variational problems. In this work, we introduce a novel problem-tailored optimization methodology that conceptualizes the parameterized quantum circuit as a weighted sum of distinct unitary operators, enabling the cost function to be expressed as a sum of multiple terms. This representation facilitates the efficient evaluation of nonlocal characteristics of cost functions, as well as their arbitrary derivatives. The optimization protocol then utilizes the nonlocal information on the cost function to facilitate a more efficient navigation process, ultimately enhancing the performance in the pursuit of optimal solutions. We utilize this methodology for two distinct cost functions. The first is the squared residual of the variational state relative to a target state, which is subsequently employed to examine the nonlinear dynamics of fluid configurations governed by the one-dimensional Burgers’ equation. The second cost function is the expectation value of an observable, which is later utilized to approximate the ground state of the nonlinear Schrödinger equation. Our findings reveal substantial enhancements in convergence speed and accuracy relative to traditional optimization methods, even within complex, high-dimensional landscapes. Our work contributes to the advancement of optimization strategies for variational quantum algorithms, establishing a robust framework for addressing a range of computationally intensive problems across numerous applications.

arXiv:2412.20972•Quantum Science and Technology•May 7, 2025•2 citations

Enhancing the reachability of variational quantum algorithms via input-state design

Shaojun Wu, Shan Jin, Abolfazl Bayat +1 more

Variational quantum algorithms (VQAs) are constrained by a trade-off: deeper circuits can cover a larger reachable quantum states but suffer from barren plateaus, while shallow circuits remain trainable yet can have insufficient reachability to the target state. Here, we propose a general framework to address this challenge by enhancing the VQA performance with a designed input state constructed using a linear combination technique. This approach modifies the set of states reachable by the original circuit, enhancing accuracy while preserving efficiency. We provide a rigorous proof that such framework increases the performance of any given VQA ansatz, and demonstrate its broad applicability across different ansatz families. In ground state preparation for representative quantum many-body models, it achieves consistently higher accuracy than standard methods at the same gate budget. These results highlight input-state design as a powerful complement to circuit design for improving reachability of the target state within a fixed ansatz. Variational quantum algorithms face a practical trade-off between circuit depth and trainability, which limits the reachability of target quantum states. Here, the authors show that input-state design based on linear combinations systematically modifies the reachable-state set of a fixed ansatz, thereby enhancing target-state reachability and improving ground-state preparation accuracy across representative quantum many-body models without increasing gate cost.

arXiv:2510.26379•Communications Physics•Apr 7, 2026•3 citations

Warm Starts, Cold States: Exploiting Adiabaticity for Variational Ground-States

Ricard Puig, Berta Casas, Alba Cervera-Lierta +2 more

Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been proposed to tackle this problem, including variational methods. However, variational training often struggle to navigate complex energy landscapes, frequently encountering suboptimal local minima or suffering from barren plateaus. In this work, we introduce an iterative strategy for ground-state preparation based on a stepwise (discretized) Hamiltonian deformation. By complementing the Variational Quantum Eigensolver (VQE) with adiabatic principles, we demonstrate that solving a sequence of intermediate problems facilitates tracking the ground-state manifold toward the target system, even as we scale the system size. We provide a rigorous theoretical foundation for this approach, proving a lower bound on the loss variance that suggests trainability throughout the deformation, provided the system remains away from gap closings. Numerical simulations, including the effects of shot noise, confirm that this path-dependent tracking consistently converges to the target ground state.

quant-pharXiv:2602.06137•Feb 9, 2026•7 citations

Observable-targeted variational quantum simulation of Hamiltonian dynamics

Leonardo Zambrano, Luciano Pereira, Antonio Acín

Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.

quant-pharXiv:2609.24794•Sep 22, 2026•0 citations

Randomized adaptive quantum state preparation

Alicia B Magann, Sophia E. Economou, Christian Arenz

We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems.

arXiv:2301.04201•Physical Review Research•Sep 29, 2023•22 citations

A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations

Xiaopeng Li, Zhijie Sun, Yi Fan +3 more

Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.

quant-pharXiv:2606.28952•Jun 30, 2026•1 citation
This work introduces a formulation of quantum state engineering termed expectation-value targeting: the task of preparing a pure state whose expectation values with respect to a prescribed set of observables attain specified targets. This formulation subsumes standard ground-state preparation problems in quantum chemistry and many-body physics, while extending beyond variational energy minimization to multi-constraint state synthesis. The problem amounts to solving a system of nonlinear constraints on an exponentially large state space, for which no general efficient classical approaches are known. Variational quantum algorithms tackle this problem by restricting the search to a low-dimensional parameter space, and relying on classical optimization techniques for solutions. However, these approaches can become extremely ineffective for the present problem, where competing constraints can induce rugged landscapes and vanishing gradients (barren plateaus). Adaptive variational methods, in which the ansatz is constructed iteratively from a pool of candidate operators rather than fixed in advance, have been developed primarily for ground-state preparation. However, we show that the present problem also admits a similar construction. We introduce QUEST (Quantum Unitary Engineering of States to Target), a framework purpose-built for expectation-value targeting, in which the engineered state is constructed as a depth-adaptive sequence of Pauli rotations, with each rotation chosen to descend a sum-of-squared-residuals cost. QUEST provides a constructive route to expectation-value targeting, building the engineered state one Pauli rotation at a time, and establishes adaptive synthesis as a primitive for state preparation under multiple, potentially inconsistent target constraints.
Abstract Classical optimization is a cornerstone of the success of variational quantum algorithms, which often require determining the derivatives of the cost function relative to variational parameters. The computation of the cost function and its derivatives, coupled with their effective utilization, facilitates faster convergence by enabling smooth navigation through complex landscapes, ensuring the algorithm’s success in addressing challenging variational problems. In this work, we introduce a novel problem-tailored optimization methodology that conceptualizes the parameterized quantum circuit as a weighted sum of distinct unitary operators, enabling the cost function to be expressed as a sum of multiple terms. This representation facilitates the efficient evaluation of nonlocal characteristics of cost functions, as well as their arbitrary derivatives. The optimization protocol then utilizes the nonlocal information on the cost function to facilitate a more efficient navigation process, ultimately enhancing the performance in the pursuit of optimal solutions. We utilize this methodology for two distinct cost functions. The first is the squared residual of the variational state relative to a target state, which is subsequently employed to examine the nonlinear dynamics of fluid configurations governed by the one-dimensional Burgers’ equation. The second cost function is the expectation value of an observable, which is later utilized to approximate the ground state of the nonlinear Schrödinger equation. Our findings reveal substantial enhancements in convergence speed and accuracy relative to traditional optimization methods, even within complex, high-dimensional landscapes. Our work contributes to the advancement of optimization strategies for variational quantum algorithms, establishing a robust framework for addressing a range of computationally intensive problems across numerous applications.
Variational quantum algorithms (VQAs) are constrained by a trade-off: deeper circuits can cover a larger reachable quantum states but suffer from barren plateaus, while shallow circuits remain trainable yet can have insufficient reachability to the target state. Here, we propose a general framework to address this challenge by enhancing the VQA performance with a designed input state constructed using a linear combination technique. This approach modifies the set of states reachable by the original circuit, enhancing accuracy while preserving efficiency. We provide a rigorous proof that such framework increases the performance of any given VQA ansatz, and demonstrate its broad applicability across different ansatz families. In ground state preparation for representative quantum many-body models, it achieves consistently higher accuracy than standard methods at the same gate budget. These results highlight input-state design as a powerful complement to circuit design for improving reachability of the target state within a fixed ansatz. Variational quantum algorithms face a practical trade-off between circuit depth and trainability, which limits the reachability of target quantum states. Here, the authors show that input-state design based on linear combinations systematically modifies the reachable-state set of a fixed ansatz, thereby enhancing target-state reachability and improving ground-state preparation accuracy across representative quantum many-body models without increasing gate cost.
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been proposed to tackle this problem, including variational methods. However, variational training often struggle to navigate complex energy landscapes, frequently encountering suboptimal local minima or suffering from barren plateaus. In this work, we introduce an iterative strategy for ground-state preparation based on a stepwise (discretized) Hamiltonian deformation. By complementing the Variational Quantum Eigensolver (VQE) with adiabatic principles, we demonstrate that solving a sequence of intermediate problems facilitates tracking the ground-state manifold toward the target system, even as we scale the system size. We provide a rigorous theoretical foundation for this approach, proving a lower bound on the loss variance that suggests trainability throughout the deformation, provided the system remains away from gap closings. Numerical simulations, including the effects of shot noise, confirm that this path-dependent tracking consistently converges to the target ground state.
Standard variational quantum simulation seeks to reproduce the evolution of the full quantum state, although many applications require only the expectation values of a few observables. We study a variational method for pure-state Hamiltonian dynamics that updates circuit parameters to reproduce the evolution of selected expectation values. An exact error identity guides the choice of observables, motivating a construction based on repeated commutators of the target with the Hamiltonian. For Pauli observables and Pauli-rotation circuits, the update can be estimated without ancillary qubits or controlled operations for overlap estimation. Across six- and ten-qubit spin, fermionic, and molecular benchmarks, the observable-targeted update extends the median time within the target-error tolerance compared with standard variational quantum simulation with equal shot budgets. These results show that directing the variational update toward the target observable can extend accurate simulation without increasing the measurement cost per time step.
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems.
Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.