Related papers: Time Reversal and n-qubit Canonical Decompositions
In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
Internal symmetries can be used to classify multiple solutions to the time energy canonical commutation relation (TE-CCR). The dynamical behavior of solutions to the TE-CCR posessing particular internal symmetries involving time reversal…
Continuous unitary transformations are a powerful tool to extract valuable information out of quantum many-body Hamiltonians, in which the so-called flow equation transforms the Hamiltonian to a diagonal or block-diagonal form in second…
The action for a massless particle in 4D Minkowski space has a worldline time-reversing symmetry corresponding to CPT invariance of the quantum theory. The analogous symmetry of the N-extended superparticle is shown to be anomalous when N…
Tensor decompositions have become a central tool in data science, with applications in areas such as data analysis, signal processing, and machine learning. A key property of many tensor decompositions, such as the canonical polyadic…
The spontaneous breaking of non-invertible symmetries can lead to exotic phenomena such as coexistence of order and disorder. Here we explore second-order phase transitions in 1d spin chains between two phases that correspond to distinct…
Canonical quantization applied to closed systems leads to static equations, the Wheeler-deWitt equation in Quantum Gravity and the time independent Schr\"odinger equation in Quantum Mechanics. How to restore time is the Problem of Time(s).…
Classical data analysis requires computational efforts that become intractable in the age of Big Data. An essential task in time series analysis is the extraction of physically meaningful information from a noisy time series. One algorithm…
Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of…
It is well known that a commuting family of diagonalizable linear operators on a finite dimensional vector space is simultaneously diagonalizable. In this paper, we consider a family A of anti-commuting (complex) linear operators on a…
We study the spin correlations to probe time-reversal~(T) asymmetries in the decays of $\Lambda_b \to \Lambda V ~(V=\phi, \rho^0, \omega, K^{*0})$. The eigenstates of the T-odd operators are obtained along with definite angular momenta. We…
We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction $\alpha<1$ of adversarial crash faults. In particular, we show how a network of $n$ nodes can compute any circuit of…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
Quantum mechanics exhibits a wide range of nonclassical features, of which entanglement in multipartite systems takes a central place. In several specific settings, it is well known that nonclassicality (e.g., squeezing, spin squeezing,…
In a sense of deformation quantization, noncommutative (NC) geometry introduces a quantum structure of spacetime. Using the twist-deformation formalism, we show that the dynamical effects of spacetime noncommutativity can amount to a…
Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of…
The concepts of Wigner time delay and Wigner-Smith matrix allow to characterize temporal aspects of a quantum scattering process. The article reviews the statistical properties of the Wigner time delay for disordered systems; the case of…
We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors.…