Efficient Quantum Mixed-State Tomography with Unsupervised Tensor Network Machine Learning

• URL: http://arxiv.org/abs/2308.06900v1
• Date: Mon, 14 Aug 2023 02:35:23 GMT
• Title: Efficient Quantum Mixed-State Tomography with Unsupervised Tensor Network Machine Learning
• Authors: Wen-jun Li, Kai Xu, Heng Fan, Shi-ju Ran, and Gang Su
• Abstract summary: We propose an efficient mixed-state quantum state scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. Our work reveals the prospects of applying network state ansatz and the machine learning approaches for efficient QST of many-body states.
• Score: 13.02007068572165
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In this work, we propose an efficient and robust mixed-state tomography scheme based on the locally purified state ansatz. We demonstrate the efficiency and robustness of our scheme on various randomly initiated states with different purities. High tomography fidelity is achieved with much smaller numbers of positive-operator-valued measurement (POVM) bases than the conventional least-square (LS) method. On the superconducting quantum experimental circuit [Phys. Rev. Lett. 119, 180511 (2017)], our scheme accurately reconstructs the Greenberger-Horne-Zeilinger (GHZ) state and exhibits robustness to experimental noises. Specifically, we achieve the fidelity $F \simeq 0.92$ for the 10-qubit GHZ state with just $N_m = 500$ POVM bases, which far outperforms the fidelity $F \simeq 0.85$ by the LS method using the full $N_m = 3^{10} = 59049$ bases. Our work reveals the prospects of applying tensor network state ansatz and the machine learning approaches for efficient QST of many-body states.

Related papers

• Near-Term Quantum Spin Simulation of the Spin-$\frac{1}{2}$ Square $J_{1}-J_{2}$ Heisenberg Model [0.0]
  This study focuses on the $J_1-J_2$ Heisenberg model, renowned for its rich phase behavior on the square lattice. We conducted the first experimental quantum computing study of this model using the 127-qubit IBM Rensselear Eagle processor.
  arXiv  Detail & Related papers  (2024-06-26T16:33:40Z)
• Learning topological states from randomized measurements using variational tensor network tomography [0.4818215922729967]
  Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. We implement and study a tomographic method that combines variational optimization on tensor networks with randomized measurement techniques. We demonstrate its ability to learn the ground state of the surface code Hamiltonian as well as an experimentally realizable quantum spin liquid state.
  arXiv  Detail & Related papers  (2024-05-31T21:05:43Z)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Provable learning of quantum states with graphical models [4.004283689898333]
  We show that certain quantum states can be learned with a sample complexity textitexponentially better than naive tomography. Our results allow certain quantum states to be learned with a sample complexity textitexponentially better than naive tomography.
  arXiv  Detail & Related papers  (2023-09-17T10:36:24Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• Efficient Verification of Anticoncentrated Quantum States [0.38073142980733]
  I present a novel method for estimating the fidelity $F(mu,tau)$ between a preparable quantum state $mu$ and a classically specified target state $tau$. I also present a more sophisticated version of the method, which uses any efficiently preparable and well-characterized quantum state as an importance sampler.
  arXiv  Detail & Related papers  (2020-12-15T18:01:11Z)
• Quantum State Interferography [0.0]
  In this letter, we present an interferometric method, in which, any qubit state, whether mixed or pure, can be inferred from the visibility, phase shift and average intensity of an interference pattern using a single shot measurement. We experimentally implement our method with high fidelity using the polarisation degree of freedom of light.
  arXiv  Detail & Related papers  (2020-02-18T09:32:47Z)

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.