Preparing low-variance states using a distributed quantum algorithm

• URL: http://arxiv.org/abs/2501.13097v1
• Date: Wed, 22 Jan 2025 18:55:51 GMT
• Title: Preparing low-variance states using a distributed quantum algorithm
• Authors: Xiaoyu Liu, Benjamin F. Schiffer, Jordi Tura,
• Abstract summary: We present a distributed quantum algorithm inspired by iterative phase estimation to prepare low-variance states. Our method uses a single auxiliary qubit per quantum device, which controls its dynamics, and a postselection strategy for a joint quantum measurement on such auxiliary qubits. This allows us to demonstrate that our distributed algorithm reduces the energy variance significantly faster compared to single-device implementations.
• Score: 2.1587559138197667
• License:
• Abstract: Quantum computers are a highly promising tool for efficiently simulating quantum many-body systems. The preparation of their eigenstates is of particular interest and can be addressed, e.g., by quantum phase estimation algorithms. The routine then acts as an effective filtering operation, reducing the energy variance of the initial state. In this work, we present a distributed quantum algorithm inspired by iterative phase estimation to prepare low-variance states. Our method uses a single auxiliary qubit per quantum device, which controls its dynamics, and a postselection strategy for a joint quantum measurement on such auxiliary qubits. In the multi-device case, the result of this measurement heralds the successful runs of the protocol. This allows us to demonstrate that our distributed algorithm reduces the energy variance significantly faster compared to single-device implementations, thereby highlighting the potential of distributed algorithms for near-term and early fault-tolerant devices.

Related papers

• Dynamic Circuits for the Quantum Lattice-Boltzmann Method [0.0]
  We propose a quantum algorithm for the linear advection-diffusion equation (ADE) Lattice-Boltzmann method (LBM) Dynamic quantum circuits allow for an optimized collision-operator quantum algorithm, introducing partial measurements as an integral step.
  arXiv  Detail & Related papers  (2025-02-04T09:04:24Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers [0.5999777817331317]
  We introduce quantum algorithms for ground-state energy estimation (GSEE) First algorithm estimates ground-state energies, offering a quadratic improvement on the ground state overlap parameter compared to other methods in this regime. Second algorithm certifies that the estimated ground-state energy is within a specified error tolerance of the true ground-state energy.
  arXiv  Detail & Related papers  (2023-04-19T17:27:26Z)
• Quantum State Preparation of Normal Distributions using Matrix Product States [0.4604003661048266]
  We generate quantum states encoding a class of normal probability distributions in a trapped ion quantum computer for up to 20 qubits. Our work provides a study in quantum hardware for scalable distribution loading, which is the basis of a wide range of algorithms that provide quantum advantage.
  arXiv  Detail & Related papers  (2023-03-02T20:27:25Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.