Newton Cradle Spectra

• URL: http://arxiv.org/abs/2206.09927v1
• Date: Mon, 20 Jun 2022 18:00:02 GMT
• Title: Newton Cradle Spectra
• Authors: Barbara \v{S}oda, Achim Kempf
• Abstract summary: We prove nonperturbative results on the behavior of eigenvalues and eigenvectors. We apply these results to quantum computing and information theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present broadly applicable nonperturbative results on the behavior of eigenvalues and eigenvectors under the addition of self-adjoint operators and under the multiplication of unitary operators, in finite-dimensional Hilbert spaces. To this end, we decompose these operations into elementary 1-parameter processes in which the eigenvalues move similarly to the spheres in Newton's cradle. As special cases, we recover level repulsion and Cauchy interlacing. We discuss two examples of applications. Applied to adiabatic quantum computing, we obtain new tools to relate algorithmic complexity to computational slowdown through gap narrowing. Applied to information theory, we obtain a generalization of Shannon sampling theory, the theory that establishes the equivalence of continuous and discrete representations of information. The new generalization of Shannon sampling applies to signals of varying information density and finite length.

Related papers

• Positivity of state, trace, and moment polynomials, and applications in quantum information [4.369550829556578]
  State, trace, and moment expressions are expressions in several operator or random variables and positive functionals on their products.<n>They arose from problems in quantum information theory, yet they naturally fit under the umbrella of the theory.<n>This survey presents state, trace, and moment expressions in a concise and unified way.
  arXiv  Detail & Related papers  (2024-12-16T20:33:42Z)
• Gauge-Fixing Quantum Density Operators At Scale [0.0]
  We provide theory, algorithms, and simulations of non-equilibrium quantum systems. We analytically and numerically examine the virtual freedoms associated with the representation of quantum density operators.
  arXiv  Detail & Related papers  (2024-11-05T22:56:13Z)
• Online learning of a panoply of quantum objects [0.873811641236639]
  In many quantum tasks, there is an unknown quantum object that one wishes to learn. We prove a sublinear regret bound for learning over general subsets of positive semidefinite matrices. Our bound applies to many other quantum objects with compact, convex representations.
  arXiv  Detail & Related papers  (2024-06-06T16:44:08Z)
• Deciding finiteness of bosonic dynamics with tunable interactions [0.0]
  We study the corresponding Lie algebras, which can potentially be infinite dimensional. Our work paves the way for better understanding factorization of bosonic dynamics relevant to quantum control and quantum technology.
  arXiv  Detail & Related papers  (2023-12-29T20:33:01Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Understanding the Generalization Ability of Deep Learning Algorithms: A Kernelized Renyi's Entropy Perspective [11.255943520955764]
  We propose a novel information theoretical measure: kernelized Renyi's entropy. We establish the generalization error bounds for gradient/Langevin descent (SGD/SGLD) learning algorithms under kernelized Renyi's entropy. We show that our information-theoretical bounds depend on the statistics of the gradients, and are rigorously tighter than the current state-of-the-art (SOTA) results.
  arXiv  Detail & Related papers  (2023-05-02T01:17:15Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Operator relaxation and the optimal depth of classical shadows [0.0]
  We study the sample complexity of learning the expectation value of Pauli operators via shallow shadows'' We show that the shadow norm is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing circuit.
  arXiv  Detail & Related papers  (2022-12-22T18:46:46Z)
• Instance-Dependent Generalization Bounds via Optimal Transport [51.71650746285469]
  Existing generalization bounds fail to explain crucial factors that drive the generalization of modern neural networks. We derive instance-dependent generalization bounds that depend on the local Lipschitz regularity of the learned prediction function in the data space. We empirically analyze our generalization bounds for neural networks, showing that the bound values are meaningful and capture the effect of popular regularization methods during training.
  arXiv  Detail & Related papers  (2022-11-02T16:39:42Z)
• Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions [9.428671399402553]
  We extend three related results from the analysis of influences of Boolean functions to the quantum inequality setting. Our results are derived by a joint use of recently studied hypercontractivity and gradient estimates. We comment on the implications of our results as regards to noncommutative extensions of isoperimetric type inequalities, quantum circuit complexity lower bounds and the learnability of quantum observables.
  arXiv  Detail & Related papers  (2022-09-15T13:12:32Z)
• Sum-of-Squares Relaxations for Information Theory and Variational Inference [0.0]
  We consider extensions of the Shannon relative entropy, referred to as $f$-divergences. We derive a sequence of convex relaxations for computing these divergences. We provide more efficient relaxations based on spectral information divergences from quantum information theory.
  arXiv  Detail & Related papers  (2022-06-27T13:22:40Z)
• Self-adjoint extension schemes and modern applications to quantum Hamiltonians [55.2480439325792]
  monograph contains revised and enlarged materials from previous lecture notes of undergraduate and graduate courses and seminars delivered by both authors over the last years on a subject that is central both in abstract operator theory and in applications to quantum mechanics. A number of models are discussed, which are receiving today new or renewed interest in mathematical physics, in particular from the point of view of realising certain operators of interests self-adjointly.
  arXiv  Detail & Related papers  (2022-01-25T09:45:16Z)
• 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)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning [1.2891210250935146]
  We motivate several, closely related, short depth continuous variable algorithms for quantum compilation. We analyse the trainability of our proposed cost functions and demonstrate our algorithms by learning arbitrary numerically Gaussian operations. We make connections between this framework and quantum learning theory in the continuous variable setting by deriving No-Free-Lunch theorems.
  arXiv  Detail & Related papers  (2021-05-03T17:50:04Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps [95.62172085878132]
  Eigenvector perturbation analysis plays a vital role in various statistical data science applications. We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector. In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
  arXiv  Detail & Related papers  (2021-04-07T17:55:10Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• Geometry of quantum complexity [0.0]
  Computational complexity is a new quantum information concept that may play an important role in holography. We consider quantum computational complexity for $n$ qubits using Nielsen's geometrical approach.
  arXiv  Detail & Related papers  (2020-11-15T18:41:19Z)
• Entanglement and Complexity of Purification in (1+1)-dimensional free Conformal Field Theories [55.53519491066413]
  We find pure states in an enlarged Hilbert space that encode the mixed state of a quantum field theory as a partial trace. We analyze these quantities for two intervals in the vacuum of free bosonic and Ising conformal field theories.
  arXiv  Detail & Related papers  (2020-09-24T18:00:13Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)

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.