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

• URL: http://arxiv.org/abs/2310.06031v2
• Date: Mon, 18 Mar 2024 02:47:16 GMT
• Title: Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
• Authors: Tianqi Chen, Tim Byrnes,
• Abstract summary: We propose a method to prepare the ground state of the Affleck-Lieb-Kennedy-Tasaki model deterministically. We show that it can be prepared efficiently using the MITE approach. We show that the procedure is compatible with qubit-based simulators.
• Score: 2.5938976557097715
• License: http://creativecommons.org/licenses/by/4.0/
• 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 conveargence. 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.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• 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)
• Adaptive measurement strategy for quantum subspace methods [0.0]
  We propose an adaptive measurement optimization method that is useful for the quantum subspace methods. The proposed method first determines the measurement protocol for classically simulatable states, and then adaptively updates the protocol of quantum subspace expansion. As a numerical demonstration, we have shown for excited-state simulation of molecules that we are able to reduce the number of measurements by an order of magnitude.
  arXiv  Detail & Related papers  (2023-11-14T04:00:59Z)
• Demonstration of machine-learning-enhanced Bayesian quantum state estimation [0.0]
  We experimentally realize an approach for defining custom prior distributions that are automatically tuned using machine learning. We show that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution.
  arXiv  Detail & Related papers  (2022-12-15T18:41:15Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements [0.2007262412327553]
  The ground state of the spin-1 Affleck, Kennedy, Lieb and TasakiAKLT model is a paradigmatic example of both a matrix product state and a symmetry-protected topological phase. Having a nonzero correlation length, the AKLT state cannot be exactly prepared by a constant-depth unitary circuit composed of local gates. We demonstrate that this no-go limit can be evaded by augmenting a constant-depth circuit with fusion measurements.
  arXiv  Detail & Related papers  (2022-10-31T17:58:01Z)
• Regression of high dimensional angular momentum states of light [47.187609203210705]
  We present an approach to reconstruct input OAM states from measurements of the spatial intensity distributions they produce. We showcase our approach in a real photonic setup, generating up-to-four-dimensional OAM states through a quantum walk dynamics.
  arXiv  Detail & Related papers  (2022-06-20T16:16:48Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Efficient State Preparation for Quantum Amplitude Estimation [0.951828574518325]
  Quantum Amplitude Estimation can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic. We introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly.
  arXiv  Detail & Related papers  (2020-05-15T18:00:01Z)

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.