Ground state-based quantum feature maps

• URL: http://arxiv.org/abs/2404.07174v1
• Date: Wed, 10 Apr 2024 17:17:05 GMT
• Title: Ground state-based quantum feature maps
• Authors: Chukwudubem Umeano, Oleksandr Kyriienko,
• Abstract summary: We introduce a quantum data embedding protocol based on the preparation of a ground state of a parameterized Hamiltonian. We show that ground state embeddings can be described effectively by a spectrum with degree that grows rapidly with the number of qubits.
• Score: 17.857341127079305
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a quantum data embedding protocol based on the preparation of a ground state of a parameterized Hamiltonian. We analyze the corresponding quantum feature map, recasting it as an adiabatic state preparation procedure with Trotterized evolution. We compare the properties of underlying quantum models with ubiquitous Fourier-type quantum models, and show that ground state embeddings can be described effectively by a spectrum with degree that grows rapidly with the number of qubits, corresponding to a large model capacity. We observe that the spectrum contains massive frequency degeneracies, and the weighting coefficients for the modes are highly structured, thus limiting model expressivity. Our results provide a step towards understanding models based on quantum data, and contribute to fundamental knowledge needed for building efficient quantum machine learning (QML) protocols. As non-trivial embeddings are crucial for designing QML protocols that cannot be simulated classically, our findings guide the search for high-capacity quantum models that can largely outperform classical models.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Studying the phase diagram of the three-flavor Schwinger model in the presence of a chemical potential with measurement- and gate-based quantum computing [0.0]
  We propose an ansatz quantum circuit for the variational quantum eigensolver (VQE) Our ansatz is capable of incorporating relevant model symmetries via constrains on the parameters. We show via classical simulation of the VQE that our ansatz is able to capture the phase structure of the model.
  arXiv  Detail & Related papers  (2023-11-24T19:48:12Z)
• Dequantizing quantum machine learning models using tensor networks [0.0]
  We introduce the dequantizability of the function class of variational quantum-machine-learning(VQML) models. We show that our formalism can properly distinguish VQML models according to their genuine quantum characteristics.
  arXiv  Detail & Related papers  (2023-07-13T17:56:20Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Decoding Measurement-Prepared Quantum Phases and Transitions: from Ising model to gauge theory, and beyond [3.079076817894202]
  Measurements allow efficient preparation of interesting quantum many-body states with long-range entanglement. We demonstrate that the so-called conformal quantum critical points can be obtained by performing general single-site measurements.
  arXiv  Detail & Related papers  (2022-08-24T17:59:58Z)
• On Quantum Circuits for Discrete Graphical Models [1.0965065178451106]
  We provide the first method that allows one to provably generate unbiased and independent samples from general discrete factor models. Our method is compatible with multi-body interactions and its success probability does not depend on the number of variables. Experiments with quantum simulation as well as actual quantum hardware show that our method can carry out sampling and parameter learning on quantum computers.
  arXiv  Detail & Related papers  (2022-06-01T11:03:51Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Direct parameter estimations from machine-learning enhanced quantum state tomography [3.459382629188014]
  Machine-learning enhanced quantum state tomography (QST) has demonstrated its advantages in extracting complete information about the quantum states. We develop a high-performance, lightweight, and easy-to-install supervised characteristic model by generating the target parameters directly. Such a characteristic model-based ML-QST can avoid the problem of dealing with large Hilbert space, but keep feature extractions with high precision.
  arXiv  Detail & Related papers  (2022-03-30T15:16:02Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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.