PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
- URL: http://arxiv.org/abs/2301.00560v2
- Date: Sat, 16 Dec 2023 11:44:49 GMT
- Title: PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
- Authors: Sebasti\'an V. Romero and Juan Santos-Su\'arez
- Abstract summary: We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices.
This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations.
As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce a simple algorithm that efficiently computes tensor products of
Pauli matrices. This is done by tailoring the calculations to this specific
case, which allows to avoid unnecessary calculations. The strength of this
strategy is benchmarked against state-of-the-art techniques, showing a
remarkable acceleration. As a side product, we provide an optimized method for
one key calculus in quantum simulations: the Pauli basis decomposition of
Hamiltonians.
Related papers
- Efficiently manipulating Pauli strings with PauliArray [0.0]
Pauli matrices and Pauli strings are widely used in quantum computing.
It is important to have a well-rounded, versatile and efficient tool to handle a large number of Pauli strings and operators expressed in this basis.
This library introduces data structures to represent arrays of Pauli strings and operators as well as various methods to modify and combine them.
arXiv Detail & Related papers (2024-05-29T17:18:08Z) - Tensor networks based quantum optimization algorithm [0.0]
In optimization, one of the well-known classical algorithms is power iterations.
We propose a quantum realiziation to circumvent this pitfall.
Our methodology becomes instance agnostic and thus allows one to address black-box optimization within the framework of quantum computing.
arXiv Detail & Related papers (2024-04-23T13:49:11Z) - Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
We introduce an algorithm for data quantization based on the principles of Kashin representation.
Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
arXiv Detail & Related papers (2024-04-15T12:38:46Z) - A tree-approach Pauli decomposition algorithm with application to quantum computing [0.0]
We propose an algorithm with a parallel implementation that optimize this decomposition using a tree approach.
We also explain how some particular matrix structures can be exploited to reduce the number of operations.
arXiv Detail & Related papers (2024-03-18T10:38:06Z) - Decomposing dense matrices into dense Pauli tensors [0.0]
We derive a fixed-memory, branchless algorithm to compute the inner product between a 2N-by-2N complex matrix and an N-term Pauli tensor in O(2N) time.
Our scheme permits the embarrassingly parallel decomposition of a matrix into a weighted sum of Pauli strings in O(8N) time.
arXiv Detail & Related papers (2024-01-29T18:18:11Z) - Tensorized Pauli decomposition algorithm [0.0]
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication.
We show that the algorithm admits the best known worst-case scaling and more favorable runtimes for many practical examples.
arXiv Detail & Related papers (2023-10-20T11:15:23Z) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - Iterative Qubit Coupled Cluster using only Clifford circuits [52.77024349608834]
We draw attention to a variant of the iterative qubit coupled cluster (iQCC) method that only uses Clifford circuits.
This method is useful for near-term variational quantum algorithm applications as it generates good initial parameters.
It may also be useful beyond the NISQ era to create short-depth Clifford pre-optimized circuits.
arXiv Detail & Related papers (2022-11-18T20:31:10Z) - Isotropic Gaussian Processes on Finite Spaces of Graphs [71.26737403006778]
We propose a principled way to define Gaussian process priors on various sets of unweighted graphs.
We go further to consider sets of equivalence classes of unweighted graphs and define the appropriate versions of priors thereon.
Inspired by applications in chemistry, we illustrate the proposed techniques on a real molecular property prediction task in the small data regime.
arXiv Detail & Related papers (2022-11-03T10:18:17Z) - Adversarially-Trained Nonnegative Matrix Factorization [77.34726150561087]
We consider an adversarially-trained version of the nonnegative matrix factorization.
In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix.
We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices.
arXiv Detail & Related papers (2021-04-10T13:13:17Z) - Approximation Algorithms for Sparse Principal Component Analysis [57.5357874512594]
Principal component analysis (PCA) is a widely used dimension reduction technique in machine learning and statistics.
Various approaches to obtain sparse principal direction loadings have been proposed, which are termed Sparse Principal Component Analysis.
We present thresholding as a provably accurate, time, approximation algorithm for the SPCA problem.
arXiv Detail & Related papers (2020-06-23T04:25:36Z)
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.