Post-processing noisy quantum computations utilizing N-representability constraints

• URL: http://arxiv.org/abs/2304.13401v1
• Date: Wed, 26 Apr 2023 09:25:38 GMT
• Title: Post-processing noisy quantum computations utilizing N-representability constraints
• Authors: Tomislav Piskor, Florian G. Eich, Michael Marthaler, Frank K. Wilhelm, and Jan-Michael Reiner
• Abstract summary: We propose and analyze a method for improving quantum chemical energy calculations on a quantum computer impaired by decoherence and shot noise. We post-process the result of an RDM measurement by projecting it into the subspace where certain N-representability conditions are fulfilled.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose and analyze a method for improving quantum chemical energy calculations on a quantum computer impaired by decoherence and shot noise. The error mitigation approach relies on the fact that the one- and two-particle reduced density matrices (1- and 2-RDM) of a chemical system need to obey so-called N-representability constraints. We post-process the result of an RDM measurement by projecting it into the subspace where certain N-representability conditions are fulfilled. Furthermore, we utilize that such constraints also hold in the hole and particle-hole sector and perform projections in these sectors as well. We expand earlier work by conducting a careful analysis of the method's performance in the context of quantum computing. Specifically, we consider typical decoherence channels (dephasing, damping, and depolarizing noise) as well as shot noise due to a finite number of projective measurements. We provide analytical considerations and examine numerically three example systems, \ch{H2}, \ch{LiH}, and \ch{BeH2}. From these investigations, we derive our own practical yet effective method to best employ the various projection options. Our results show the approach to significantly lower energy errors and measurement variances of (simulated) quantum computations.

Related papers

• A two-stage solution to quantum process tomography: error analysis and optimal design [6.648667887733229]
  We propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Our algorithm exhibits a computational complexity of $O(MLd2)$ where $d$ is the dimension of the quantum system. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.
  arXiv  Detail & Related papers  (2024-02-14T05:45:11Z)
• 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)
• Balancing error budget for fermionic k-RDM estimation [0.0]
  This study aims to minimize various error constraints that causes challenges in higher-order RDMs estimation in quantum computing. We identify the optimal balance between statistical and systematic errors in higher-order RDM estimation in particular when cumulant expansion is used to suppress the sample complexity.
  arXiv  Detail & Related papers  (2023-12-29T03:31:39Z)
• Dual-GSE: Resource-efficient Generalized Quantum Subspace Expansion [2.3847436897240453]
  A generalized quantum subspace expansion (GSE) has been proposed that is significantly robust against coherent errors. We propose a resource-efficient implementation of GSE, which we name "Dual-GSE" Remarkably, Dual-GSE can further simulate larger quantum systems beyond the size of available quantum hardware.
  arXiv  Detail & Related papers  (2023-09-25T14:28:40Z)
• Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace [0.8399688944263843]
  In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices. One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method. We propose the fault-subspace method, which constructs an error-mitigated quantum state with copies of quantum states with different noise levels.
  arXiv  Detail & Related papers  (2023-03-14T07:01:30Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• 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)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values [1.51714450051254]
  We show the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We show that the efficacy of the error mitigation is greatly enhanced by additional error suppression techniques and native gate decomposition.
  arXiv  Detail & Related papers  (2021-08-20T14:32:16Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43: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.