Adaptive quantum state tomography with iterative particle filtering

• URL: http://arxiv.org/abs/2010.12867v2
• Date: Wed, 15 Sep 2021 07:17:00 GMT
• Title: Adaptive quantum state tomography with iterative particle filtering
• Authors: Syed Muhammad Kazim and Ahmad Farooq and Junaid ur Rehman and Hyundong Shin
• Abstract summary: We present an adaptive particle filter based QST protocol which improves the scaling of fidelity compared to nonadaptive Bayesian schemes for arbitrary multi-qubit states. Numerical examples and implementation on IBM quantum devices demonstrate improved performance for arbitrary quantum states.
• Score: 7.943024117353315
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Several Bayesian estimation based heuristics have been developed to perform quantum state tomography (QST). Their ability to quantify uncertainties using region estimators and include a priori knowledge of the experimentalists makes this family of methods an attractive choice for QST. However, specialized techniques for pure states do not work well for mixed states and vice versa. In this paper, we present an adaptive particle filter (PF) based QST protocol which improves the scaling of fidelity compared to nonadaptive Bayesian schemes for arbitrary multi-qubit states. This is due to the protocol's unabating perseverance to find the states's diagonal bases and more systematic handling of enduring problems in popular PF methods relating to the subjectivity of informative priors and the invalidity of particles produced by resamplers. Numerical examples and implementation on IBM quantum devices demonstrate improved performance for arbitrary quantum states and the application readiness of our proposed scheme.

Related papers

• Bounding the Sample Fluctuation for Pure States Certification with Local Random Measurement [4.923287660970805]
  Recent advancements in randomized measurement techniques have provided fresh insights in this area. We investigate the fundamental properties of schemes that certify pure quantum states through random local Haar measurements. Our results unveil the intrinsic interplay between operator complexity and the efficiency of quantum algorithms, serving as an obstacle to local certification of pure states with long-range entanglement.
  arXiv  Detail & Related papers  (2024-10-22T02:26:44Z)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Capturing many-body correlation effects with quantum and classical computing [40.7853309684189]
  We show the efficiency of Quantum Phase Estor (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled cluster formulations.
  arXiv  Detail & Related papers  (2024-02-18T01:26:45Z)
• Quantum Shadow Gradient Descent for Variational Quantum Algorithms [14.286227676294034]
  Gradient-based gradient estimation has been proposed for training variational quantum circuits in quantum neural networks (QNNs) The task of gradient estimation has proven to be challenging due to distinctive quantum features such as state collapse and measurement incompatibility. We develop a novel procedure called quantum shadow descent that uses a single sample per iteration to estimate all components of the gradient.
  arXiv  Detail & Related papers  (2023-10-10T18:45:43Z)
• Ansatz-Agnostic Exponential Resource Saving in Variational Quantum Algorithms Using Shallow Shadows [5.618657159109373]
  Variational Quantum Algorithms (VQA) have been identified as a promising candidate for the demonstration of near-term quantum advantage. We present a protocol based on shallow shadows that achieves similar levels of savings for almost any shallow ansatz studied in the literature. We show that two important applications in quantum information for which VQAs can be a powerful option, namely variational quantum state preparation and variational quantum circuit synthesis.
  arXiv  Detail & Related papers  (2023-09-09T11:00:39Z)
• Demonstration of machine-learning-enhanced Bayesian quantum state estimation [0.0]
  We experimentally realize an approach for defining custom prior distributions that are automatically tuned using machine learning. We show that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution.
  arXiv  Detail & Related papers  (2022-12-15T18:41:15Z)
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation [0.0]
  We introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method.
  arXiv  Detail & Related papers  (2022-02-14T19:00:13Z)
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences [41.42601188771239]
  We create non-classical states of light in three-dimensional microwave cavities. These states are useful for quantum computation. We show that this way of creating non-classical states is robust to fluctuations of the system parameters.
  arXiv  Detail & Related papers  (2021-11-15T18:20:38Z)
• Quantum Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

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.