Optimization for expectation value estimation with shallow quantum circuits

• URL: http://arxiv.org/abs/2407.19499v1
• Date: Sun, 28 Jul 2024 14:04:33 GMT
• Title: Optimization for expectation value estimation with shallow quantum circuits
• Authors: Bujiao Wu, Yuxuan Yan, Fuchuan Wei, Zhenhuan Liu,
• Abstract summary: Estimating linear properties of quantum states is a fundamental task in quantum information science. We propose a framework that optimize sample complexity for estimating the expectation value of any observable using a shallow parameterized quantum circuit. We numerically demonstrate the performance of our algorithm by estimating the ground energy of a sparse Hamiltonian and the inner product of two pure states.
• Score: 1.5733643545082079
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Estimating linear properties of quantum states, such as fidelities, molecular energies, and correlation functions, is a fundamental task in quantum information science. The classical shadow has emerged as a prevalent tool due to its efficiency in estimating many independent observables simultaneously. However, it does not utilize the information of the target observable and the constraints of quantum devices, making it inefficient in many practical scenarios where the focus is on estimating a select few observables. To address this inefficiency, we propose a framework that optimizes sample complexity for estimating the expectation value of any observable using a shallow parameterized quantum circuit. Within this framework, we introduce a greedy algorithm that decomposes the target observable into a linear combination of multiple observables, each of which can be diagonalized with the shallow circuit. Using this decomposition, we then apply an importance sampling algorithm to estimate the expectation value of the target observable. We numerically demonstrate the performance of our algorithm by estimating the ground energy of a sparse Hamiltonian and the inner product of two pure states, highlighting the advantages compared to some conventional methods. Additionally, we derive the fundamental lower bound for the sample complexity required to estimate a target observable using a given shallow quantum circuit, thereby enhancing our understanding of the capabilities of shallow circuits in quantum learning tasks.

Related papers

• 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)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Quantum Kernel t-Distributed Stochastic Neighbor Embedding [0.9002260638342727]
  We propose a quantum data visualization method using quantum kernels, which enables us to offer fast and highly accurate visualization of quantum states. In our numerical experiments, we visualize hand-written digits dataset and apply $k$-nearest neighbor algorithm to the low-dimensional data.
  arXiv  Detail & Related papers  (2023-12-01T05:00:02Z)
• Simultaneous Measurement of Multiple Incompatible Observables and Tradeoff in Multiparameter Quantum Estimation [1.0104586293349587]
  We provide a framework to study the implementation of an arbitrary finite number of observables with a single measurement. Our work paves the way for optimizing various tasks in quantum information science that involve multiple noncommutative observables.
  arXiv  Detail & Related papers  (2023-10-18T12:41:35Z)
• Inferring interpretable dynamical generators of local quantum observables from projective measurements through machine learning [17.27816885271914]
  We utilize a machine-learning approach to infer the dynamical generator governing the evolution of local observables in a many-body system from noisy data. Our method is not only useful for extracting effective dynamical generators from many-body systems, but may also be applied for inferring decoherence mechanisms of quantum simulation and computing platforms.
  arXiv  Detail & Related papers  (2023-06-06T18:01:18Z)
• Estimating properties of a quantum state by importance-sampled operator shadows [1.3854792306663213]
  We provide a simple method for estimating the expectation value of observables with an unknown quantum state. The time complexity to construct the data structure is $2O(k)$ for $k$-local observables, similar to the post-processing time of classical shadows.
  arXiv  Detail & Related papers  (2023-05-16T11:56:32Z)
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping [55.47824411563162]
  Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. We develop a practical, efficient estimation strategy, which we call ShadowGrouping.
  arXiv  Detail & Related papers  (2023-01-09T14:41:07Z)
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables [0.0]
  We introduce a method for performing a single joint measurement that can be implemented locally. We derive bounds on the number of experimental repetitions required to estimate energies up to a certain precision. We adapt the joint measurement strategy to minimise the sample complexity when the implementation of measurements is assumed noisy.
  arXiv  Detail & Related papers  (2022-06-17T17:42:54Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Post-Training Quantization for Vision Transformer [85.57953732941101]
  We present an effective post-training quantization algorithm for reducing the memory storage and computational costs of vision transformers. We can obtain an 81.29% top-1 accuracy using DeiT-B model on ImageNet dataset with about 8-bit quantization.
  arXiv  Detail & Related papers  (2021-06-27T06:27:22Z)

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.