Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers

• URL: http://arxiv.org/abs/2207.07725v2
• Date: Wed, 21 Sep 2022 09:48:14 GMT
• Title: Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Authors: Bruno Murta, Pedro M. Q. Cruz and J. Fern\'andez-Rossier
• Abstract summary: We propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions. VBS states are the exact ground states of a class of interacting quantum spin models introduced by Affleck, Kennedy, Lieb and Tasaki. We find that schemes to prepare VBS states based on their tensor-network representations yield quantum circuits that are too deep to be within reach of noisy intermediate-scale quantum computers.
• Score: 0.5608803995383594
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum state preparation is a key step in all digital quantum simulation algorithms. Here we propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions, the so-called Valence-Bond-Solid (VBS) states, that are important for two reasons. First, VBS states are the exact ground states of a class of interacting quantum spin models introduced by Affleck, Kennedy, Lieb and Tasaki (AKLT). Second, the two-dimensional VBS states are universal resource states for measurement-based quantum computing. We find that schemes to prepare VBS states based on their tensor-network representations yield quantum circuits that are too deep to be within reach of noisy intermediate-scale quantum (NISQ) computers. We then apply the general non-deterministic method herein proposed to the preparation of the spin-1 and spin-3/2 VBS states, the ground states of the AKLT models defined in one dimension and in the honeycomb lattice, respectively. Shallow quantum circuits of depth independent of the lattice size are explicitly derived for both cases, making use of optimization schemes that outperform standard basis gate decomposition methods. Given the probabilistic nature of the proposed routine, two strategies that achieve a quadratic reduction of the repetition overhead for any VBS state defined on a bipartite lattice are devised. Our approach should permit to use NISQ processors to explore the AKLT model and variants thereof, outperforming conventional numerical methods in the near future.

Related papers

• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Spin coupling is all you need: Encoding strong electron correlation on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. Our work paves the way towards scalable quantum simulation of electronic structure for classically challenging systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• 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)
• Scalable Quantum Ground State Preparation of the Heisenberg Model: A Variational Quantum Eigensolver Approach [0.0]
  Variational Quantumsolver (VQE) algorithm is a system composed of a quantum circuit and a classical Eigenational Quantumsolver. We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model.
  arXiv  Detail & Related papers  (2023-08-23T09:26:34Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Improved iterative quantum algorithm for ground-state preparation [4.921552273745794]
  We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian system. Our approach has advantages including the higher success probability at each iteration, the measurement precision-independent sampling complexity, the lower gate complexity, and only quantum resources are required when the ancillary state is well prepared.
  arXiv  Detail & Related papers  (2022-10-16T05:57:43Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation [61.49303789929307]
  We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
  arXiv  Detail & Related papers  (2021-12-08T23:59:33Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States [1.1999555634662633]
  We introduce a more powerful decision diagram variant, called Local Invertible Map-DD (LIMDD) We prove that the set of quantum states represented by poly-sized LIMDDs strictly contains the union of stabilizer states and other decision diagram variants. LIMDDs thus pave the way for fundamentally more powerful solutions for simulation and analysis of quantum computing.
  arXiv  Detail & Related papers  (2021-08-02T14:24:47Z)

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.