Virtual linear map algorithm for classical boost in near-term quantum computing

• URL: http://arxiv.org/abs/2207.01360v1
• Date: Mon, 4 Jul 2022 12:34:26 GMT
• Title: Virtual linear map algorithm for classical boost in near-term quantum computing
• Authors: Guillermo Garc\'ia-P\'erez, Elsi-Mari Borrelli, Matea Leahy, Joonas Malmi, Sabrina Maniscalco, Matteo A. C. Rossi, Boris Sokolov, Daniel Cavalcanti
• Abstract summary: We introduce the Virtual Linear Map Algorithm (VILMA) VILMA estimates multiple operator averages using classical post-processing of informationally complete measurement outcomes. We show that VILMA allows for the variational optimisation of the virtual circuit through sequences of efficient linear programs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapid progress in quantum computing witnessed in recent years has sparked widespread interest in developing scalable quantum information theoretic methods to work with large quantum systems. For instance, several approaches have been proposed to bypass tomographic state reconstruction, and yet retain to a certain extent the capability to estimate multiple physical properties of a given state previously measured. In this paper, we introduce the Virtual Linear Map Algorithm (VILMA), a new method that enables not only to estimate multiple operator averages using classical post-processing of informationally complete measurement outcomes, but also to do so for the image of the measured reference state under low-depth circuits of arbitrary, not necessarily physical, $k$-local maps. We also show that VILMA allows for the variational optimisation of the virtual circuit through sequences of efficient linear programs. Finally, we explore the purely classical version of the algorithm, in which the input state is a state with a classically efficient representation, and show that the method can prepare ground states of many-body Hamiltonians.

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)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Learning topological states from randomized measurements using variational tensor network tomography [0.4818215922729967]
  Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. We implement and study a tomographic method that combines variational optimization on tensor networks with randomized measurement techniques. We demonstrate its ability to learn the ground state of the surface code Hamiltonian as well as an experimentally realizable quantum spin liquid state.
  arXiv  Detail & Related papers  (2024-05-31T21:05:43Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Realizing Non-Physical Actions through Hermitian-Preserving Map Exponentiation [1.0255759863714506]
  We introduce the Hermitian-preserving mapiation algorithm, which can effectively realize the action of an arbitrary Hermitian-preserving map by encoding its output into a quantum process. Our findings present a pathway for systematically and efficiently implementing non-physical actions with quantum devices.
  arXiv  Detail & Related papers  (2023-08-15T18:00:04Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• 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)
• Iterative Quantum Assisted Eigensolver [0.0]
  We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian. Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
  arXiv  Detail & Related papers  (2020-10-12T12:25:16Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)

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.