Self-Guided Quantum State Learning for Mixed States
- URL: http://arxiv.org/abs/2106.06166v1
- Date: Fri, 11 Jun 2021 04:40:26 GMT
- Title: Self-Guided Quantum State Learning for Mixed States
- Authors: Ahmad Farooq and Muhammad Asad Ullah and Syahri Ramadhani and Junaid
ur Rehman and Hyundong Shin
- Abstract summary: The salient features of our algorithm are efficient $O left( d3 right)$ post-processing in the infidelity dimension $d$ of the state.
A higher resilience against measurement noise makes our algorithm suitable for noisy intermediate-scale quantum applications.
- Score: 7.270980742378388
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We provide an adaptive learning algorithm for tomography of general quantum
states. Our proposal is based on the simultaneous perturbation stochastic
approximation algorithm and is applicable on mixed qudit states. The salient
features of our algorithm are efficient ($O \left( d^3 \right)$)
post-processing in the dimension $d$ of the state, robustness against
measurement and channel noise, and improved infidelity performance as compared
to the contemporary adaptive state learning algorithms. A higher resilience
against measurement noise makes our algorithm suitable for noisy
intermediate-scale quantum applications.
Related papers
- Hybrid algorithm simulating non-equilibrium steady states of an open
quantum system [10.752869788647802]
Non-equilibrium steady states are a focal point of research in the study of open quantum systems.
Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations.
We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
arXiv Detail & Related papers (2023-09-13T01:57:27Z) - Algorithm for evaluating distance-based entanglement measures [0.0]
We propose an efficient algorithm for evaluating distance-based entanglement measures.
Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state.
arXiv Detail & Related papers (2023-08-04T13:42:55Z) - Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem.
We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
arXiv Detail & Related papers (2023-02-13T19:57:17Z) - Optimal quantum control via genetic algorithms for quantum state
engineering in driven-resonator mediated networks [68.8204255655161]
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms.
We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator.
We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
arXiv Detail & Related papers (2022-06-29T14:34:00Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Approximate Equivalence Checking of Noisy Quantum Circuits [8.36229449571485]
We study the problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably.
The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity.
We present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation.
arXiv Detail & Related papers (2021-03-22T05:47:41Z) - Tunable Tradeoff between Quantum and Classical Computation via
Nonunitary Zeno-like Dynamics [0.5249805590164902]
We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower bounds on its efficiency.
We also study the behavior of the algorithm subject to noise, and find that under certain oracle and operational errors our measurement-based algorithm outperforms the standard algorithm.
arXiv Detail & Related papers (2020-11-22T00:57:17Z) - Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior.
Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm.
Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
arXiv Detail & Related papers (2020-11-18T16:40:45Z) - Robust Reinforcement Learning with Wasserstein Constraint [49.86490922809473]
We show the existence of optimal robust policies, provide a sensitivity analysis for the perturbations, and then design a novel robust learning algorithm.
The effectiveness of the proposed algorithm is verified in the Cart-Pole environment.
arXiv Detail & Related papers (2020-06-01T13:48:59Z) - Active Model Estimation in Markov Decision Processes [108.46146218973189]
We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP)
We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
arXiv Detail & Related papers (2020-03-06T16:17:24Z)
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.