Home Knowledge Base Heisenberg

Heisenberg

No mentions found

This entity hasn't been tracked yet, or Iris is still building its knowledge base.

Related Articles from SNS

Cyclic ladder operators and hidden Weyl-Heisenberg structure in a Floquet system

arXiv:2606.06810v1 Announce Type: cross Abstract: Ladder operators, found in the quantum harmonic oscillator and other quantized systems, provide an elegant approach to solving or understanding otherwise intricate physics problems. In this Letter, we discuss cyclic ladder operators in both Hermitian and non-Hermitian systems with a finite Hilbert space, with the highest (lowest) level directly descending (ascending) to the lowest (highest) level via a single raising (lowering) operation. We...

arXiv Physics 2d ago

First-Principles-Based Grand Unified Theory (GUT) for Micro-Macro Modal Quantization (MQ)--Part II: Heisenberg-Schrodinger-Dirac Pictures, Act 1

arXiv:1804.09246v2 Announce Type: replace Abstract: This series of papers are devoted to establishing a first-principles-based grand unified theory (GUT) for macroscopic modal quantization (MMQ) or traditionally called eigenmode analysis (EMA) in electrodynamics. This paper focuses on outlining the Schrodinger picture of the GUT. The physical picture and mathematical formalism of the energy-based MMQ are reviewed simply, and an MMQ-oriented numerical method--diagonalizing energy source...

arXiv Physics 1d ago

Controlling $\langle \hat{S}^2 \rangle$ in Broken-symmetry Density Functional Theory Calculations via Constrained Optimization

Announce Type: new Abstract: Accurate determination of magnetic exchange coupling constants ($J$) from density functional theory (DFT) remains challenging, particularly for open-shell systems where broken-symmetry (BS) solutions suffer from spurious spin contamination that systematically exaggerates $J$ values. Several methods have been proposed to address this problem by adjusting the mapping scheme from the DFT energies to the Heisenberg-Dirac-van Vleck effective spin Hamiltonian energies....

arXiv Physics 7d ago

Pauli propagation enables fast classical simulation of strongly correlated quantum systems

Announce Type: replace-cross Abstract: Ground state energy estimation for strongly correlated quantum systems remains a central challenge in computational physics and chemistry. While tensor network methods like DMRG provide efficient solutions for one-dimensional systems, higher-dimensional problems remain difficult. Here we present a variational double bracket flow (vDBF) algorithm that leverages Pauli Propagation, a technique originally developed for classical simulation of quantum...

arXiv Physics 8d ago

Fast Tensor Network Imaginary Time Evolution by Implicit Stepping on Logarithmic Grids

Announce Type: cross Abstract: We present a new method for the efficient imaginary time evolution of quantum many-body wavefunctions represented by matrix product states (MPS). We first show that logarithmic time grids are sufficient to resolve long imaginary time dynamics, yielding an exponential reduction in the number of time steps compared with standard approaches. We then show that A-stable implicit time-stepping methods for ordinary differential equations allow stable propagation for...

arXiv CS 7d ago

Scaling Laws for Neural-Network Quantum States

Announce Type: cross Abstract: Scaling laws, the power-law relations between loss, architecture size, and compute observed in modern neural networks, offer a quantitative way to characterize the complexity of a learning problem, with the exponent governing the decay of the loss reflecting how rapidly additional resources translate into improved accuracy, and thus how hard the target is to learn. Whether an analogous framework can characterize the complexity of physical problems remains open....

arXiv CS 7d ago

Neural Autoregressive Control Variates for the Quantum Monte Carlo Sign Problem

arXiv:2605.26814v2 Announce Type: replace-cross Abstract: We train a pair of autoregressive models to construct zero-mean control variates to mitigate the sign problem in quantum Monte Carlo simulations. The two autoregressive networks are confined to the positive- and negative-sign sectors with strictly disjoint support, and each is exactly normalized over its sector. Their difference is therefore structurally zero-mean, providing an unbiased auxiliary observable whose correlation with the...

arXiv CS 6d ago

Universal consistency of the $k$-NN rule in metric spaces and Nagata dimension. III

Announce Type: replace Abstract: We establish the last missing link allowing to describe those complete separable metric spaces $X$ in which the $k$ nearest neighbour classifier is universally consistent, both in combinatorial terms of dimension theory and via a fundamental property of real analysis. The following are equivalent: (1) The $k$-nearest neighbour classifier is universally consistent in $X$, (2) The strong Lebesgue--Besicovitch differentiation property holds in $X$ for every...

arXiv CS 2d ago

Process-tensor approach to full counting statistics of charge transport in quantum many-body circuits

Announce Type: replace-cross Abstract: We introduce a numerical tensor-network method to compute the statistics of the charge transferred across an interface partitioning an interacting one-dimensional many-body lattice system with $U(1)$ symmetry. Our approach is based on a matrix-product state representation of the process tensor (also known as influence functional or influence matrix) describing the effect of the bulk system on the degrees of freedom at the interface, allowing us to...

arXiv Physics 8d ago

Physics Guided Generative Optimization for Trotter Suzuki Decomposition

Announce Type: replace-cross Abstract: Trotter Suzuki product formulas are the standard route to Hamiltonian evolution on noisy intermediate-scale quantum (\NISQ{}) hardware, but their accuracy depends on three coupled choices: term grouping, product-formula order, and time-step allocation. Grouping and order are discrete, which makes direct gradient optimization infeasible and forces existing compilers to rely on static heuristics. We describe P-GONE, a method that combines a conditional...

arXiv CS 2d ago