Neural Networks for Quantum Inverse Problems

• URL: http://arxiv.org/abs/2005.01540v2
• Date: Sun, 17 Jan 2021 14:13:26 GMT
• Title: Neural Networks for Quantum Inverse Problems
• Authors: Ningping Cao, Jie Xie, Aonan Zhang, Shi-Yao Hou, Lijian Zhang, and Bei Zeng
• Abstract summary: Quantum Inverse Problem (QIP) is the problem of estimating an unknown quantum system from a set of measurements. We present a neural network based method for QIPs, which has been widely explored for its classical counterpart. Our method yields high fidelity, efficiency and robustness for both numerical experiments and quantum optical experiments.
• Score: 7.177969023041846
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Inverse Problem (QIP) is the problem of estimating an unknown quantum system $\rho$ from a set of measurements, whereas the classical counterpart is the Inverse Problem of estimating a distribution from a set of observations. In this paper, we present a neural network based method for QIPs, which has been widely explored for its classical counterpart. The proposed method utilizes the quantum-ness of the QIPs and takes advantage of the computational power of neural networks to achieve higher efficiency for the quantum state estimation. We test the method on the problem of Maximum Entropy Estimation of an unknown state $\rho$ from partial information. Our method yields high fidelity, efficiency and robustness for both numerical experiments and quantum optical experiments.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Unsupervised Random Quantum Networks for PDEs [0.0]
  PINNs approximate solutions to PDEs with the help of deep neural networks trained to satisfy the differential operator and the relevant boundary conditions. We revisit this idea in the quantum computing realm, using parameterised random quantum circuits as trial solutions. We show numerically that random quantum networks can outperform more traditional quantum networks as well as random classical networks.
  arXiv  Detail & Related papers  (2023-12-21T10:25:52Z)
• Estimating Quantum Mutual Information Through a Quantum Neural Network [0.8988769052522807]
  We propose a method of quantum machine learning called quantum mutual information neural estimation (QMINE) QMINE estimates von Neumann entropy and quantum mutual information, which are fundamental properties in quantum information theory. numerical observations support our predictions of QDVR and demonstrate the good performance of QMINE.
  arXiv  Detail & Related papers  (2023-06-26T10:26:45Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• An unsupervised feature learning for quantum-classical convolutional network with applications to fault detection [5.609958919699706]
  We present a simple unsupervised method for quantum-classical convolutional networks to learn a hierarchy of quantum feature extractors. The main contribution of the proposed approach is to use the $K$-means clustering to maximize the difference of quantum properties in quantum circuit ansatz.
  arXiv  Detail & Related papers  (2021-07-17T03:16:59Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Quantum Stochastic Walk Models for Quantum State Discrimination [6.85316573653194]
  Quantum Walks (QSW) allow for a generalization of both quantum and classical random walks. We consider the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights.
  arXiv  Detail & Related papers  (2020-03-30T08:07: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.