An access model for quantum encoded data

• URL: http://arxiv.org/abs/2412.01889v2
• Date: Fri, 27 Dec 2024 16:32:08 GMT
• Title: An access model for quantum encoded data
• Authors: Miguel Murça, Paul K. Faehrmann, Yasser Omar,
• Abstract summary: We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states. We illustrate that this is compositional and has some computational power. We apply these results to obtain improvements over the state of the art in the sample and computational complexity of distributed inner product estimation.
• Score: 0.0
• License:
• Abstract: We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states, as well as in contexts such as classical quantum circuit simulation or Pauli sampling. We illustrate that this abstraction is compositional and has some computational power. We then apply these results to obtain polynomial improvements over the state of the art in the sample and computational complexity of distributed inner product estimation. By doing so, we provide a new interpretation for why Pauli sampling is useful for this task. Our results partially characterize the power of time-limited fault-tolerant quantum circuits aided by classical computation. They are a first step towards extending the classical data Quantum Singular Value Transform dequantization results to a quantum setting.

Related papers

• Quantum computer formulation of the FKP-operator eigenvalue problem for probabilistic learning on manifolds [0.0]
  We present a quantum computing formulation to address a challenging problem in the development of probabilistic learning on manifold (PLoM) It involves solving the spectral problem of the high-dimensional Fokker-Planck operator, which remains beyond the reach of classical computing. Explicit formulas for the Laplacian and potential are derived and mapped onto qubits using Pauli matrix expressions.
  arXiv  Detail & Related papers  (2025-02-20T14:05:16Z)
• Quantum data encoding as a distinct abstraction layer in the design of quantum circuits [1.1510009152620668]
  We formalize the concept of quantum data encoding, namely the format providing a representation of a data set through a quantum state. We show how major quantum algorithms find a natural interpretation in terms of data loading. The new conceptual framework is exemplified by considering its application to quantum-based Monte Carlo simulations.
  arXiv  Detail & Related papers  (2024-09-14T07:00:58Z)
• 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)
• Quantum Signal Processing, Phase Extraction, and Proportional Sampling [0.0]
  Quantum Signal Processing (QSP) is a technique that can be used to implement a transformation $P(x)$ applied to the eigenvalues of a unitary $U$. We show that QSP can be used to tackle a new problem, which we call phase extraction, and that this can be used to provide quantum speed-up for proportional sampling.
  arXiv  Detail & Related papers  (2023-03-20T13:05:29Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum advantage in temporally flat measurement-based quantum computation [0.0]
  We study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible.
  arXiv  Detail & Related papers  (2022-12-07T14:34:56Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Computational advantage of quantum random sampling [0.913755431537592]
  We review the theoretical underpinning of quantum random sampling in terms of computational complexity and verifiability. We discuss in detail open questions in the field and provide perspectives for the road ahead, including potential applications of quantum random sampling.
  arXiv  Detail & Related papers  (2022-06-08T18:00:03Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)

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.