Resource-adaptive quantum flow algorithms for quantum simulations of many-body systems: sub-flow embedding procedures

• URL: http://arxiv.org/abs/2410.11992v1
• Date: Tue, 15 Oct 2024 19:00:33 GMT
• Title: Resource-adaptive quantum flow algorithms for quantum simulations of many-body systems: sub-flow embedding procedures
• Authors: Karol Kowalski, Nicholas P. Bauman,
• Abstract summary: We utilize the quantum flow (QFlow) method to perform quantum simulations of correlated systems. Our research demonstrates that the circuits for evaluating the low dimensionality subproblems are significantly less complex than the parent problem. Our findings shed light on the potential of QFlow in efficiently handling correlated systems via quantum simulations.
• Score: 0.20462238493547852
• License:
• Abstract: In this study, we utilized the quantum flow (QFlow) method to perform quantum simulations of correlated systems. The QFlow approach allows for sampling large sub-spaces of the Hilbert space by solving coupled variational problems in reduced dimensionality active spaces. Our research demonstrates that the circuits for evaluating the low dimensionality subproblems of the QFlow algorithms on quantum computers are significantly less complex than the parent (large subspace of the Hilbert space) problem, opening up possibilities for scalable and constant-circuit-depth quantum computing. Our simulations indicate that QFlow can be used to optimize a large number of wave function parameters without an increase in the required number of qubits. We were able to showcase that a variation of the QFlow procedure can optimize 1,100 wave function parameters using modest quantum resources. Furthermore, we investigated an adaptive approach known as the sub-flow approach, which involves a limited number of active spaces in the quantum flow process. Our findings shed light on the potential of QFlow in efficiently handling correlated systems via quantum simulations.

Related papers

• Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges [0.0]
  Development of quantum processors capable of handling practical fluid flow problems represents a distant yet promising frontier. Recent strides in quantum algorithms, particularly linear solvers, have illuminated the path toward quantum solutions for classical fluid flow solvers. In this study, we examine the capability of a canonical QLSA, the Harrow-Hassidim-Lloyd (HHL) algorithm, in accurately solving the system of linear equations governing an idealized fluid flow problem.
  arXiv  Detail & Related papers  (2024-09-17T02:44:08Z)
• 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)
• 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)
• A circuit-generated quantum subspace algorithm for the variational quantum eigensolver [0.0]
  We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE) In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Variational Quantum Eigensolvers with Quantum Gaussian Filters for solving ground-state problems in quantum many-body systems [2.5425769156210896]
  We present a novel quantum algorithm for approximating the ground-state in quantum many-body systems. Our approach integrates Variational Quantum Eigensolvers (VQE) with Quantum Gaussian Filters (QGF) Our method shows improved convergence speed and accuracy, particularly under noisy conditions.
  arXiv  Detail & Related papers  (2024-01-24T14:01:52Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum flow algorithms for simulating many-body systems on quantum computers [0.0]
  We conduct quantum simulations of strongly correlated systems using the quantum flow (QFlow) approach. Our QFlow algorithms significantly reduce circuit complexity and pave the way for scalable and constant-circuit-depth quantum computing.
  arXiv  Detail & Related papers  (2023-05-09T04:30:36Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Optimal quantum simulation of open quantum systems [1.9551668880584971]
  Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. We develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems.
  arXiv  Detail & Related papers  (2020-12-14T14:00:36Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.