Towards enhancing quantum expectation estimation of matrices through partial Pauli decomposition techniques and post-processing
- URL: http://arxiv.org/abs/2401.17640v2
- Date: Mon, 6 May 2024 06:18:37 GMT
- Title: Towards enhancing quantum expectation estimation of matrices through partial Pauli decomposition techniques and post-processing
- Authors: Dingjie Lu, Yangfan Li, Dax Enshan Koh, Zhao Wang, Jun Liu, Zhuangjian Liu,
- Abstract summary: We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M in mathbbC2ntimes 2n$ on a quantum computer.
- Score: 7.532969638222725
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M \in \mathbb{C}^{2^n\times 2^n}$ on a quantum computer. In contrast to conventional methods like the Pauli decomposition that utilize $4^n$ distinct quantum circuits for this task, our technique employs at most $2^n$ unique circuits, with even fewer required for matrices with limited bandwidth. Termed the \textit{partial Pauli decomposition}, our method involves observables formed as the Kronecker product of a single-qubit Pauli operator and orthogonal projections onto the computational basis. By measuring each such observable, one can simultaneously glean information about $2^n$ distinct entries of $M$ through post-processing of the measurement counts. This reduction in quantum resources is especially crucial in the current noisy intermediate-scale quantum era, offering the potential to accelerate quantum algorithms that rely heavily on expectation estimation, such as the variational quantum eigensolver and the quantum approximate optimization algorithm.
Related papers
- Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$.
We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
arXiv Detail & Related papers (2024-07-24T14:21:41Z) - Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and
versatile quantum phase estimation method [14.142389771513786]
This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS)
QMEGS is the first algorithm to simultaneously satisfy the Heisenberg-limited scaling without relying on any spectral gap assumption.
Numerical results validate the efficiency of our proposed algorithm in various regimes.
arXiv Detail & Related papers (2024-02-01T20:55:11Z) - Classical variational optimization of PREPARE circuit for quantum phase
estimation of quantum chemistry Hamiltonians [0.8009842832476994]
We propose a method for constructing $textttPREPARE$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry.
The $textttPREPARE$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes.
arXiv Detail & Related papers (2023-08-26T05:32:38Z) - Applicability of Measurement-based Quantum Computation towards
Physically-driven Variational Quantum Eigensolver [18.876952671920137]
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) - Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach [1.806183113759115]
Large-scale variational quantum algorithms are widely recognized as a potential pathway to achieve quantum advantages.
We present a novel $gammaPPP method based on the integral path of observables back-propagation on paths.
We conduct classical simulations of IBM's zeronoised experimental results on the 127-qubit Eagle processor.
arXiv Detail & Related papers (2023-06-09T10:42:07Z) - Robust Dequantization of the Quantum Singular value Transformation and
Quantum Machine Learning Algorithms [0.0]
We show how many techniques from randomized linear algebra can be adapted to work under this weaker assumption.
We also apply these results to obtain a robust dequantization of many quantum machine learning algorithms.
arXiv Detail & Related papers (2023-04-11T02:09:13Z) - Pricing multi-asset derivatives by variational quantum algorithms [0.6181093777643575]
We use variational quantum simulation to solve the Black-Scholes equation and compute the derivative price from the inner product between the solution and a probability distribution.
This avoids the measurement bottleneck of the naive approach and would provide quantum speedup even in noisy quantum computers.
arXiv Detail & Related papers (2022-07-04T09:11:15Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Halving the cost of quantum multiplexed rotations [0.0]
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls.
Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
arXiv Detail & Related papers (2021-10-26T06:49:44Z) - The Quantum Wasserstein Distance of Order 1 [16.029406401970167]
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits.
The proposed distance is invariant with respect to permutations of the qudits and unitary operations acting on one qudit.
We also propose a generalization of the Lipschitz constant to quantum observables.
arXiv Detail & Related papers (2020-09-09T18:00:01Z)
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.