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

• Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies [0.0]
  QBKSP is a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems.<n>We present three compact quantum circuits tailored to different problem settings for evaluating the required expectation values.
  arXiv  Detail & Related papers  (2025-06-11T17:47:22Z)
• Enhancing the Dynamic Range of Quantum Sensing via Quantum Circuit Learning [0.0]
  In typical quantum sensing protocols, a qubit interacts with an external field, and the amplitude of the field is estimated by analyzing the expectation value of a measured observable.<n>At high qubit densities, inter-qubit interactions induce complex many-body dynamics, resulting in multiple oscillations in the expectation value of the observable.<n>We propose a method to overcome the limitation in quantum metrology by adopting a quantum circuit learning framework.
  arXiv  Detail & Related papers  (2025-05-08T05:40:26Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Measuring Incompatible Observables with Quantum Neural Networks [0.641460223525021]
  Heisenberg uncertainty principle prevents simultaneous measurements of incompatible observables. We show that by implementing a multiple-output QNN that emulates a unital quantum channel, one can measure the expectation values of many incompatible observables simultaneously.
  arXiv  Detail & Related papers  (2025-03-26T14:03:42Z)
• Shadow measurements for feedback-based quantum optimization [0.0]
  We present an implementation of the recently introduced Feedback-based algorithm for quantum optimization (FALQON) with the Ket quantum programming platform. We employ classical shadows for the feedback routine of parameter estimation and compare this approach with the direct estimation of observables. Our results show that depending on the graph geometry for the MaxCut problem, the number of measurements required to estimate expected values of observables with classical shadows can be up to 16 times lower than with direct observable estimation.
  arXiv  Detail & Related papers  (2025-02-27T18:36:30Z)
• Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
  We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. We construct an adaptive estimator using the state's actual variance.
  arXiv  Detail & Related papers  (2025-02-03T19:00:01Z)
• Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits [0.0]
  We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting quantum observables. Exploiting tensor network techniques, our algorithm outputs a set of shallow measurement circuits. Results indicate that DSS can also benefit many larger algorithms requiring estimation of multiple non-commuting observables.
  arXiv  Detail & Related papers  (2024-12-25T19:23:29Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling [0.0]
  We generalize the Approximate Quantum Compiling algorithm into a new method for CNOT-depth reduction. We present a 10-qubit experimental demonstration of Iterative Amplitude Estimation on a quantum computer. The target application is the derivation of the Expected Value of contract portfolios in the energy industry.
  arXiv  Detail & Related papers  (2023-05-16T14:53:08Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• 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.