The signaling dimension of two-dimensional and polytopic systems

• URL: http://arxiv.org/abs/2407.17725v1
• Date: Thu, 25 Jul 2024 02:54:21 GMT
• Title: The signaling dimension of two-dimensional and polytopic systems
• Authors: Shuriku Kai, Michele Dall'Arno,
• Abstract summary: The signaling dimension of any given physical system represents its classical simulation cost. We propose a branch and bound division-free algorithm for the exact computation of the symmetries of any given polytope. We apply our algorithm to compute the exact value of the signaling dimension for all rational Platonic, Archimedean, and Catalan solids.
• Score: 2.4554686192257424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling dimension landscape is vastly unexplored; the only non-trivial systems whose signaling dimension is known -- other than quantum systems -- are the octahedron and the composition of two squares. Building on previous results by Matsumoto, Kimura, and Frenkel, our first result consists of deriving bounds on the signaling dimension of any system as a function of its Minkowski measure of asymmetry. We use such bounds to prove that the signaling dimension of any two-dimensional system (i.e. with two-dimensional set of admissible states, such as polygons and the real qubit) is two if and only if such a set is centrally symmetric, and three otherwise, thus conclusively settling the problem of the signaling dimension for such systems. Guided by the relevance of symmetries in the two dimensional case, we propose a branch and bound division-free algorithm for the exact computation of the symmetries of any given polytope, in polynomial time in the number of vertices and in factorial time in the dimension of the space. Our second result then consist of providing an algorithm for the exact computation of the signaling dimension of any given system, that outperforms previous proposals by exploiting the aforementioned bounds to improve its pruning techniques and incorporating as a subroutine the aforementioned symmetries-finding algorithm. We apply our algorithm to compute the exact value of the signaling dimension for all rational Platonic, Archimedean, and Catalan solids, and for the class of hyper-octahedral systems up to dimension five.

Related papers

• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• The signaling dimension in generalized probabilistic theories [48.99818550820575]
  The signaling dimension of a given physical system quantifies the minimum dimension of a classical system required to reproduce all input/output correlations of the given system. We show that it suffices to consider extremal measurements with rayextremal effects, and we bound the number of elements of any such measurement in terms of the linear dimension. For systems with a finite number of extremal effects, we recast the problem of characterizing the extremal measurements with ray-extremal effects.
  arXiv  Detail & Related papers  (2023-11-22T02:09:16Z)
• Automated detection of symmetry-protected subspaces in quantum simulations [0.0]
  We introduce two classical algorithms, which efficiently compute and elucidate features of symmetry-protected subspaces. These algorithms lend themselves to the post-selection of quantum computer data, optimized classical simulation of quantum systems, and the discovery of previously hidden symmetries in quantum mechanical systems.
  arXiv  Detail & Related papers  (2023-02-16T21:17:48Z)
• Oracle-Preserving Latent Flows [58.720142291102135]
  We develop a methodology for the simultaneous discovery of multiple nontrivial continuous symmetries across an entire labelled dataset. The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function. The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to transformations invariant with respect to high-dimensional oracles.
  arXiv  Detail & Related papers  (2023-02-02T00:13:32Z)
• Threshold size for the emergence of a classical-like behaviour [68.8204255655161]
  We design a procedure to estimate the minimum size beyond which a system is amenable to a classical-like description. The specific case of a magnetic system is considered, with details of a gedanken experiment presented and thoroughly commented.
  arXiv  Detail & Related papers  (2022-03-25T11:31:14Z)
• Dimensionally Consistent Learning with Buckingham Pi [4.446017969073817]
  In absence of governing equations, dimensional analysis is a robust technique for extracting insights and finding symmetries in physical systems. We propose an automated approach using the symmetric and self-similar structure of available measurement data to discover dimensionless groups. We develop three data-driven techniques that use the Buckingham Pi theorem as a constraint.
  arXiv  Detail & Related papers  (2022-02-09T17:58:00Z)
• Neural-Network Quantum States for Periodic Systems in Continuous Space [66.03977113919439]
  We introduce a family of neural quantum states for the simulation of strongly interacting systems in the presence of periodicity. For one-dimensional systems we find very precise estimations of the ground-state energies and the radial distribution functions of the particles. In two dimensions we obtain good estimations of the ground-state energies, comparable to results obtained from more conventional methods.
  arXiv  Detail & Related papers  (2021-12-22T15:27:30Z)
• Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models [0.0]
  We introduce a manifold learning-based method for uncertainty quantification (UQ) in describing systems. The proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
  arXiv  Detail & Related papers  (2021-07-21T00:24:15Z)
• Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
  DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term. We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
  arXiv  Detail & Related papers  (2021-06-14T17:19:44Z)
• Quantum information dynamics in a high-dimensional parity-time-symmetric system [3.2363688674314814]
  Non-Hermitian systems with parity-time ($mathcalPT$) symmetry give rise to exceptional points (EPs) with exceptional properties. We simulate quantum dynamics of a four-dimensional $mathcalPT$-symmetric system across a fourth-order exceptional point.
  arXiv  Detail & Related papers  (2021-02-12T19:00:44Z)

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.