Storage and retrieval of von Neumann measurements via indefinite causal order structures

• URL: http://arxiv.org/abs/2405.11202v1
• Date: Sat, 18 May 2024 07:11:57 GMT
• Title: Storage and retrieval of von Neumann measurements via indefinite causal order structures
• Authors: Paulina Lewandowska, Ryszard Kukulski,
• Abstract summary: This work presents the problem of learning an unknown von Neumann measurement of dimension $d$ using indefinite causal structures. We use formalism of process matrices to store information about the given measurement. We show that for the qubit von Neumann measurements using indefinite causal learning structures provide better approximation than quantum networks.
• Score: 1.9506923346234724
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work presents the problem of learning an unknown von Neumann measurement of dimension $d$ using indefinite causal structures. In the considered scenario, we have access to $N$ copies of the measurement. We use formalism of process matrices to store information about the given measurement, that later will be used to reproduce its best possible approximation. Our goal is to compute the maximum value of the average fidelity function $F_d(N)$ of our procedure. We prove that $F_d(N) = 1 - \Theta \left( \frac{1}{N^2}\right)$ for arbitrary but fixed dimension $d$. Furthermore, we present the SDP program for computing $F_d(N)$. Basing on the numerical investigation, we show that for the qubit von Neumann measurements using indefinite causal learning structures provide better approximation than quantum networks, starting from $N \ge 3$.

Related papers

• Private Mean Estimation with Person-Level Differential Privacy [6.621676316292624]
  We study person-level differentially private mean estimation in the case where each person holds multiple samples. We give computationally efficient algorithms under approximate-DP and computationally inefficient algorithms under pure DP, and our nearly matching lower bounds hold for the most permissive case of approximate DP.
  arXiv  Detail & Related papers  (2024-05-30T18:20:35Z)
• A quasi-polynomial time algorithm for Multi-Dimensional Scaling via LP hierarchies [34.7582575446942]
  Multi-dimensional Scaling (MDS) is a family of methods for embedding an $n$-point metric into low-dimensional Euclidean space. We give the first approximation algorithm for MDS with quasi-polynomial dependency on $Delta$.
  arXiv  Detail & Related papers  (2023-11-29T17:42:05Z)
• Quantum speedups for linear programming via interior point methods [1.8434042562191815]
  We describe a quantum algorithm for solving a linear program with $n$ inequality constraints on $d$ variables. Our algorithm speeds up the Newton step in the state-of-the-art interior point method of Lee and Sidford.
  arXiv  Detail & Related papers  (2023-11-06T16:00:07Z)
• Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories [70.90012822736988]
  Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to intrinsic data structures. This paper introduces a relaxed assumption that input data are concentrated around a subset of $mathbbRd$ denoted by $mathcalS$, and the intrinsic dimension $mathcalS$ can be characterized by a new complexity notation -- effective Minkowski dimension.
  arXiv  Detail & Related papers  (2023-06-26T17:13:31Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Storage and retrieval of von Neumann measurements [0.0]
  This work examines the problem of learning an unknown von Neumann measurement of dimension $d$ from a finite number of copies. Our main goal is to estimate the behavior of the maximum value of the average fidelity function $F_d$ for a general $N rightarrow 1$ learning scheme.
  arXiv  Detail & Related papers  (2022-04-06T18:19:04Z)
• Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally [58.463668865380946]
  We study the statistical limits of Imitation Learning in episodic Markov Decision Processes (MDPs) with a state space $mathcalS$. We establish an upper bound $O(|mathcalS|H3/2/N)$ for the suboptimality using the Mimic-MD algorithm in Rajaraman et al ( 2020) We show the minimax suboptimality grows as $Omega( H3/2/N)$ when $mathcalS|geq 3$ while the unknown-transition setting suffers from a larger sharp rate
  arXiv  Detail & Related papers  (2021-02-25T15:50:19Z)
• Streaming Complexity of SVMs [110.63976030971106]
  We study the space complexity of solving the bias-regularized SVM problem in the streaming model. We show that for both problems, for dimensions of $frac1lambdaepsilon$, one can obtain streaming algorithms with spacely smaller than $frac1lambdaepsilon$.
  arXiv  Detail & Related papers  (2020-07-07T17:10:00Z)
• Maximizing Determinants under Matroid Constraints [69.25768526213689]
  We study the problem of finding a basis $S$ of $M$ such that $det(sum_i in Sv_i v_i v_itop)$ is maximized. This problem appears in a diverse set of areas such as experimental design, fair allocation of goods, network design, and machine learning.
  arXiv  Detail & Related papers  (2020-04-16T19:16:38Z)
• Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs [0.0]
  We study the problem of finding $K$ collision pairs in a random function $f : [N] rightarrow [N]$ by using a quantum computer. We prove that the number of queries to the function must increase significantly when the size of the available memory is limited.
  arXiv  Detail & Related papers  (2020-02-20T18:48:51Z)

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.