Computationally Efficient Quantum Expectation with Extended Bell Measurements
arXiv:2110.09735 · doi:10.22331/q-2022-04-13-688
Abstract
Evaluating an expectation value of an arbitrary observable through naïve Pauli measurements requires a large number of terms to be evaluated. We approach this issue using a method based on Bell measurement, which we refer to as the extended Bell measurement method. This analytical method quickly assembles the matrix elements into at most groups for simultaneous measurements in time, where is the number of non-zero elements of . The number of groups is particularly small when is a band matrix. When the bandwidth of is , the number of groups for simultaneous measurement reduces to . In addition, when non-zero elements densely fill the band, the variance is , which is small compared with the variances of existing methods. The proposed method requires a few additional gates for each measurement, namely one Hadamard gate, one phase gate and at most CNOT gates. Experimental results on an IBM-Q system show the computational efficiency and scalability of the proposed scheme, compared with existing state-of-the-art approaches. Code is available at https://github.com/ToyotaCRDL/extended-bell-measurements.
arXiv comment33 pages, 12 figures; most of the details of section 2 have been moved to the Appendix; added variance analysis and comparison with the classical shadow; code is available at https://github.com/ToyotaCRDL/extended-bell-measurements
References in corpus (28)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- The theory of variational hybrid quantum-classical algorithms
- A Quantum Approximate Optimization Algorithm
- Quantum machine learning in feature Hilbert spaces
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Circuit-centric quantum classifiers
- Towards Practical Quantum Variational Algorithms
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum autoencoders for efficient compression of quantum data
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Efficient estimation of Pauli observables by derandomization
- Variational algorithms for linear algebra
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Variational Quantum algorithm for Poisson equation
- Measurement reduction in variational quantum algorithms
- A quantum algorithm to train neural networks using low-depth circuits
- Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
- Efficient evaluation of quantum observables using entangled measurements
- Near-term quantum algorithms for linear systems of equations
- Variational quantum eigensolvers for sparse Hamiltonians
- Quantum Computing: Lecture Notes
- Pauli Partitioning with Respect to Gate Sets
Cited by in corpus (7)
- Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits
- Classical shadows based on locally-entangled measurements
- Variational quantum algorithm for generalized eigenvalue problems and its application to the finite element method
- Hardware-efficient entangled measurements for variational quantum algorithms
- Quantum topology optimization of ground structures using noisy intermediate-scale quantum devices
- Photonic variational quantum eigensolver using entanglement measurements
- A variational quantum eigensolver tailored to multi-band tight-binding simulations of electronic structures