Locally Tomographic Shadows (Extended Abstract)
- URL: http://arxiv.org/abs/2308.16494v1
- Date: Thu, 31 Aug 2023 06:57:20 GMT
- Title: Locally Tomographic Shadows (Extended Abstract)
- Authors: Howard Barnum, Matthew A. Graydon (Institute for Quantum Computing,
University of Waterloo), Alex Wilce (Susquehanna University)
- Abstract summary: LT$(mathcalC,mathbfV)$ describes phenomena observable by local agents controlling systems.
Some globally distinct states become locally indistinguishable in LT$(mathcalC,mathbfV)$.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Given a monoidal probabilistic theory -- a symmetric monoidal category
$\mathcal{C}$ of systems and processes, together with a functor $\mathbf{V}$
assigning concrete probabilistic models to objects of $\mathcal{C}$ -- we
construct a locally tomographic probabilistic theory
LT$(\mathcal{C},\mathbf{V})$ -- the locally tomographic shadow of
$(\mathcal{C},\mathbf{V})$ -- describing phenomena observable by local agents
controlling systems in $\mathcal{C}$, and able to pool information about joint
measurements made on those systems. Some globally distinct states become
locally indistinguishable in LT$(\mathcal{C},\mathbf{V})$, and we restrict the
set of processes to those that respect this indistinguishability. This
construction is investigated in some detail for real quantum theory.
Related papers
- A Theory of Interpretable Approximations [61.90216959710842]
We study the idea of approximating a target concept $c$ by a small aggregation of concepts from some base class $mathcalH$.
For any given pair of $mathcalH$ and $c$, exactly one of these cases holds: (i) $c$ cannot be approximated by $mathcalH$ with arbitrary accuracy.
We show that, in the case of interpretable approximations, even a slightly nontrivial a-priori guarantee on the complexity of approximations implies approximations with constant (distribution-free and accuracy-
arXiv Detail & Related papers (2024-06-15T06:43:45Z) - Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit [75.4661041626338]
We study the problem of gradient descent learning of a single-index target function $f_*(boldsymbolx) = textstylesigma_*left(langleboldsymbolx,boldsymbolthetarangleright)$ under isotropic Gaussian data.
We prove that a two-layer neural network optimized by an SGD-based algorithm learns $f_*$ of arbitrary link function with a sample and runtime complexity of $n asymp T asymp C(q) cdot d
arXiv Detail & Related papers (2024-06-03T17:56:58Z) - Conformal geometry from entanglement [14.735587711294299]
We identify a quantum information-theoretic mechanism by which the conformal geometry emerges at the gapless edge of a 2+1D quantum many-body system.
We show that stationarity of $mathfrakc_mathrmtot$ is equivalent to a vector fixed-point equation involving $eta$, making our assumption locally checkable.
arXiv Detail & Related papers (2024-04-04T18:00:03Z) - A Unified Framework for Uniform Signal Recovery in Nonlinear Generative
Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously.
Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples.
We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z) - 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) - An Approximation Theory for Metric Space-Valued Functions With A View
Towards Deep Learning [25.25903127886586]
We build universal functions approximators of continuous maps between arbitrary Polish metric spaces $mathcalX$ and $mathcalY$.
In particular, we show that the required number of Dirac measures is determined by the structure of $mathcalX$ and $mathcalY$.
arXiv Detail & Related papers (2023-04-24T16:18:22Z) - Matrix logistic map: fractal spectral distributions and transfer of
chaos [0.0]
We show that for an arbitrary initial ensemble of hermitian random matrices with a continuous level density supported on the interval $[0,1]$, the level density converges to the invariant measure of the logistic map.
This approach generalizes the known model of coupled logistic maps, and allows us to study the transition to chaos in complex networks and multidimensional systems.
arXiv Detail & Related papers (2023-03-10T19:19:56Z) - Nonlocality under Computational Assumptions [51.020610614131186]
A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations.
We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
arXiv Detail & Related papers (2023-03-03T16:53:30Z) - Amplification, inference, and the manifestation of objective classical
information [0.0]
Touil et al. examined a different Holevo quantity, one from a quantum-classical state (a quantum $mathcalS$ to a measured $mathcalF$)
When good decoherence is present$x2013$, $mathcalE/mathcalF$, is often accessible by a quantum channel $mathcalE/mathcalF$.
For the specific model, the accessible information is related to the error probability for optimal detection and, thus, has the same behavior as the quantum Chern
arXiv Detail & Related papers (2022-06-06T18:00:00Z) - Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$.
It is assumed that a density matrix $rho$ can be determined from the expectation values of observables.
Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
arXiv Detail & Related papers (2021-12-14T16:29:53Z) - Universal Regular Conditional Distributions via Probability
Measure-Valued Deep Neural Models [3.8073142980733]
We find that any model built using the proposed framework is dense in the space $C(mathcalX,mathcalP_1(mathcalY))$.
The proposed models are also shown to be capable of generically expressing the aleatoric uncertainty present in most randomized machine learning models.
arXiv Detail & Related papers (2021-05-17T11:34:09Z)
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.