arXiv:2310.06031 · Quantum

Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution

Tianqi Chen, Tim Byrnes

Published Dec 10, 2024• 4 citations

Abstract

Abstract Quantum state preparation plays a crucial role in several areas of quantum information science, in applications such as quantum simulation, quantum metrology and quantum computing. However, typically state preparation requires resources that scale exponentially with the problem size, due to their probabilistic nature or otherwise, making studying such models challenging. In this article, we propose a method to prepare the ground state of the Affleck-Lieb-Kennedy-Tasaki (AKLT) model deterministically using an measurement-based imaginary time evolution (MITE) approach. By taking advantage of the special properties of the AKLT state, we show that it can be prepared efficiently using the MITE approach. Estimates based on the convergence of a sequence of local projections, as well as direct evolution of the MITE algorithm suggest a constant scaling with respect to the number of AKLT sites, which is an exponential improvement over the naive estimate for convergence. We show that the procedure is compatible with qubit-based simulators, and show that using a variational quantum algorithm for circuit recompilation, the measurement operator required for MITE can be well approximated by a circuit with a much shallower circuit depth compared with the one obtained using the default Qiskit method.

DOI: 10.22331/q-2024-12-10-1557

Related papers

Operator-projected variational quantum imaginary time evolution

A. A. Bin Anuar, François Jamet, Fabio Gironella +2 more

Abstract Variational quantum imaginary time evolution (VQITE) is a leading technique for ground state preparation on quantum computers. A significant computational challenge of VQITE is the determination of the quantum geometric tensor. We show that requiring the imaginary-time evolution to be correct only when projected onto a chosen set of operators allows to achieve a twofold reduction in circuit depth by bypassing fidelity estimations, and reduces measurement complexity from quadratic to linear in the number of parameters. We demonstrate by a simulation of the transverse-field Ising model that our algorithm achieves a several orders of magnitude improvement in the number of measurements required for the same accuracy.

arXiv:2409.12018Journal of Physics A Mathematical and TheoreticalJun 2, 20260 citations

A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

Ioannis Kolotouros, Raul Garcia-Patron

Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.

quant-pharXiv:2609.37095Sep 30, 20260 citations

Stochastic Approximation of Variational Quantum Imaginary Time Evolution

Julien Gacon, Christa Zoufal, Giuseppe Carleo +1 more

The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an exponentially large wave function, quantum computers are emerging as a promising platform for this task. However, variational approaches, suitable for near-term quantum computers, struggle with a prohibitive number of measurements and impractical runtimes for relevant system sizes. Here, we suggest a stochastic approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes. Our approach allows trading off invested resources and accuracy, which makes it also suitable for ground state preparation, where simulating the exact dynamics is not required. We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.

arXiv:2305.07059IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 17, 20237 citations

Efficient Quantum Imaginary Time Evolution by Drifting Real-Time Evolution: An Approach with Low Gate and Measurement Complexity

Yifei Huang, Yuguo Shao, Weiluo Ren +2 more

Quantum imaginary time evolution (QITE) is one of the promising candidates for finding the eigenvalues and eigenstates of a Hamiltonian on a quantum computer. However, the original proposal suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. To alleviate the requirement for deep circuits, we propose a time-dependent drifting scheme inspired by the qDRIFT algorithm [Campbell, E. Phys. Rev. Lett. 2019, 123, 070503]. We show that this drifting scheme removes the depth dependency on the size of the operator pool and converges inversely with respect to the number of steps. We further propose a deterministic algorithm that selects the dominant Pauli term to reduce the fluctuation for the ground state preparation. We also introduce an efficient measurement reduction scheme across Trotter steps that removes its cost dependence on the number of iterations. We analyze the main source of error for our scheme both theoretically and numerically. We numerically test the validity of depth reduction, convergence performance of our algorithms, and the faithfulness of the approximation for our measurement reduction scheme on several benchmark molecules. In particular, the results on the LiH molecule give circuit depths comparable to that of the advanced adaptive variational quantum eigensolver (VQE) methods while requiring much fewer measurements.

arXiv:2203.11112Journal of Chemical Theory and ComputationJun 15, 202318 citations

Quantum imaginary-time evolution with polynomial resources in evolution time

Lei Zhang, Jizhe Lai, Xian Wu +1 more

Abstract Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm’s effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.

arXiv:2507.00908Quantum Science and TechnologyJun 10, 20261 citation

Measurement-Based Quantum State Preparation and Ground State Search

Alcalde Puente, Daniel

This thesis introduces and systematically analyzes novel measurement-based quantum state preparation protocols in one dimension, leveraging non-unitary dynamics, quantum measurements, and adaptive feedback mechanisms. Additionally, a stochastic sampling-based approach for ground state search using Projected Entangled Pair States (PEPS) in two dimensions is investigated, further expanding the computational toolkit for simulating complex quantum states. A central contribution is the development of a protocol that employs periodic measurement and resetting of ancilla systems, explicitly applied to the preparation of the one-dimensional Affleck-Kennedy-Lieb-Tasaki (AKLT) state. We identify an optimal reset interval, balancing entanglement generation and convergence speed, and demonstrate robustness against realistic experimental noise such as dephasing. Furthermore, this thesis introduces a self-learning adaptive measurement-feedback framework within variational quantum circuits (VQCs). The proposed framework autonomously discovers efficient, constant-depth strategies for deterministic preparation of specific AKLT edge states, outperforming existing analytical protocols. This analysis uncovers and mitigates previously unknown optimization challenges unique to measurement-feedback-based variational quantum circuits. The thesis also advances two-dimensional ground state search by investigating a sampling-based optimization approach for finite PEPS. It demonstrates that PEPS representing physically realistic states are computationally tractable within this sampling framework, in contrast to random states, whose complexity makes them prohibitively difficult to contract. To quantitatively distinguish between computationally easy and hard-to-contract states, a novel diagnostic measure is introduced. The developed methodology is successfully applied to physically significant states, including chiral spin liquids and Rydberg atom arrays with long-range interactions, highlighting its effectiveness in simulating complex states relevant to state-of-the-art cold atom experiments. Overall, the thesis provides methodological and conceptual insights into measurement-based quantum state preparation, optimization landscapes, and tensor network simulations.

Jan 1, 20250 citations