Minimal informationally complete measurements for probability representation of quantum dynamics

• URL: http://arxiv.org/abs/2006.13727v2
• Date: Fri, 16 Oct 2020 04:30:21 GMT
• Title: Minimal informationally complete measurements for probability representation of quantum dynamics
• Authors: V.I. Yashin, E.O. Kiktenko, A.S. Mastiukova, and A.K. Fedorov
• Abstract summary: We suggest an approach for describing dynamics of finite-dimensional quantum systems in terms of pseudostochastic maps acting on probability distributions. A key advantage of the suggested approach is that minimal informationally complete positive operator-valued measures (MIC-POVMs) are easier to construct in comparison with their symmetric versions (SIC-POVMs) We apply the MIC-POVM-based probability representation to the digital quantum computing model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the present work, we suggest an approach for describing dynamics of finite-dimensional quantum systems in terms of pseudostochastic maps acting on probability distributions, which are obtained via minimal informationally complete quantum measurements. The suggested method for probability representation of quantum dynamics preserves the tensor product structure, which makes it favourable for the analysis of multi-qubit systems. A key advantage of the suggested approach is that minimal informationally complete positive operator-valued measures (MIC-POVMs) are easier to construct in comparison with their symmetric versions (SIC-POVMs). We establish a correspondence between the standard quantum-mechanical formalism and the MIC-POVM-based probability formalism. Within the latter approach, we derive equations for the unitary von-Neumann evolution and the Markovian dissipative evolution, which is governed by the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) generator. We apply the MIC-POVM-based probability representation to the digital quantum computing model. In particular, for the case of spin-$1/2$ evolution, we demonstrate identifying a transition of a dissipative quantum dynamics to a completely classical-like stochastic dynamics. One of the most important findings is that the MIC-POVM-based probability representation gives more strict requirements for revealing the non-classical character of dissipative quantum dynamics in comparison with the SIC-POVM-based approach. Our results give a physical interpretation of quantum computations and pave a way for exploring the resources of noisy intermediate-scale quantum (NISQ) devices.

Related papers

• Simulating a quasiparticle on a quantum device [0.0]
  We propose a variational approach to explore quasiparticle excitations in interacting quantum many-body systems. We benchmark the proposed algorithm via numerical simulations performed on the one-dimension transverse field Ising chain. We show that the localized quasiparticle states constructed with VQE contain accessible information on the full band of quasiparticles.
  arXiv  Detail & Related papers  (2024-09-13T05:39:13Z)
• Quantum Dynamical Hamiltonian Monte Carlo [0.0]
  A ubiquitous problem in machine learning is sampling from probability distributions that we only have access to via their log probability. We extend the well-known Hamiltonian Monte Carlo (HMC) method for Chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner.
  arXiv  Detail & Related papers  (2024-03-04T07:08:23Z)
• A new quantum machine learning algorithm: split hidden quantum Markov model inspired by quantum conditional master equation [14.262911696419934]
  We introduce the split HQMM (SHQMM) for implementing the hidden quantum Markov process. Experimental results suggest our model outperforms previous models in terms of scope of applications and robustness.
  arXiv  Detail & Related papers  (2023-07-17T16:55:26Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Experimental validation of the Kibble-Zurek Mechanism on a Digital Quantum Computer [62.997667081978825]
  The Kibble-Zurek mechanism captures the essential physics of nonequilibrium quantum phase transitions with symmetry breaking. We experimentally tested the KZM for the simplest quantum case, a single qubit under the Landau-Zener evolution. We report on extensive IBM-Q experiments on individual qubits embedded in different circuit environments and topologies.
  arXiv  Detail & Related papers  (2022-08-01T18:00:02Z)
• 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)
• Probing non-Markovian quantum dynamics with data-driven analysis: Beyond "black-box" machine learning models [0.0]
  We propose a data-driven approach to the analysis of the non-Markovian dynamics of open quantum systems. Our method allows, on the one hand, capturing the effective dimension of the environment and the spectrum of the joint system-environment quantum dynamics. We demonstrate the performance of the proposed approach with various models of open quantum systems.
  arXiv  Detail & Related papers  (2021-03-26T14:27:33Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.